Wilfried N. Gansterer
- Computer Networks and Communications top 5%
- Artificial Intelligence top 5%
- Electrical and Electronic Engineering
- Information Systems top 5%
- Computer Vision and Pattern Recognition top 10%
- Co-authors
- Andreas JanecekMajid Iqbal KhanMichael DemelGerhard F. EckerGünter HaringRobert C. WardKarin Anna HummelAndrea Hess
- Topics
- Matrix Theory and Algorithms (13 papers)Parallel Computing and Optimization Techniques (10 papers)Internet Traffic Analysis and Secure E-voting (9 papers)
- Partner nations
- AustriaUnited StatesPakistan
In The Last Decade
Wilfried N. Gansterer
61 papers receiving 795 citations
Peers
Comparison fields: 5 of 116
- Computer Networks and Communications 390
- Artificial Intelligence 237
- Electrical and Electronic Engineering 182
- Information Systems 115
- Computer Vision and Pattern Recognition 98
Countries citing papers authored by Wilfried N. Gansterer
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
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
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 1 | |
| 3 | 0 | |
| 4 | 3 | |
| 5 | 4 | |
| 6 | 54 | |
| 7 | 2 | |
| 8 | 16 | |
| 9 | 145 | |
| 10 | LIBNMF - A LIBRARY FOR NONNEGATIVE MATRIX FACTORIZATION | 10 |
| 11 | 6 | |
| 12 | 2 | |
| 13 | 1 | |
| 14 | 2 | |
| 15 | 2 | |
| 16 | 13 | |
| 17 | 6 | |
| 18 | Implications of the EU Data Retention Directive 2006/24/EC | 3 |
| 19 | 1 | |
| 20 | 16 |
About Wilfried N. Gansterer
Wilfried N. Gansterer is a scholar working on Hardware and Architecture, Computer Networks and Communications and Computational Theory and Mathematics, having authored 64 papers that have together received 830 indexed citations. Recurring topics across this 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). The work is most often cited by research in Computer Networks and Communications (390 citations), Computational Mathematics (7 citations) and Artificial Intelligence (237 citations). Wilfried N. Gansterer has collaborated with scholars based in Austria, United States and Pakistan. Frequent 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 Christian Schröder. Their work appears in journals such as The Journal of Chemical Physics, ACM Computing Surveys and SIAM Journal on Scientific Computing.
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.