| 2013 | ||
|---|---|---|
| c33 | Gerhard Niederbrucker, Wilfried N. Gansterer: Robust gossip-based aggregation: A practical point of view. ALENEX 2013: 133-147 | |
| c32 | Hana Straková, Wilfried N. Gansterer: A Distributed Eigensolver for Loosely Coupled Networks. PDP 2013: 51-57 | |
| 2012 | ||
| j16 | Gerhard König, Michael Moldaschl, Wilfried N. Gansterer: Computing eigenvectors of block tridiagonal matrices based on twisted block factorizations. J. Computational Applied Mathematics 236(15): 3696-3703 (2012) | |
| j15 | Thang Viet Huynh, Manfred Mücke, Wilfried N. Gansterer: Evaluation of the Stretch S6 Hybrid Reconfigurable Embedded CPU Architecture for Power-Efficient Scientific Computing. Procedia CS 9: 196-205 (2012) | |
| c31 | Gerhard Niederbrucker, Hana Straková, Wilfried N. Gansterer: Improving Fault Tolerance and Accuracy of a Distributed Reduction Algorithm. SC Companion 2012: 643-651 | |
| c30 | Hana Straková, Wilfried N. Gansterer: Abstract: Gossip-Based Distributed Matrix Computations. SC Companion 2012: 1405-1406 | |
| c29 | Hana Straková, Wilfried N. Gansterer: Poster: Gossip-Based Distributed Matrix Computations. SC Companion 2012: 1407 | |
| 2011 | ||
| j14 | Andreas Janecek, S. Schulze Grotthoff, Wilfried N. Gansterer: libNMF - A Library for Nonnegative Matrix Factorization. Computing and Informatics 30(2): 205-224 (2011) | |
| j13 | Gerhard Niederbrucker, Wilfried N. Gansterer: Effcient Solution of Evolution Models for Virus Populations. Procedia CS 4: 126-135 (2011) | |
| j12 | Bernd Lesser, Manfred Mücke, Wilfried N. Gansterer: Effects of Reduced Precision on Floating-Point SVM Classification Accuracy. Procedia CS 4: 508-517 (2011) | |
| c28 | Thang Viet Huynh, Manfred Mücke, Wilfried N. Gansterer: Native Double Precision LINPACK Implementation on a Hybrid Reconfigurable CPU. IPDPS Workshops 2011: 298-301 | |
| c27 | Hana Straková, Wilfried N. Gansterer, Thomas Zemen: Distributed QR Factorization Based on Randomized Algorithms. PPAM (1) 2011: 235-244 | |
| c26 | Gerhard Niederbrucker, Wilfried N. Gansterer: A fast solver for modeling the evolution of virus populations. SC 2011: 74 | |
| e1 | Karin Anna Hummel, Helmut Hlavacs, Wilfried N. Gansterer (Eds.): Performance Evaluation of Computer and Communication Systems. Milestones and Future Challenges - IFIP WG 6.3/7.3 International Workshop, PERFORM 2010, in Honor of Günter Haring on the Occasion of His Emeritus Celebration, Vienna, Austria, October 14-16, 2010, Revised Selected Papers. Lecture Notes in Computer Science 6821, Springer 2011, isbn 978-3-642-25574-8 | |
| 2010 | ||
| j11 | Alexander K. Seewald, Wilfried N. Gansterer: On the detection and identification of botnets. Computers & Security 29(1): 45-58 (2010) | |
| j10 | Martin Koehler, Matthias Ruckenbauer, Ivan Janciak, Siegfried Benkner, Hans Lischka, Wilfried N. Gansterer: A grid services cloud for molecular modelling workflows. IJWGS 6(2): 176-195 (2010) | |
| j9 | Wilfried N. Gansterer, Gerhard König: On twisted factorizations of block tridiagonal matrices. Procedia CS 1(1): 279-287 (2010) | |
| j8 | Hannes Schabauer, Christoph Pacher, Andrew G. Sunderland, Wilfried N. Gansterer: Toward a parallel solver for generalized complex symmetric eigenvalue problems. Procedia CS 1(1): 437-445 (2010) | |
| c25 | Manfred Mücke, Bernd Lesser, Wilfried N. Gansterer: Peak Performance Model for a Custom Precision Floating-Point Dot Product on FPGAs. Euro-Par Workshops 2010: 399-406 | |
| c24 | Martin Koehler, Matthias Ruckenbauer, Ivan Janciak, Siegfried Benkner, Hans Lischka, Wilfried N. Gansterer: Supporting Molecular Modeling Workflows within a Grid Services Cloud. ICCSA (4) 2010: 13-28 | |
| 2009 | ||
| c23 | David Pölz, Wilfried N. Gansterer: Trustnet Architecture for E-mail Communication. DEXA Workshops 2009: 48-52 | |
| c22 | ||
| c21 | Wilfried N. Gansterer, A. R. Gruber, Christoph Pacher: Non-splitting Tridiagonalization of Complex Symmetric Matrices. ICCS (1) 2009: 481-490 | |
| 2008 | ||
| j7 | Andreas Janecek, Wilfried N. Gansterer, Michael Demel, Gerhard Ecker: On the Relationship Between Feature Selection and Classification Accuracy. Journal of Machine Learning Research - Proceedings Track 4: 90-105 (2008) | |
| j6 | Martin Petraschek, Thomas Hoeher, Oliver Jung, Helmut Hlavacs, Wilfried N. Gansterer: Security and Usability Aspects of Man-in-the-Middle Attacks on ZRTP. J. UCS 14(5): 673-692 (2008) | |
| j5 | Helmut Hlavacs, Wilfried N. Gansterer, Hannes Schabauer, Joachim Zottl, Martin Petraschek, Thomas Hoeher, Oliver Jung: Enhancing ZRTP by using Computational Puzzles. J. UCS 14(5): 693-716 (2008) | |
| c20 | Andreas Janecek, Wilfried N. Gansterer, K. Ashwin Kumar: Multi-Level Reputation-Based Greylisting. ARES 2008: 10-17 | |
| c19 | Majid I. Khan, Wilfried N. Gansterer, Günter Haring: Identifying the Boundary of a Wireless Sensor Network with a Mobile Sink. ADHOC-NOW 2008: 369-379 | |
| c18 | Wilfried N. Gansterer, Hannes Schabauer, Christoph Pacher, N. Finger: Tridiagonalizing Complex Symmetric Matrices in Waveguide Simulations. ICCS (1) 2008: 945-954 | |
| c17 | Majid I. Khan, Wilfried N. Gansterer, Günter Haring: Energy consumption vs. latency in a new boundary identification method for WSNs with a mobile sink. MOBIWAC 2008: 125-132 | |
| c16 | Gerald Stampfel, Wilfried N. Gansterer, Martin Ilger: Implications of the EU Data Retention Directive 2006/24/EC. Sicherheit 2008: 45-58 | |
| c15 | Wilfried N. Gansterer, Michael Ilger: Towards Self-Learning and Fully Transparent UCE Prevention. Sicherheit 2008: 277-290 | |
| 2007 | ||
| j4 | Majid I. Khan, Wilfried N. Gansterer, Günter Haring: Congestion Avoidance and Energy Efficient Routing Protocol for Wireless Sensor Networks with a Mobile Sink. JNW 2(6): 42-49 (2007) | |
| c14 | ||
| c13 | Wilfried N. Gansterer, Andreas Janecek, Peter Lechner: A Reliable Component-Based Architecture for E-Mail Filtering. ARES 2007: 43-52 | |
| c12 | Joachim Zottl, Wilfried N. Gansterer, Helmut Hlavacs: A Hierarchical Two-Tier Information Management Architecture for Mobile Ad-Hoc Grid Environments. CCGRID 2007: 707-712 | |
| c11 | Majid I. Khan, Wilfried N. Gansterer, Günter Haring: In-Network Storage Model for Data Persistence under Congestion in Wireless Sensor Network. CISIS 2007: 221-228 | |
| c10 | Matthias Ruckenbauer, Ivona Brandic, Siegfried Benkner, Wilfried N. Gansterer, Osvaldo Gervasi, Mario Barbatti, Hans Lischka: Nonadiabatic Ab Initio Surface-Hopping Dynamics Calculation in a Grid Environment - First Experiences. ICCSA (1) 2007: 281-294 | |
| 2005 | ||
| c9 | Wilfried N. Gansterer, Joachim Zottl: Parallelization of Divide-and-Conquer Eigenvector Accumulation. Euro-Par 2005: 847-856 | |
| c8 | Wilfried N. Gansterer: Computing Orthogonal Decompositions of Block Tridiagonal or Banded Matrices. International Conference on Computational Science (1) 2005: 25-32 | |
| c7 | Wilfried N. Gansterer, Wolfgang Kreuzer, Hans Lischka: Data Reduction Schemes in Davidson Subspace Diagonalization for MR-CI. LSSC 2005: 564-571 | |
| 2004 | ||
| j3 | Yihua Bai, Wilfried N. Gansterer, Robert C. Ward: Block tridiagonalization of "effectively" sparse symmetric matrices. ACM Trans. Math. Softw. 30(3): 326-352 (2004) | |
| c6 | Joachim Zottl, Wilfried N. Gansterer: Message Passing vs. Virtual Shared Memory, A Performance Comparison. DAPSYS 2004: 39-46 | |
| 2002 | ||
| j2 | Harald J. Ehold, Wilfried N. Gansterer, Dieter F. Kvasnicka, Christoph W. Ueberhuber: Optimizing Local Performance in HPF. Parallel Computing 28(3): 415-432 (2002) | |
| j1 | Wilfried N. Gansterer, Robert C. Ward, Richard P. Muller: An extension of the divide-and-conquer method for a class of symmetric block-tridiagonal eigenproblems. ACM Trans. Math. Softw. 28(1): 45-58 (2002) | |
| 1999 | ||
| c5 | Wilfried N. Gansterer, Dieter F. Kvasnicka, Christoph W. Ueberhuber: Blocking Techniques in Numerical Software. ACPC 1999: 127-139 | |
| c4 | Harald J. Ehold, Wilfried N. Gansterer, Dieter F. Kvasnicka, Christoph W. Ueberhuber: HPF and Numerical Libraries. ACPC 1999: 140-152 | |
| c3 | Helmut Kofler, Ernst J. Haunschmid, Wilfried N. Gansterer, Christoph W. Ueberhuber: The Locality Property in Topological Irregular Graph Hierarchies. ACPC 1999: 437-449 | |
| c2 | Wilfried N. Gansterer, Dieter F. Kvasnicka, Karlheinz Schwarz, Christoph W. Ueberhuber: Blocking Techniques in Symmetric Eigensolvers. PPSC 1999 | |
| 1998 | ||
| c1 | Wilfried N. Gansterer, Dieter F. Kvasnicka, Christoph W. Ueberhuber: Multi-sweep Algorithms for the Symmetric Eigenproblem. VECPAR 1998: 20-28 | |
Colors in the list of coauthors
Last update Tue May 21 14:40:33 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page