Wilfried N. Gansterer

1.4k total citations
64 papers, 830 citations indexed

About

Wilfried N. Gansterer is a scholar working on Computer Networks and Communications, Artificial Intelligence and Computational Theory and Mathematics. According to data from OpenAlex, Wilfried N. Gansterer has authored 64 papers receiving a total of 830 indexed citations (citations by other indexed papers that have themselves been cited), including 36 papers in Computer Networks and Communications, 22 papers in Artificial Intelligence and 20 papers in Computational Theory and Mathematics. Recurrent topics in Wilfried N. Gansterer's work include Matrix Theory and Algorithms (13 papers), Parallel Computing and Optimization Techniques (10 papers) and Internet Traffic Analysis and Secure E-voting (9 papers). Wilfried N. Gansterer is often cited by papers focused on Matrix Theory and Algorithms (13 papers), Parallel Computing and Optimization Techniques (10 papers) and Internet Traffic Analysis and Secure E-voting (9 papers). Wilfried N. Gansterer collaborates with scholars based in Austria, United States and Pakistan. Wilfried N. Gansterer's co-authors include Andreas Janecek, Majid Iqbal Khan, Michael Demel, Gerhard F. Ecker, Günter Haring, Robert C. Ward, Karin Anna Hummel, Andrea Hess, Andrew Berger and Richard P. Muller and has published in prestigious journals such as The Journal of Chemical Physics, ACM Computing Surveys and SIAM Journal on Scientific Computing.

In The Last Decade

Wilfried N. Gansterer

61 papers receiving 795 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Wilfried N. Gansterer Austria 14 390 237 182 115 98 64 830
Jong Youl Choi United States 13 343 0.9× 186 0.8× 127 0.7× 120 1.0× 63 0.6× 67 644
Stefanie Jegelka United States 18 115 0.3× 657 2.8× 78 0.4× 68 0.6× 488 5.0× 73 1.4k
Wangdong Yang China 12 236 0.6× 209 0.9× 86 0.5× 84 0.7× 145 1.5× 52 670
Geppino Pucci Italy 13 452 1.2× 209 0.9× 81 0.4× 111 1.0× 59 0.6× 65 850
Alexander Hall Switzerland 12 397 1.0× 178 0.8× 61 0.3× 67 0.6× 42 0.4× 27 860
Xiaolong Yang China 16 418 1.1× 288 1.2× 268 1.5× 104 0.9× 93 0.9× 112 828
Abhinav Vishnu United States 19 1.0k 2.6× 202 0.9× 275 1.5× 583 5.1× 107 1.1× 71 1.9k
Muhammad Azhar Iqbal Pakistan 19 495 1.3× 194 0.8× 92 0.5× 363 3.2× 60 0.6× 81 1.2k
Canqun Yang China 14 322 0.8× 186 0.8× 92 0.5× 143 1.2× 213 2.2× 84 904
Xiaoming Sun China 18 81 0.2× 451 1.9× 74 0.4× 54 0.5× 34 0.3× 140 1.2k

Countries citing papers authored by Wilfried N. Gansterer

Since Specialization
Citations

This map shows the geographic impact of Wilfried N. Gansterer's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Wilfried N. Gansterer with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Wilfried N. Gansterer more than expected).

Fields of papers citing papers by Wilfried N. Gansterer

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Wilfried N. Gansterer. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Wilfried N. Gansterer. The network helps show where Wilfried N. Gansterer may publish in the future.

Co-authorship network of co-authors of Wilfried N. Gansterer

