Multi-sweep Algorithms for the Symmetric Eigenproblem. - Wilfried N. Gansterer; Dieter F. Kvasnicka; Christoph W. Ueberhuber (VECPAR, 1998)

HPF and Numerical Libraries. - Harald J. Ehold; Wilfried N. Gansterer; Dieter F. Kvasnicka; Christoph W. Ueberhuber (ACPC, 1999)

Blocking Techniques in Numerical Software. - Wilfried N. Gansterer; Dieter F. Kvasnicka; Christoph W. Ueberhuber (ACPC, 1999)

The Locality Property in Topological Irregular Graph Hierarchies. - Helmut Kofler; Ernst J. Haunschmid; Wilfried N. Gansterer; Christoph W. Ueberhuber (ACPC, 1999)

Blocking Techniques in Symmetric Eigensolvers. - Wilfried N. Gansterer; Dieter F. Kvasnicka; Karlheinz Schwarz; Christoph W. Ueberhuber (PP, 1999)

Optimizing Local Performance in HPF. - Harald J. Ehold; Wilfried N. Gansterer; Dieter F. Kvasnicka; Christoph W. Ueberhuber (Parallel Comput., 2002)

An extension of the divide-and-conquer method for a class of symmetric block-tridiagonal eigenproblems. - Wilfried N. Gansterer; Robert C. Ward; Richard P. Muller (ACM Trans. Math. Softw., 2002)

Computing Approximate Eigenpairs of Symmetric Block Tridiagonal Matrices. - Wilfried N. Gansterer; Robert C. Ward; Richard P. Muller; William A. Goddard III (SIAM J. Sci. Comput., 2003)

Message Passing vs. Virtual Shared Memory, A Performance Comparison. - Joachim Zottl; Wilfried N. Gansterer (DAPSYS, 2004)

Framework for approximating eigenpairs in electronic structure computations. - Wilfried N. Gansterer; Yihua Bai; Robert M. Day; Robert C. Ward (Comput. Sci. Eng., 2004)

Block tridiagonalization of "effectively" sparse symmetric matrices. - Yihua Bai; Wilfried N. Gansterer; Robert C. Ward (ACM Trans. Math. Softw., 2004)

Parallelization of Divide-and-Conquer Eigenvector Accumulation. - Wilfried N. Gansterer; Joachim Zottl (Euro-Par, 2005)

Computing Orthogonal Decompositions of Block Tridiagonal or Banded Matrices. - Wilfried N. Gansterer (International Conference on Computational Science (1), 2005)

Data Reduction Schemes in Davidson Subspace Diagonalization for MR-CI. - Wilfried N. Gansterer; Wolfgang Kreuzer; Hans Lischka (LSSC, 2005)

Analyzing UCE/UBE traffic. - Wilfried N. Gansterer; Michael Ilger (ICEC, 2007)

A Reliable Component-Based Architecture for E-Mail Filtering. - Wilfried N. Gansterer; Andreas Janecek; Peter Lechner (ARES, 2007)

A Hierarchical Two-Tier Information Management Architecture for Mobile Ad-Hoc Grid Environments. - Joachim Zottl; Wilfried N. Gansterer; Helmut Hlavacs (CCGRID, 2007)

In-Network Storage Model for Data Persistence under Congestion in Wireless Sensor Network. - Majid I. Khan; Wilfried N. Gansterer; Günter Haring (CISIS, 2007)

Nonadiabatic Ab Initio Surface-Hopping Dynamics Calculation in a Grid Environment - First Experiences. - Matthias Ruckenbauer; Ivona Brandic; Siegfried Benkner; Wilfried N. Gansterer; Osvaldo Gervasi; Mario Barbatti; Hans Lischka (ICCSA (1), 2007)

Congestion Avoidance and Energy Efficient Routing Protocol for Wireless Sensor Networks with a Mobile Sink. - Majid I. Khan; Wilfried N. Gansterer; Günter Haring (J. Networks, 2007)

Multi-Level Reputation-Based Greylisting. - Andreas Janecek; Wilfried N. Gansterer; K. Ashwin Kumar (ARES, 2008)

Identifying the Boundary of a Wireless Sensor Network with a Mobile Sink. - Majid I. Khan; Wilfried N. Gansterer; Günter Haring (ADHOC-NOW, 2008)

Tridiagonalizing Complex Symmetric Matrices in Waveguide Simulations. - Wilfried N. Gansterer; Hannes Schabauer; Christoph Pacher; N. Finger (ICCS (1), 2008)

Energy consumption vs. latency in a new boundary identification method for WSNs with a mobile sink. - Majid I. Khan; Wilfried N. Gansterer; Günter Haring (MOBIWAC, 2008)

Towards Self-Learning and Fully Transparent UCE Prevention. - Wilfried N. Gansterer; Michael Ilger (Sicherheit, 2008)

