| FPTree: A hybrid SCM-DRAM persistent and concurrent B-tree for storage class memory I Oukid, J Lasperas, A Nica, T Willhalm, W Lehner Proceedings of the 2016 International Conference on Management of Data, 371-386, 2016 | 413 | 2016 |
| SIMD-scan: ultra fast in-memory table scan using on-chip vector processing units T Willhalm, N Popovici, Y Boshmaf, H Plattner, A Zeier, J Schaffner Proceedings of the VLDB Endowment 2 (1), 385-394, 2009 | 315 | 2009 |
| Partitioning graphs to speedup Dijkstra's algorithm RH Möhring, H Schilling, B Schütz, D Wagner, T Willhalm Journal of Experimental Algorithmics (JEA) 11, 2.8-es, 2007 | 240 | 2007 |
| Geometric speed-up techniques for finding shortest paths in large sparse graphs D Wagner, T Willhalm European Symposium on Algorithms, 776-787, 2003 | 189 | 2003 |
| Speed-up techniques for shortest-path computations D Wagner, T Willhalm Annual Symposium on Theoretical Aspects of Computer Science, 23-36, 2007 | 161 | 2007 |
| Geometric containers for efficient shortest-path computation D Wagner, T Willhalm, C Zaroliagis Journal of Experimental Algorithmics (JEA) 10, 1.3-es, 2005 | 160 | 2005 |
| Evaluating persistent memory range indexes L Lersch, X Hao, I Oukid, T Wang, T Willhalm Proceedings of the VLDB Endowment 13 (4), 574-587, 2019 | 134 | 2019 |
| Partitioning graphs to speed up Dijkstra’s algorithm RH Möhring, H Schilling, B Schütz, D Wagner, T Willhalm Experimental and Efficient Algorithms: 4th International Workshop, WEA 2005 …, 2005 | 134 | 2005 |
| SOFORT: A hybrid SCM-DRAM storage engine for fast data recovery I Oukid, D Booss, W Lehner, P Bumbulis, T Willhalm Proceedings of the Tenth International Workshop on Data Management on New …, 2014 | 114 | 2014 |
| Vectorizing Database Column Scans with Complex Predicates. T Willhalm, I Oukid, I Müller, F Faerber ADMS@ VLDB, 1-12, 2013 | 114 | 2013 |
| Putting intel® threading building blocks to work T Willhalm, N Popovici Proceedings of the 1st international workshop on Multicore software …, 2008 | 97 | 2008 |
| SAP HANA adoption of non-volatile memory M Andrei, C Lemke, G Radestock, R Schulze, C Thiel, R Blanco, ... Proceedings of the VLDB Endowment 10 (12), 1754-1765, 2017 | 96 | 2017 |
| Memory management techniques for large-scale persistent-main-memory systems I Oukid, D Booss, A Lespinasse, W Lehner, T Willhalm, G Gomes Proceedings of the VLDB Endowment 10 (11), 1166-1177, 2017 | 93 | 2017 |
| Intel performance counter monitor-a better way to measure cpu utilization T Willhalm, R Dementiev, P Fay Dosegljivo: https://software. intel. com/en-us/articles/intelperformance …, 2012 | 90 | 2012 |
| Combining speed-up techniques for shortest-path computations M Holzer, F Schulz, D Wagner, T Willhalm Journal of Experimental Algorithmics (JEA) 10, 2.5-es, 2005 | 90 | 2005 |
| Fast Sorted-Set Intersection using SIMD Instructions. B Schlegel, T Willhalm, W Lehner ADMS@ VLDB 1 (8), 2011 | 83 | 2011 |
| Method and apparatus for generating data prefetches specifying various sizes to prefetch data from a remote computing node FG Bernat, K Kumar, T Willhalm, RK Ramanujan, BJ Slechta US Patent 10,389,839, 2019 | 79 | 2019 |
| Visualization of bibliographic networks with a reshaped landscape metaphor U Brandes, T Willhalm | 74 | 2002 |
| Instant Recovery for Main Memory Databases. I Oukid, W Lehner, T Kissinger, T Willhalm, P Bumbulis CIDR, 2015 | 66 | 2015 |
| Combining speed-up techniques for shortest-path computations M Holzer, F Schulz, T Willhalm Experimental and Efficient Algorithms: Third International Workshop, WEA …, 2004 | 54 | 2004 |