This figure shows the co-authorship network connecting the top 25 collaborators of Wilfried N. Gansterer. A scholar is included among the top collaborators of Wilfried N. Gansterer based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Wilfried N. Gansterer. Wilfried N. Gansterer is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
2.
Schrittwieser, Sebastian, et al.. (2024). Attacking Graph Neural Networks with Bit Flips: Weisfeiler and Leman Go Indifferent. 1428–1439. 1 indexed citations
3.
Casas, Marc, et al.. (2018). Resilient gossip-inspired all-reduce algorithms for high-performance computing: Potential, limitations, and open questions. The International Journal of High Performance Computing Applications. 33(2). 366–383. 3 indexed citations
4.
Slučiak, Ondrej, et al.. (2016). Distributed Gram-Schmidt orthogonalization with simultaneous elements refinement. EURASIP Journal on Advances in Signal Processing. 2016(1). 25–25. 4 indexed citations
5.
Hess, Andrea, Karin Anna Hummel, Wilfried N. Gansterer, & Günter Haring. (2015). Data-driven Human Mobility Modeling. ACM Computing Surveys. 48(3). 1–39. 54 indexed citations
6.
Gansterer, Wilfried N., et al.. (2014). Comparison of eigensolvers for symmetric band matrices. Science of Computer Programming. 90(Pt A). 55–66. 2 indexed citations
7.
Gansterer, Wilfried N., et al.. (2013). Scalable and fault tolerant orthogonalization based on randomized distributed data aggregation. Journal of Computational Science. 4(6). 480–488. 16 indexed citations
8.
Berger, Andrew & Wilfried N. Gansterer. (2013). Modeling DNS agility with DNSMap. Zenodo (CERN European Organization for Nuclear Research). 387–392. 6 indexed citations
9.
Khan, Majid Iqbal, et al.. (2012). Static vs. mobile sink: The influence of basic parameters on energy efficiency in wireless sensor networks. Computer Communications. 36(9). 965–978. 145 indexed citations
10.
Janecek, Andreas, et al.. (2011). LIBNMF - A LIBRARY FOR NONNEGATIVE MATRIX FACTORIZATION. Computing and Informatics / Computers and Artificial Intelligence. 30(2). 205–224. 10 indexed citations
11.
König, Gerhard, et al.. (2011). Computing eigenvectors of block tridiagonal matrices based on twisted block factorizations. Journal of Computational and Applied Mathematics. 236(15). 3696–3703. 6 indexed citations
12.
Gansterer, Wilfried N., et al.. (2011). Effcient Solution of Evolution Models for Virus Populations. Procedia Computer Science. 4. 126–135. 2 indexed citations
13.
Gansterer, Wilfried N., et al.. (2011). Effects of Reduced Precision on Floating-Point SVM Classification Accuracy. Procedia Computer Science. 4. 508–517. 27 indexed citations
14.
Gansterer, Wilfried N. & Gerhard König. (2010). On twisted factorizations of block tridiagonal matrices. Procedia Computer Science. 1(1). 279–287. 2 indexed citations
15.
Gansterer, Wilfried N., et al.. (2008). Implications of the EU Data Retention Directive 2006/24/EC. 45–58. 3 indexed citations
16.
Gansterer, Wilfried N., et al.. (2008). Enhancing ZRTP by Using Computational Puzzles. JUCS - Journal of Universal Computer Science. 14. 693–716. 6 indexed citations
17.
Gansterer, Wilfried N., et al.. (2008). Security and Usability Aspects of Man-in-the-Middle Attacks on ZRTP. JUCS - Journal of Universal Computer Science. 14. 673–692. 13 indexed citations
18.
Gansterer, Wilfried N., et al.. (2007). A Hierarchical Two-Tier Information Management Architecture for Mobile Ad-Hoc Grid Environments. 707–712. 1 indexed citations
19.
Gansterer, Wilfried N., et al.. (2004). Framework for approximating eigenpairs in electronic structure computations. Computing in Science & Engineering. 6(5). 50–59. 1 indexed citations
20.
Gansterer, Wilfried N., Robert C. Ward, Richard P. Muller, & William A. Goddard. (2003). Computing Approximate Eigenpairs of Symmetric Block Tridiagonal Matrices. SIAM Journal on Scientific Computing. 25(1). 65–85. 16 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026