Implications of the EU Data Retention Directive 2006/24/EC. - Gerald Stampfel; Wilfried N. Gansterer; Martin Ilger (Sicherheit, 2008)

On the Relationship Between Feature Selection and Classification Accuracy. - Andreas Janecek; Wilfried N. Gansterer; Michael Demel; Gerhard F. Ecker (FSDM, 2008)

Enhancing ZRTP by using Computational Puzzles. - Helmut Hlavacs; Wilfried N. Gansterer; Hannes Schabauer; Joachim Zottl; Martin Petraschek; Thomas Hoeher; Oliver Jung (J. Univers. Comput. Sci., 2008)

Security and Usability Aspects of Man-in-the-Middle Attacks on ZRTP. - Martin Petraschek; Thomas Hoeher; Oliver Jung; Helmut Hlavacs; Wilfried N. Gansterer (J. Univers. Comput. Sci., 2008)

Trustnet Architecture for E-mail Communication. - David Pölz; Wilfried N. Gansterer (DEXA Workshops, 2009)

E-Mail Classification for Phishing Defense. - Wilfried N. Gansterer; David Pölz (ECIR, 2009)

Non-splitting Tridiagonalization of Complex Symmetric Matrices. - Wilfried N. Gansterer; Andreas R. Gruber; Christoph Pacher (ICCS (1), 2009)

Peak Performance Model for a Custom Precision Floating-Point Dot Product on FPGAs. - Manfred Mücke; Bernd Lesser; Wilfried N. Gansterer (Euro-Par Workshops, 2010)

Supporting Molecular Modeling Workflows within a Grid Services Cloud. - Martin Koehler; Matthias Ruckenbauer; Ivan Janciak; Siegfried Benkner; Hans Lischka; Wilfried N. Gansterer (ICCSA (4), 2010)

On the detection and identification of botnets. - Alexander K. Seewald; Wilfried N. Gansterer (Comput. Secur., 2010)

A grid services cloud for molecular modelling workflows. - Martin Koehler; Matthias Ruckenbauer; Ivan Janciak; Siegfried Benkner; Hans Lischka; Wilfried N. Gansterer (Int. J. Web Grid Serv., 2010)

On twisted factorizations of block tridiagonal matrices. - Wilfried N. Gansterer; Gerhard König (ICCS, 2010)

Toward a parallel solver for generalized complex symmetric eigenvalue problems. - Hannes Schabauer; Christoph Pacher; Andrew G. Sunderland; Wilfried N. Gansterer (ICCS, 2010)

Native Double Precision LINPACK Implementation on a Hybrid Reconfigurable CPU. - Thang Viet Huynh; Manfred Mücke; Wilfried N. Gansterer (IPDPS Workshops, 2011)

Distributed QR Factorization Based on Randomized Algorithms. - Hana Straková; Wilfried N. Gansterer; Thomas Zemen (PPAM (1), 2011)

Robust distributed orthogonalization based on randomized aggregation. - Wilfried N. Gansterer; Gerhard Niederbrucker; Hana Straková; Stefan Schulze Grotthoff (ScalA@SC, 2011)

A fast solver for modeling the evolution of virus populations. - Gerhard Niederbrucker; Wilfried N. Gansterer (SC, 2011)

libNMF - A Library for Nonnegative Matrix Factorization. - Andreas Janecek; Stefan Schulze Grotthoff; Wilfried N. Gansterer (Comput. Informatics, 2011)

Effects of Reduced Precision on Floating-Point SVM Classification Accuracy. - Bernd Lesser; Manfred Mücke; Wilfried N. Gansterer (ICCS, 2011)

Effcient Solution of Evolution Models for Virus Populations. - Gerhard Niederbrucker; Wilfried N. Gansterer (ICCS, 2011)

Distributed Gram-Schmidt orthogonalization based on dynamic consensus. - Ondrej Sluciak; Hana Straková; Markus Rupp; Wilfried N. Gansterer (ACSCC, 2012)

Improving Fault Tolerance and Accuracy of a Distributed Reduction Algorithm. - Gerhard Niederbrucker; Hana Straková; Wilfried N. Gansterer (SC Companion, 2012)

Abstract: Gossip-Based Distributed Matrix Computations. - Hana Straková; Wilfried N. Gansterer (SC Companion, 2012)

Poster: Gossip-Based Distributed Matrix Computations. - Hana Straková; Wilfried N. Gansterer (SC Companion, 2012)

Computing eigenvectors of block tridiagonal matrices based on twisted block factorizations. - Gerhard König; Michael Moldaschl; Wilfried N. Gansterer (J. Comput. Appl. Math., 2012)

Evaluation of the Stretch S6 Hybrid Reconfigurable Embedded CPU Architecture for Power-Efficient Scientific Computing. - Thang Viet Huynh; Manfred Mücke; Wilfried N. Gansterer (ICCS, 2012)

