default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRoman Dementiev
Person information
- affiliation: Karlsruhe Institute of Technology, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j6]Zhuan Liu
, Ruichen Han, Yansong Zhang, Yu Zhang, Xi Tang, Gang Deng, Tao Zhong, Roman Dementiev, Yunfei Lu, Mingjian Que:
Exploring Fine-Grained In-Memory Database Performance for Modern CPUs. IEEE Trans. Parallel Distributed Syst. 34(6): 1757-1772 (2023)- 2021
- [c14]Marvin Williams, Peter Sanders, Roman Dementiev:
Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues. ESA 2021: 81:1-81:17 - [i3]Marvin Williams, Peter Sanders, Roman Dementiev:
Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues. CoRR abs/2107.01350 (2021) - 2020
- [j5]Robert Lasch, Ismail Oukid, Roman Dementiev, Norman May, Süleyman Sirri Demirsoy, Kai-Uwe Sattler:
Faster & strong: string dictionary compression using sampling and fast vectorized decompression. VLDB J. 29(6): 1263-1285 (2020)
2010 – 2019
- 2019
- [b3]Peter Sanders, Kurt Mehlhorn, Martin Dietzfelbinger, Roman Dementiev:
Sequential and Parallel Algorithms and Data Structures - The Basic Toolbox. Springer 2019, ISBN 978-3-030-25208-3, pp. 1-434 - [j4]Tobias Maier, Peter Sanders, Roman Dementiev:
Concurrent Hash Tables: Fast and General(?)! ACM Trans. Parallel Comput. 5(4): 16:1-16:32 (2019) - [c13]Robert Lasch, Ismail Oukid, Roman Dementiev, Norman May, Süleyman Sirri Demirsoy, Kai-Uwe Sattler:
Fast & Strong: The Case of Compressed String Dictionaries on Modern CPUs. DaMoN 2019: 4:1-4:10 - 2016
- [c12]Tobias Maier, Peter Sanders, Roman Dementiev:
Concurrent hash tables: fast and general?(!). PPoPP 2016: 34:1-34:2 - [i2]Tobias Maier, Peter Sanders, Roman Dementiev:
Concurrent Hash Tables: Fast and General?(!). CoRR abs/1601.04017 (2016) - 2015
- [c11]Hamza Rihani, Peter Sanders, Roman Dementiev:
Brief Announcement: MultiQueues: Simple Relaxed Concurrent Priority Queues. SPAA 2015: 80-82 - 2014
- [c10]Tomas Karnagel, Roman Dementiev, Ravi Rajwar, Konrad Lai, Thomas Legler, Benjamin Schlegel, Wolfgang Lehner:
Improving in-memory database index performance with Intel® Transactional Synchronization Extensions. HPCA 2014: 476-487 - [i1]Hamza Rihani, Peter Sanders, Roman Dementiev:
MultiQueues: Simpler, Faster, and Better Relaxed Concurrent Priority Queues. CoRR abs/1411.1209 (2014) - 2010
- [c9]Roman Dementiev, Johannes Singler:
Libraries. Algorithm Engineering 2010: 290-324
2000 – 2009
- 2009
- [c8]Andreas Beckmann, Roman Dementiev, Johannes Singler:
Building a parallel pipelined external memory algorithm library. IPDPS 2009: 1-10 - 2008
- [j3]Roman Dementiev, Juha Kärkkäinen, Jens Mehnert, Peter Sanders:
Better external memory suffix array construction. ACM J. Exp. Algorithmics 12: 3.4:1-3.4:24 (2008) - [j2]Roman Dementiev, Lutz Kettner, Peter Sanders:
STXXL: standard template library for XXL data sets. Softw. Pract. Exp. 38(6): 589-637 (2008) - 2007
- [b2]Roman Dementiev:
Algorithm engineering for large data sets: hardware, software, algorithms. VDM Verlag Dr. Müller, Saarbrücken, Germany 2007, ISBN 978-3-8364-4741-6, pp. 1-192 - 2006
- [b1]Roman Dementiev:
Algorithm engineering for large data sets. Saarland University, 2006, pp. 1-193 - [j1]Roman Dementiev:
Processing Huge Graphs with Stxxl. Electron. Notes Discret. Math. 25: 37-38 (2006) - [c7]Deepak Ajwani, Roman Dementiev, Ulrich Meyer:
A computational study of external-memory BFS algorithms. SODA 2006: 601-610 - 2005
- [c6]Roman Dementiev, Juha Kärkkäinen, Jens Mehnert, Peter Sanders:
Better External Memory Suffix Array Construction. ALENEX/ANALCO 2005: 86-97 - [c5]Roman Dementiev, Lutz Kettner, Peter Sanders:
: Standard Template Library for XXL Data Sets. ESA 2005: 640-651 - 2004
- [c4]Roman Dementiev, Lutz Kettner, Jens Mehnert, Peter Sanders:
Engineering a Sorted List Data Structure for 32 Bit Key. ALENEX/ANALC 2004: 142-151 - [c3]Roman Dementiev, Peter Sanders, Dominik Schultes, Jop F. Sibeyn:
Engineering an External Memory Minimum Spanning Tree Algorithm. IFIP TCS 2004: 195-208 - 2003
- [c2]Roman Dementiev, Peter Sanders:
Asynchronous parallel disk sorting. SPAA 2003: 138-148 - 2002
- [c1]Roman Dementiev, Michael Klein, Wolfgang J. Paul:
Performance of MP3D on the SB-PRAM Prototype (Research Note). Euro-Par 2002: 132-136
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-07-26 18:43 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:
