Thomas Willhalm

1.9k total citations
34 papers, 1.1k citations indexed

About

Thomas Willhalm is a scholar working on Computer Networks and Communications, Computer Vision and Pattern Recognition and Hardware and Architecture. According to data from OpenAlex, Thomas Willhalm has authored 34 papers receiving a total of 1.1k indexed citations (citations by other indexed papers that have themselves been cited), including 21 papers in Computer Networks and Communications, 12 papers in Computer Vision and Pattern Recognition and 12 papers in Hardware and Architecture. Recurrent topics in Thomas Willhalm's work include Advanced Data Storage Technologies (16 papers), Parallel Computing and Optimization Techniques (11 papers) and Data Management and Algorithms (9 papers). Thomas Willhalm is often cited by papers focused on Advanced Data Storage Technologies (16 papers), Parallel Computing and Optimization Techniques (11 papers) and Data Management and Algorithms (9 papers). Thomas Willhalm collaborates with scholars based in Germany, United States and United Kingdom. Thomas Willhalm's co-authors include Ismail Oukid, Wolfgang Lehner, Dorothea Wagner, Anisoara Nica, Alexander Zeier, Hasso Plattner, Jan Schäffner, Yazan Boshmaf, Christos Zaroliagis and Rolf H. Möhring and has published in prestigious journals such as IEEE Transactions on Intelligent Transportation Systems, Proceedings of the VLDB Endowment and Algorithmica.

In The Last Decade

Thomas Willhalm

33 papers receiving 998 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Thomas Willhalm Germany 16 799 481 285 242 175 34 1.1k
Xiaoning Ding United States 22 1.4k 1.7× 700 1.5× 600 2.1× 46 0.2× 88 0.5× 78 1.6k
Zhengwei Qi China 18 1.3k 1.6× 375 0.8× 1.2k 4.3× 219 0.9× 141 0.8× 120 1.7k
Hans Vandierendonck United Kingdom 19 817 1.0× 970 2.0× 323 1.1× 46 0.2× 169 1.0× 119 1.3k
Xuanhua Shi China 19 953 1.2× 302 0.6× 816 2.9× 88 0.4× 280 1.6× 114 1.4k
Jan‐Jan Wu Taiwan 16 770 1.0× 287 0.6× 472 1.7× 35 0.1× 91 0.5× 113 996
Yungang Bao China 18 964 1.2× 538 1.1× 465 1.6× 57 0.2× 77 0.4× 94 1.2k
P. Sweeney United Kingdom 12 438 0.5× 247 0.5× 222 0.8× 80 0.3× 377 2.2× 48 1.0k
Paul R. Wilson United States 20 1.3k 1.7× 1.2k 2.4× 338 1.2× 42 0.2× 60 0.3× 44 1.6k
Long Zheng China 16 388 0.5× 283 0.6× 233 0.8× 39 0.2× 293 1.7× 114 822

Countries citing papers authored by Thomas Willhalm

Since Specialization
Citations

This map shows the geographic impact of Thomas Willhalm'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 Thomas Willhalm with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Thomas Willhalm more than expected).

Fields of papers citing papers by Thomas Willhalm

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Thomas Willhalm. 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 Thomas Willhalm. The network helps show where Thomas Willhalm may publish in the future.

Co-authorship network of co-authors of Thomas Willhalm

This figure shows the co-authorship network connecting the top 25 collaborators of Thomas Willhalm. A scholar is included among the top collaborators of Thomas Willhalm 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 Thomas Willhalm. Thomas Willhalm 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
1.
Willhalm, Thomas, et al.. (2024). An Examination of CXL Memory Use Cases for In-Memory Database Management Systems Using SAP HANA. Proceedings of the VLDB Endowment. 17(12). 3827–3840. 5 indexed citations
2.
Willhalm, Thomas, et al.. (2023). CXL Memory as Persistent Memory for Disaggregated HPC: A Practical Approach. 983–994. 11 indexed citations
3.
Willhalm, Thomas, et al.. (2023). Elastic Use of Far Memory for In-Memory Database Management Systems. 35–43. 9 indexed citations
4.
Oukid, Ismail, et al.. (2019). Evaluating persistent memory range indexes. Proceedings of the VLDB Endowment. 13(4). 574–587. 67 indexed citations
5.
Willhalm, Thomas, et al.. (2017). SAP HANA adoption of non-volatile memory. Proceedings of the VLDB Endowment. 10(12). 1754–1765. 42 indexed citations
6.
Oukid, Ismail, et al.. (2017). Memory management techniques for large-scale persistent-main-memory systems. Proceedings of the VLDB Endowment. 10(11). 1166–1177. 49 indexed citations
7.
Clapp, Russell M., et al.. (2015). Quantifying the Performance Impact of Memory Latency and Bandwidth for Big Data Workloads. 213–224. 23 indexed citations
8.
Willhalm, Thomas, Ismail Oukid, Ingo Müller, & Franz Faerber. (2013). Vectorizing Database Column Scans with Complex Predicates. Very Large Data Bases. 1–12. 41 indexed citations
9.
Dimitrov, Martin, et al.. (2013). Memory system characterization of big data workloads. 15–22. 22 indexed citations
10.
Schlegel, Benjamin, Thomas Willhalm, & Wolfgang Lehner. (2011). Fast Sorted-Set Intersection using SIMD Instructions.. Very Large Data Bases. 1–8. 41 indexed citations
11.
Willhalm, Thomas, et al.. (2009). SIMD-scan. Proceedings of the VLDB Endowment. 2(1). 385–394. 157 indexed citations
12.
Willhalm, Thomas, et al.. (2008). Putting intel® threading building blocks to work. 3–4. 35 indexed citations
13.
Möhring, Rolf H., et al.. (2007). Partitioning graphs to speedup Dijkstra's algorithm. ACM Journal of Experimental Algorithmics. 11. 74 indexed citations
14.
Edelkamp, Stefan, et al.. (2005). Geometric Travel Planning. IEEE Transactions on Intelligent Transportation Systems. 6(1). 5–16. 23 indexed citations
15.
Wagner, Dorothea & Thomas Willhalm. (2005). Drawing Graphs to Speed Up Shortest-Path Computations.. 17–25. 8 indexed citations
16.
Wagner, Dorothea, Thomas Willhalm, & Christos Zaroliagis. (2004). Dynamic Shortest Paths Containers. Electronic Notes in Theoretical Computer Science. 92. 65–84. 5 indexed citations
17.
Edelkamp, Stefan, et al.. (2004). Geometric travel planning. 2. 964–969. 4 indexed citations
18.
Edelkamp, Stefan, et al.. (2003). Accelerating Heuristic Search in Spatial Domains..
19.
Weihe, Karsten & Thomas Willhalm. (2000). Reconstructing the Topology of a CAD Model--a Discrete Approach. Algorithmica. 26(1). 126–147. 4 indexed citations
20.
Weihe, Karsten & Thomas Willhalm. (1998). Why CAD Data Repair Requires Discrete Algorithmic Techniques.. 1–12. 2 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

Breakdown of academic impact, for papers by Xiaoning Ding Breakdown of academic impact, for papers by Zhengwei Qi Breakdown of academic impact, for papers by Hans Vandierendonck Breakdown of academic impact, for papers by Xuanhua Shi Breakdown of academic impact, for papers by Jan‐Jan Wu Breakdown of academic impact, for papers by Yungang Bao Breakdown of academic impact, for papers by P. Sweeney Breakdown of academic impact, for papers by Paul R. Wilson Breakdown of academic impact, for papers by Long Zheng
Rankless by CCL
2026