Robust gossip-based aggregation: A practical point of view. - Gerhard Niederbrucker; Wilfried N. Gansterer (ALENEX, 2013)

Locality matters: Reducing Internet traffic graphs using location analysis. - Andreas Berger; Stefan Ruehrup; Wilfried N. Gansterer; Oliver Jung (DSN, 2013)

On Mixed Precision Iterative Refinement for Eigenvalue Problems. - Karl E. Prikopa; Wilfried N. Gansterer (ICCS, 2013)

Fault Tolerance Properties of Gossip-Based Distributed Orthogonal Iteration Methods. - Hana Straková; Gerhard Niederbrucker; Wilfried N. Gansterer (ICCS, 2013)

Modeling DNS agility with DNSMap. - Andreas Berger; Wilfried N. Gansterer (INFOCOM Workshops, 2013)

A Distributed Eigensolver for Loosely Coupled Networks. - Hana Straková; Wilfried N. Gansterer (PDP, 2013)

Static vs. mobile sink: The influence of basic parameters on energy efficiency in wireless sensor networks. - Majid I. Khan; Wilfried N. Gansterer; Günter Haring (Comput. Commun., 2013)

Scalable and fault tolerant orthogonalization based on randomized distributed data aggregation. - Wilfried N. Gansterer; Gerhard Niederbrucker; Hana Straková; Stefan Schulze Grotthoff (J. Comput. Sci., 2013)

Analysis and Comparison of Truly Distributed Solvers for Linear Least Squares Problems on Wireless Sensor Networks. - Karl E. Prikopa; Hana Straková; Wilfried N. Gansterer (Euro-Par, 2014)

Distributed decorrelation in sensor networks with application to distributed particle filtering. - Michael Moldaschl; Wilfried N. Gansterer; Ondrej Hlinka; Florian Meyer; Franz Hlawatsch (ICASSP, 2014)

Comparison of eigensolvers for symmetric band matrices. - Michael Moldaschl; Wilfried N. Gansterer (Sci. Comput. Program., 2014)

Efficient scheduling of sporadic tasks for real-time wireless sensor networks. - Mukhtar Azeem; Majid Iqbal Khan; Samee Ullah Khan; Wilfried N. Gansterer (IET Wirel. Sens. Syst., 2015)

ACO-inspired Acceleration of Gossip Averaging. - Andreas Janecek; Wilfried N. Gansterer (GECCO, 2016)

Understanding the Information Flow of ACO-Accelerated Gossip Algorithms. - Andreas Janecek; Wilfried N. Gansterer (ICSI (1), 2016)

Mining agile DNS traffic using graph analysis for cybercrime detection. - Andreas Berger; Alessandro D'Alconzo; Wilfried N. Gansterer; Antonio Pescapè (Comput. Networks, 2016)

Data-driven Human Mobility Modeling: A Survey and Engineering Guidance for Mobile Networking. - Andrea Hess; Karin Anna Hummel; Wilfried N. Gansterer; Günter Haring (ACM Comput. Surv., 2016)

Distributed Gram-Schmidt orthogonalization with simultaneous elements refinement. - Ondrej Sluciak; Hana Straková; Markus Rupp; Wilfried N. Gansterer (EURASIP J. Adv. Signal Process., 2016)

Parallel iterative refinement linear least squares solvers based on all-reduce operations. - Karl E. Prikopa; Wilfried N. Gansterer; Elias Wimmer (Parallel Comput., 2016)

On the Resilience of Conjugate Gradient and Multigrid Methods to Node Failures. - Carlos Pachajoa; Wilfried N. Gansterer (Euro-Par Workshops, 2017)

Fault tolerant communication-optimal 2.5D matrix multiplication. - Michael Moldaschl; Karl E. Prikopa; Wilfried N. Gansterer (J. Parallel Distributed Comput., 2017)

Extending and Evaluating Fault-Tolerant Preconditioned Conjugate Gradient Methods. - Carlos Pachajoa; Markus Levonyak; Wilfried N. Gansterer (FTXS@SC, 2018)

How to Make the Preconditioned Conjugate Gradient Method Resilient Against Multiple Node Failures. - Carlos Pachajoa; Markus Levonyak; Wilfried N. Gansterer; Jesper Larsson Träff (ICPP, 2019)

Node-Failure-Resistant Preconditioned Conjugate Gradient Method without Replacement Nodes. - Carlos Pachajoa; Christina Pacher; Wilfried N. Gansterer (FTXS@SC, 2019)

Resilient gossip-inspired all-reduce algorithms for high-performance computing: Potential, limitations, and open questions. - Marc Casas; Wilfried N. Gansterer; Elias Wimmer (Int. J. High Perform. Comput. Appl., 2019)

