Wilfried N. Gansterer

Publication Activity (10 Years)

Years Active: 1998-2024
Publications (10 Years): 28

Top Topics

Particle Filtering

Top Venues

Int. J. High Perform. Comput. Appl.

Publications

Lorenz Kummer, Samir Moustafa, Sebastian Schrittwieser, Wilfried N. Gansterer, Nils M. Kriege
Attacking Graph Neural Networks with Bit Flips: Weisfeiler and Leman Go Indifferent. KDD (2024)
Viktoria Mayer, Wilfried N. Gansterer
A New Exact State Reconstruction Strategy for Conjugate Gradient Methods with Arbitrary Preconditioners. IPDPS (Workshops) (2024)
Lorenz Kummer, Samir Moustafa, Nils M. Kriege, Wilfried N. Gansterer
Attacking Graph Neural Networks with Bit Flips: Weisfeiler and Lehman Go Indifferent. CoRR (2023)
Franka Bause, Samir Moustafa, Johannes Langguth, Wilfried N. Gansterer, Nils M. Kriege
Non-Redundant Graph Neural Networks with Improved Expressiveness. CoRR (2023)
Lorenz Kummer, Kevin Sidak, Tabea Reichmann, Wilfried N. Gansterer
Adaptive Precision Training (AdaPT): A dynamic quantized training approach for DNNs. SDM (2023)
Robert Ernstbrunner, Viktoria Mayer, Wilfried N. Gansterer
Accuracy vs. Cost in Parallel Fixed-Precision Low-Rank Approximations of Sparse Matrices. IPDPS (2022)
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, Christian Engelmann, Wilfried N. Gansterer, Luc Giraud, Dominik Göddeke, Marco Heisig, Fabienne Jézéquel, Nils Kohl, Xiaoye Sherry Li, Romain Lion, Miriam Mehl, Paul Mycek, Michael Obersteiner, Enrique S. Quintana-Ortí, Francesco Rizzi, Ulrich Rüde, Martin Schulz, Fred Fung, Robert Speck, Linda Stals, Keita Teranishi, Samuel Thibault, Dominik Thönnes, Andreas Wagner, Barbara I. Wohlmuth
Resiliency in numerical algorithm design for extreme scale simulations. Int. J. High Perform. Comput. Appl. 36 (2) (2022)
Lorenz Kummer, Kevin Sidak, Tabea Reichmann, Wilfried N. Gansterer
MARViN - Multiple Arithmetic Resolutions Vacillating in Neural Networks. CoRR (2021)
Carlos Pachajoa, Christina Pacher, Markus Levonyak, Wilfried N. Gansterer
Algorithm-Based Checkpoint-Recovery for the Conjugate Gradient Method. ICPP (2020)
Carlos Pachajoa, Christina Pacher, Markus Levonyak, Wilfried N. Gansterer
Algorithm-Based Checkpoint-Recovery for the Conjugate Gradient Method. CoRR (2020)
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, Christian Engelmann, Wilfried N. Gansterer, Luc Giraud, Dominik Göddeke, Marco Heisig, Fabienne Jézéquel, Nils Kohl, Xiaoye Sherry Li, Romain Lion, Miriam Mehl, Paul Mycek, Michael Obersteiner, Enrique S. Quintana-Ortí, Francesco Rizzi, Ulrich Rüde, Martin Schulz, Fred Fung, Robert Speck, Linda Stals, Keita Teranishi, Samuel Thibault, Dominik Thönnes, Andreas Wagner, Barbara I. Wohlmuth
Resiliency in Numerical Algorithm Design for Extreme Scale Simulations. CoRR (2020)
Carlos Pachajoa, Robert Ernstbrunner, Wilfried N. Gansterer
A Generic Strategy for Node-Failure Resilience for Certain Iterative Linear Algebra Methods. FTXS@SC (2020)
Karl E. Prikopa, Wilfried N. Gansterer
Fault-tolerant least squares solvers for wireless sensor networks based on gossiping. J. Parallel Distributed Comput. 136 (2020)
Markus Levonyak, Christina Pacher, Wilfried N. Gansterer
Scalable Resilience Against Node Failures for Communication-Hiding Preconditioned Conjugate Gradient and Conjugate Residual Methods. PPSC (2020)
Markus Levonyak, Christina Pacher, Wilfried N. Gansterer
Scalable Resilience Against Node Failures for Communication-Hiding Preconditioned Conjugate Gradient and Conjugate Residual Methods. CoRR (2019)
Carlos Pachajoa, Markus Levonyak, Wilfried N. Gansterer, Jesper Larsson Träff
How to Make the Preconditioned Conjugate Gradient Method Resilient Against Multiple Node Failures. ICPP (2019)
Marc Casas, Wilfried N. Gansterer, Elias Wimmer
Resilient gossip-inspired all-reduce algorithms for high-performance computing: Potential, limitations, and open questions. Int. J. High Perform. Comput. Appl. 33 (2) (2019)
Carlos Pachajoa, Markus Levonyak, Wilfried N. Gansterer, Jesper Larsson Träff
How to Make the Preconditioned Conjugate Gradient Method Resilient Against Multiple Node Failures. CoRR (2019)
Carlos Pachajoa, Christina Pacher, Wilfried N. Gansterer
Node-Failure-Resistant Preconditioned Conjugate Gradient Method without Replacement Nodes. FTXS@SC (2019)
Carlos Pachajoa, Markus Levonyak, Wilfried N. Gansterer
Extending and Evaluating Fault-Tolerant Preconditioned Conjugate Gradient Methods. FTXS@SC (2018)
Carlos Pachajoa, Wilfried N. Gansterer
On the Resilience of Conjugate Gradient and Multigrid Methods to Node Failures. Euro-Par Workshops (2017)
Michael Moldaschl, Karl E. Prikopa, Wilfried N. Gansterer
Fault tolerant communication-optimal 2.5D matrix multiplication. J. Parallel Distributed Comput. 104 (2017)
Andreas Janecek, Wilfried N. Gansterer
Understanding the Information Flow of ACO-Accelerated Gossip Algorithms. ICSI (1) (2016)
Ondrej Sluciak, Hana Straková, Markus Rupp, Wilfried N. Gansterer
Distributed Gram-Schmidt orthogonalization with simultaneous elements refinement. EURASIP J. Adv. Signal Process. 2016 (2016)
Andreas Janecek, Wilfried N. Gansterer
ACO-inspired Acceleration of Gossip Averaging. GECCO (2016)
Karl E. Prikopa, Wilfried N. Gansterer, Elias Wimmer
Parallel iterative refinement linear least squares solvers based on all-reduce operations. Parallel Comput. 57 (2016)
Andrea Hess, Karin Anna Hummel, Wilfried N. Gansterer, Günter Haring
Data-driven Human Mobility Modeling: A Survey and Engineering Guidance for Mobile Networking. ACM Comput. Surv. 48 (3) (2016)
Andreas Berger, Alessandro D'Alconzo, Wilfried N. Gansterer, Antonio Pescapè
Mining agile DNS traffic using graph analysis for cybercrime detection. Comput. Networks 100 (2016)
Mukhtar Azeem, Majid Iqbal Khan, Samee Ullah Khan, Wilfried N. Gansterer
Efficient scheduling of sporadic tasks for real-time wireless sensor networks. IET Wirel. Sens. Syst. 5 (1) (2015)
Michael Moldaschl, Wilfried N. Gansterer
Comparison of eigensolvers for symmetric band matrices. Sci. Comput. Program. 90 (2014)
Karl E. Prikopa, Hana Straková, Wilfried N. Gansterer
Analysis and Comparison of Truly Distributed Solvers for Linear Least Squares Problems on Wireless Sensor Networks. Euro-Par (2014)
Michael Moldaschl, Wilfried N. Gansterer, Ondrej Hlinka, Florian Meyer, Franz Hlawatsch
Distributed decorrelation in sensor networks with application to distributed particle filtering. ICASSP (2014)
Andreas Berger, Wilfried N. Gansterer
Modeling DNS agility with DNSMap. INFOCOM (2013)
Hana Straková, Gerhard Niederbrucker, Wilfried N. Gansterer
Fault Tolerance Properties of Gossip-Based Distributed Orthogonal Iteration Methods. ICCS (2013)
Wilfried N. Gansterer, Gerhard Niederbrucker, Hana Straková, Stefan Schulze Grotthoff
Scalable and fault tolerant orthogonalization based on randomized distributed data aggregation. J. Comput. Sci. 4 (6) (2013)
Majid I. Khan, Wilfried N. Gansterer, Günter Haring
Static vs. mobile sink: The influence of basic parameters on energy efficiency in wireless sensor networks. Comput. Commun. 36 (9) (2013)
Gerhard Niederbrucker, Wilfried N. Gansterer
Robust gossip-based aggregation: A practical point of view. ALENEX (2013)
Andreas Berger, Wilfried N. Gansterer
Modeling DNS agility with DNSMap. INFOCOM Workshops (2013)
Andreas Berger, Stefan Ruehrup, Wilfried N. Gansterer, Oliver Jung
Locality matters: Reducing Internet traffic graphs using location analysis. DSN (2013)
Karl E. Prikopa, Wilfried N. Gansterer
On Mixed Precision Iterative Refinement for Eigenvalue Problems. ICCS (2013)
Hana Straková, Wilfried N. Gansterer
A Distributed Eigensolver for Loosely Coupled Networks. PDP (2013)
Gerhard Niederbrucker, Hana Straková, Wilfried N. Gansterer
Improving Fault Tolerance and Accuracy of a Distributed Reduction Algorithm. SC Companion (2012)
Thang Viet Huynh, Manfred Mücke, Wilfried N. Gansterer
Evaluation of the Stretch S6 Hybrid Reconfigurable Embedded CPU Architecture for Power-Efficient Scientific Computing. ICCS (2012)
Gerhard König, Michael Moldaschl, Wilfried N. Gansterer
Computing eigenvectors of block tridiagonal matrices based on twisted block factorizations. J. Comput. Appl. Math. 236 (15) (2012)
Hana Straková, Wilfried N. Gansterer
Abstract: Gossip-Based Distributed Matrix Computations. SC Companion (2012)
Ondrej Sluciak, Hana Straková, Markus Rupp, Wilfried N. Gansterer
Distributed Gram-Schmidt orthogonalization based on dynamic consensus. ACSCC (2012)
Hana Straková, Wilfried N. Gansterer
Poster: Gossip-Based Distributed Matrix Computations. SC Companion (2012)
Thang Viet Huynh, Manfred Mücke, Wilfried N. Gansterer
Native Double Precision LINPACK Implementation on a Hybrid Reconfigurable CPU. IPDPS Workshops (2011)
Hana Straková, Wilfried N. Gansterer, Thomas Zemen
Distributed QR Factorization Based on Randomized Algorithms. PPAM (1) (2011)
Andreas Janecek, Stefan Schulze Grotthoff, Wilfried N. Gansterer
libNMF - A Library for Nonnegative Matrix Factorization. Comput. Informatics 30 (2) (2011)
Gerhard Niederbrucker, Wilfried N. Gansterer
Effcient Solution of Evolution Models for Virus Populations. ICCS (2011)
Gerhard Niederbrucker, Wilfried N. Gansterer
A fast solver for modeling the evolution of virus populations. SC (2011)
Wilfried N. Gansterer, Gerhard Niederbrucker, Hana Straková, Stefan Schulze Grotthoff
Robust distributed orthogonalization based on randomized aggregation. ScalA@SC (2011)
Bernd Lesser, Manfred Mücke, Wilfried N. Gansterer
Effects of Reduced Precision on Floating-Point SVM Classification Accuracy. ICCS (2011)
Wilfried N. Gansterer, Gerhard König
On twisted factorizations of block tridiagonal matrices. ICCS (1) (2010)
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)
Hannes Schabauer, Christoph Pacher, Andrew G. Sunderland, Wilfried N. Gansterer
Toward a parallel solver for generalized complex symmetric eigenvalue problems. ICCS (1) (2010)
Alexander K. Seewald, Wilfried N. Gansterer
On the detection and identification of botnets. Comput. Secur. 29 (1) (2010)
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)
Martin Koehler, Matthias Ruckenbauer, Ivan Janciak, Siegfried Benkner, Hans Lischka, Wilfried N. Gansterer
A grid services cloud for molecular modelling workflows. Int. J. Web Grid Serv. 6 (2) (2010)
David Pölz, Wilfried N. Gansterer
Trustnet Architecture for E-mail Communication. DEXA Workshops (2009)
Wilfried N. Gansterer, David Pölz
E-Mail Classification for Phishing Defense. ECIR (2009)
Wilfried N. Gansterer, Andreas R. Gruber, Christoph Pacher
Non-splitting Tridiagonalization of Complex Symmetric Matrices. ICCS (1) (2009)
Wilfried N. Gansterer, Hannes Schabauer, Christoph Pacher, N. Finger
Tridiagonalizing Complex Symmetric Matrices in Waveguide Simulations. ICCS (1) (2008)
Andreas Janecek, Wilfried N. Gansterer, K. Ashwin Kumar
Multi-Level Reputation-Based Greylisting. ARES (2008)
Gerald Stampfel, Wilfried N. Gansterer, Martin Ilger
Implications of the EU Data Retention Directive 2006/24/EC. Sicherheit (2008)
Wilfried N. Gansterer, Michael Ilger
Towards Self-Learning and Fully Transparent UCE Prevention. Sicherheit (2008)
Helmut Hlavacs, Wilfried N. Gansterer, Hannes Schabauer, Joachim Zottl, Martin Petraschek, Thomas Hoeher, Oliver Jung
Enhancing ZRTP by using Computational Puzzles. J. Univers. Comput. Sci. 14 (5) (2008)
Andreas Janecek, Wilfried N. Gansterer, Michael Demel, Gerhard F. Ecker
On the Relationship Between Feature Selection and Classification Accuracy. FSDM (2008)
Martin Petraschek, Thomas Hoeher, Oliver Jung, Helmut Hlavacs, Wilfried N. Gansterer
Security and Usability Aspects of Man-in-the-Middle Attacks on ZRTP. J. Univers. Comput. Sci. 14 (5) (2008)
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)
Majid I. Khan, Wilfried N. Gansterer, Günter Haring
Identifying the Boundary of a Wireless Sensor Network with a Mobile Sink. ADHOC-NOW (2008)
Joachim Zottl, Wilfried N. Gansterer, Helmut Hlavacs
A Hierarchical Two-Tier Information Management Architecture for Mobile Ad-Hoc Grid Environments. CCGRID (2007)
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)
Wilfried N. Gansterer, Andreas Janecek, Peter Lechner
A Reliable Component-Based Architecture for E-Mail Filtering. ARES (2007)
Majid I. Khan, Wilfried N. Gansterer, Günter Haring
In-Network Storage Model for Data Persistence under Congestion in Wireless Sensor Network. CISIS (2007)
Wilfried N. Gansterer, Michael Ilger
Analyzing UCE/UBE traffic. ICEC (2007)
Majid I. Khan, Wilfried N. Gansterer, Günter Haring
Congestion Avoidance and Energy Efficient Routing Protocol for Wireless Sensor Networks with a Mobile Sink. J. Networks 2 (6) (2007)
Wilfried N. Gansterer, Wolfgang Kreuzer, Hans Lischka
Data Reduction Schemes in Davidson Subspace Diagonalization for MR-CI. LSSC (2005)
Wilfried N. Gansterer, Joachim Zottl
Parallelization of Divide-and-Conquer Eigenvector Accumulation. Euro-Par (2005)
Wilfried N. Gansterer
Computing Orthogonal Decompositions of Block Tridiagonal or Banded Matrices. International Conference on Computational Science (1) (2005)
Yihua Bai, Wilfried N. Gansterer, Robert C. Ward
Block tridiagonalization of "effectively" sparse symmetric matrices. ACM Trans. Math. Softw. 30 (3) (2004)
Wilfried N. Gansterer, Yihua Bai, Robert M. Day, Robert C. Ward
Framework for approximating eigenpairs in electronic structure computations. Comput. Sci. Eng. 6 (5) (2004)
Joachim Zottl, Wilfried N. Gansterer
Message Passing vs. Virtual Shared Memory, A Performance Comparison. DAPSYS (2004)
Wilfried N. Gansterer, Robert C. Ward, Richard P. Muller, William A. Goddard III
Computing Approximate Eigenpairs of Symmetric Block Tridiagonal Matrices. SIAM J. Sci. Comput. 25 (1) (2003)
Harald J. Ehold, Wilfried N. Gansterer, Dieter F. Kvasnicka, Christoph W. Ueberhuber
Optimizing Local Performance in HPF. Parallel Comput. 28 (3) (2002)
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) (2002)
Wilfried N. Gansterer, Dieter F. Kvasnicka, Karlheinz Schwarz, Christoph W. Ueberhuber
Blocking Techniques in Symmetric Eigensolvers. PPSC (1999)
Helmut Kofler, Ernst J. Haunschmid, Wilfried N. Gansterer, Christoph W. Ueberhuber
The Locality Property in Topological Irregular Graph Hierarchies. ACPC (1999)
Harald J. Ehold, Wilfried N. Gansterer, Dieter F. Kvasnicka, Christoph W. Ueberhuber
HPF and Numerical Libraries. ACPC (1999)
Wilfried N. Gansterer, Dieter F. Kvasnicka, Christoph W. Ueberhuber
Blocking Techniques in Numerical Software. ACPC (1999)
Wilfried N. Gansterer, Dieter F. Kvasnicka, Christoph W. Ueberhuber
Multi-sweep Algorithms for the Symmetric Eigenproblem. VECPAR (1998)