default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Willhalm
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Minseon Ahn, Thomas Willhalm, Norman May, Donghun Lee, Suprasad Mutalik Desai, Daniel Booss, Jungmin Kim, Navneet Singh, Daniel Ritter, Oliver Rebholz:
An Examination of CXL Memory Use Cases for In-Memory Database Management Systems using SAP HANA. Proc. VLDB Endow. 17(12): 3827-3840 (2024)- 2023
- [c27]Donghun Lee
, Thomas Willhalm, Minseon Ahn, Suprasad Mutalik Desai, Daniel Booss, Navneet Singh, Daniel Ritter, Jungmin Kim, Oliver Rebholz:
Elastic Use of Far Memory for In-Memory Database Management Systems. DaMoN 2023: 35-43 - [c26]Andreas Geyer, Johannes Pietrzyk, Alexander Krause, Dirk Habich, Wolfgang Lehner, Christian Färber, Thomas Willhalm:
Near to Far: An Evaluation of Disaggregated Memory for In-Memory Data Processing. DIMES@SOSP 2023: 16-22 - [c25]Yehonatan Fridman, Suprasad Mutalik Desai, Navneet Singh, Thomas Willhalm, Gal Oren:
CXL Memory as Persistent Memory for Disaggregated HPC: A Practical Approach. SC Workshops 2023: 983-994 - [i1]Yehonatan Fridman, Suprasad Mutalik Desai, Navneet Singh, Thomas Willhalm, Gal Oren:
CXL Memory as Persistent Memory for Disaggregated HPC: A Practical Approach. CoRR abs/2308.10714 (2023) - 2020
- [j13]Mikhail Zarubin, Thomas Kissinger, Dirk Habich, Thomas Willhalm, Wolfgang Lehner:
Efficient compute node-local replication mechanisms for NVRAM-centric data structures. VLDB J. 29(2-3): 775-795 (2020)
2010 – 2019
- 2019
- [j12]Lucas Lersch, Xiangpeng Hao, Ismail Oukid, Tianzheng Wang, Thomas Willhalm:
Evaluating Persistent Memory Range Indexes. Proc. VLDB Endow. 13(4): 574-587 (2019) - [c24]Mikhail Zarubin, Patrick Damme, Thomas Kissinger, Dirk Habich, Wolfgang Lehner, Thomas Willhalm:
Integer Compression in NVRAM-centric Data Stores: Comparative Experimental Analysis to DRAM. DaMoN 2019: 11:1-11:11 - 2017
- [j11]Ismail Oukid, Robert Kettler, Thomas Willhalm:
Storage class memory and databases: Opportunities and challenges. it Inf. Technol. 59(3): 109 (2017) - [j10]Ismail Oukid, Daniel Booss, Adrien Lespinasse, Wolfgang Lehner, Thomas Willhalm, Grégoire Gomes:
Memory Management Techniques for Large-Scale Persistent-Main-Memory Systems. Proc. VLDB Endow. 10(11): 1166-1177 (2017) - [j9]Mihnea Andrei, Christian Lemke, Günter Radestock, Robert Schulze, Carsten Thiel, Rolando Blanco, Akanksha Meghlan, Muhammad Sharique, Sebastian Seifert, Surendra Vishnoi, Daniel Booss, Thomas Peh, Ivan Schreter, Werner Thesing, Mehul Wagle, Thomas Willhalm:
SAP HANA Adoption of Non-Volatile Memory. Proc. VLDB Endow. 10(12): 1754-1765 (2017) - [c23]Ismail Oukid, Anisoara Nica, Daniel Dos Santos Bossle, Wolfgang Lehner, Peter Bumbulis, Thomas Willhalm:
Adaptive Recovery for SCM-Enabled Databases. ADMS@VLDB 2017: 42-49 - 2016
- [c22]Ismail Oukid, Johan Lasperas, Anisoara Nica, Thomas Willhalm, Wolfgang Lehner:
FPTree: A Hybrid SCM-DRAM Persistent and Concurrent B-Tree for Storage Class Memory. SIGMOD Conference 2016: 371-386 - 2015
- [c21]Ismail Oukid, Wolfgang Lehner, Thomas Kissinger, Thomas Willhalm, Peter Bumbulis:
Instant Recovery for Main Memory Databases. CIDR 2015 - [c20]Russell M. Clapp, Martin Dimitrov, Karthik Kumar, Vish Viswanathan, Thomas Willhalm:
Quantifying the Performance Impact of Memory Latency and Bandwidth for Big Data Workloads. IISWC 2015: 213-224 - [c19]Russell M. Clapp, Martin Dimitrov, Karthik Kumar, Vish Viswanathan, Thomas Willhalm:
A Simple Model to Quantify the Impact of Memory Latency and Bandwidth on Performance. SIGMETRICS 2015: 471-472 - 2014
- [c18]Ismail Oukid, Daniel Booss, Wolfgang Lehner, Peter Bumbulis, Thomas Willhalm:
SOFORT: a hybrid SCM-DRAM storage engine for fast data recovery. DaMoN 2014: 8:1-8:7 - 2013
- [c17]Martin Dimitrov, Karthik Kumar, Patrick Lu, Vish Viswanathan, Thomas Willhalm:
Memory system characterization of big data workloads. IEEE BigData 2013: 15-22 - [c16]Thomas Willhalm, Ismail Oukid, Ingo Müller, Franz Faerber:
Vectorizing Database Column Scans with Complex Predicates. ADMS@VLDB 2013: 1-12 - 2011
- [c15]Benjamin Schlegel, Thomas Willhalm, Wolfgang Lehner:
Fast Sorted-Set Intersection using SIMD Instructions. ADMS@VLDB 2011: 1-8
2000 – 2009
- 2009
- [j8]Thomas Willhalm, Nicolae Popovici, Yazan Boshmaf, Hasso Plattner, Alexander Zeier, Jan Schaffner:
SIMD-Scan: Ultra Fast in-Memory Table Scan using on-Chip Vector Processing Units. Proc. VLDB Endow. 2(1): 385-394 (2009) - 2008
- [c14]Thomas Willhalm, Nicolae Popovici:
Putting intel® threading building blocks to work. IWMSE@ICSE 2008: 3-4 - 2007
- [c13]Dorothea Wagner, Thomas Willhalm:
Speed-Up Techniques for Shortest-Path Computations. STACS 2007: 23-36 - 2006
- [j7]Rolf H. Möhring, Heiko Schilling, Birk Schütz, Dorothea Wagner, Thomas Willhalm:
Partitioning graphs to speedup Dijkstra's algorithm. ACM J. Exp. Algorithmics 11 (2006) - 2005
- [b1]Thomas Willhalm:
Engineering shortest paths and layout algorithms for large graphs. Karlsruhe Institute of Technology, Germany, 2005, pp. 1-130 - [j6]Martin Holzer, Frank Schulz, Dorothea Wagner, Thomas Willhalm:
Combining speed-up techniques for shortest-path computations. ACM J. Exp. Algorithmics 10 (2005) - [j5]Dorothea Wagner, Thomas Willhalm, Christos D. Zaroliagis:
Geometric containers for efficient shortest-path computation. ACM J. Exp. Algorithmics 10 (2005) - [j4]Stefan Edelkamp, Shahid Jabbar, Thomas Willhalm:
Geometric travel planning. IEEE Trans. Intell. Transp. Syst. 6(1): 5-16 (2005) - [c12]Dorothea Wagner, Thomas Willhalm:
Drawing Graphs to Speed Up Shortest-Path Computations. ALENEX/ANALCO 2005: 17-25 - [c11]Rolf H. Möhring, Heiko Schilling, Birk Schütz, Dorothea Wagner, Thomas Willhalm:
Partitioning Graphs to Speed Up Dijkstra's Algorithm. WEA 2005: 189-202 - 2004
- [j3]Ulrik Brandes, Frank Schulz, Dorothea Wagner, Thomas Willhalm:
Generating node coordinates for shortest-path computations in transportation networks. ACM J. Exp. Algorithmics 9 (2004) - [c10]Martin Holzer, Frank Schulz, Thomas Willhalm:
Combining Speed-Up Techniques for Shortest-Path Computations. WEA 2004: 269-284 - 2003
- [c9]Dorothea Wagner, Thomas Willhalm:
Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs. ESA 2003: 776-787 - [c8]Stefan Edelkamp, Shahid Jabbar, Thomas Willhalm:
Accelerating Heuristic Search in Spatial Domains. PuK 2003 - [c7]Dorothea Wagner, Thomas Willhalm, Christos D. Zaroliagis:
Dynamic Shortest Paths Containers. ATMOS 2003: 65-84 - 2002
- [c6]Ulrik Brandes, Thomas Willhalm:
Visualization of Bibliographic Networks with a Reshaped Landscape Metaphor. VisSym 2002: 159-164 - 2001
- [c5]Ulrik Brandes, Frank Schulz, Dorothea Wagner, Thomas Willhalm:
Travel Planning with Self-Made Maps. ALENEX 2001: 132-144 - 2000
- [j2]Karsten Weihe, Thomas Willhalm:
Reconstructing the Topology of a CAD Model - a Discrete Approach. Algorithmica 26(1): 126-147 (2000) - [j1]Ulrik Brandes, Vanessa Kääb, Andres Löh, Dorothea Wagner, Thomas Willhalm:
Dynamic WWW Structures in 3D. J. Graph Algorithms Appl. 4(3): 183-191 (2000)
1990 – 1999
- 1999
- [c4]Karsten Weihe, Ulrik Brandes, Annegret Liebers, Matthias Müller-Hannemann, Dorothea Wagner, Thomas Willhalm:
Empirical Design of Geometric Algorithms. SCG 1999: 86-94 - [c3]Thomas Willhalm:
Software Packages. Drawing Graphs 1999: 274-282 - 1998
- [c2]Karsten Weihe, Thomas Willhalm:
Why CAD Data Repair Requires Discrete Algorithmic Techniques. WAE 1998: 1-12 - 1997
- [c1]Karsten Weihe, Thomas Willhalm:
Reconstructing the Topology of a CAD Model: A Discrete Approach. ESA 1997: 500-513
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-21 02:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