Algorithm-Based Checkpoint-Recovery for the Conjugate Gradient Method. - Carlos Pachajoa; Christina Pacher; Markus Levonyak; Wilfried N. Gansterer (ICPP, 2020)

Scalable Resilience Against Node Failures for Communication-Hiding Preconditioned Conjugate Gradient and Conjugate Residual Methods. - Markus Levonyak; Christina Pacher; Wilfried N. Gansterer (PP, 2020)

A Generic Strategy for Node-Failure Resilience for Certain Iterative Linear Algebra Methods. - Carlos Pachajoa; Robert Ernstbrunner; Wilfried N. Gansterer (FTXS@SC, 2020)

Fault-tolerant least squares solvers for wireless sensor networks based on gossiping. - Karl E. Prikopa; Wilfried N. Gansterer (J. Parallel Distributed Comput., 2020)

MARViN - Multiple Arithmetic Resolutions Vacillating in Neural Networks. - Lorenz Kummer; Kevin Sidak; Tabea Reichmann; Wilfried N. Gansterer (CoRR, 2021)

Accuracy vs. Cost in Parallel Fixed-Precision Low-Rank Approximations of Sparse Matrices. - Robert Ernstbrunner; Viktoria Mayer; Wilfried N. Gansterer (IPDPS, 2022)

Resiliency in numerical algorithm design for extreme scale simulations. - Emmanuel Agullo; Mirco Altenbernd; Hartwig Anzt; Leonardo Bautista-Gomez; Tommaso Benacchio; Luca Bonaventura; Hans-Joachim Bungartz; Sanjay Chatterjee; Florina M. Ciorba; Nathan DeBardeleben; Daniel Drzisga; Sebastian Eibl; et al. (Int. J. High Perform. Comput. Appl., 2022)

Adaptive Precision Training (AdaPT): A dynamic quantized training approach for DNNs. - Lorenz Kummer; Kevin Sidak; Tabea Reichmann; Wilfried N. Gansterer (SDM, 2023)

Non-Redundant Graph Neural Networks with Improved Expressiveness. - Franka Bause; Samir Moustafa; Johannes Langguth; Wilfried N. Gansterer; Nils M. Kriege (CoRR, 2023)

Attacking Graph Neural Networks with Bit Flips: Weisfeiler and Lehman Go Indifferent. - Lorenz Kummer; Samir Moustafa; Nils M. Kriege; Wilfried N. Gansterer (CoRR, 2023)

A New Exact State Reconstruction Strategy for Conjugate Gradient Methods with Arbitrary Preconditioners. - Viktoria Mayer; Wilfried N. Gansterer (IPDPS (Workshops), 2024)

Attacking Graph Neural Networks with Bit Flips: Weisfeiler and Leman Go Indifferent. - Lorenz Kummer; Samir Moustafa; Sebastian Schrittwieser; Wilfried N. Gansterer; Nils M. Kriege (KDD, 2024)

On the Two Sides of Redundancy in Graph Neural Networks. - Franka Bause; Samir Moustafa; Johannes Langguth; Wilfried N. Gansterer; Nils M. Kriege (ECML/PKDD (6), 2024)

Accelerating Graph Neural Networks with a Novel Matrix Compression Format. - João Nuno Ferreira Alves; Samir Moustafa; Siegfried Benkner; Alexandre P. Francisco; Wilfried N. Gansterer; Luís M. S. Russo (CoRR, 2024)

Crossfire: An Elastic Defense Framework for Graph Neural Networks Under Bit Flip Attacks. - Lorenz Kummer; Samir Moustafa; Wilfried N. Gansterer; Nils Morten Kriege (AAAI, 2025)

On the Relationship Between Robustness and Expressivity of Graph Neural Networks. - Lorenz Kummer; Wilfried N. Gansterer; Nils Morten Kriege (AISTATS, 2025)

Accelerating Graph Neural Networks Using a Novel Computation-Friendly Matrix Compression Format. - João Nuno Ferreira Alves; Samir Moustafa; Siegfried Benkner; Alexandre P. Francisco; Wilfried N. Gansterer; Luís M. S. Russo (IPDPS, 2025)

Adaptive s-Step GMRES with Randomized and Truncated Low-Synchronization Orthogonalization. - Robert Ernstbrunner; Wilfried N. Gansterer (IPDPS, 2025)

Efficient Mixed Precision Quantization in Graph Neural Networks. - Samir Moustafa; Nils M. Kriege; Wilfried N. Gansterer (CoRR, 2025)

Weisfeiler and Leman Go Gambling: Why Expressive Lottery Tickets Win. - Lorenz Kummer; Samir Moustafa; Anatol Ehrlich; Franka Bause; Nikolaus Süss; Wilfried N. Gansterer; Nils M. Kriege (CoRR, 2025)