#### Filter Results:

- Full text PDF available (24)

#### Publication Year

2002

2017

- This year (3)
- Last 5 years (15)
- Last 10 years (21)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Roman Dementiev, Lutz Kettner, Peter Sanders
- Softw., Pract. Exper.
- 2008

We present the software library STXXL that is an implementation of the C++ standard template library STL for processing huge data sets that can fit only on hard disks. It supports parallel disks,â€¦ (More)

- Roman Dementiev, Juha KÃ¤rkkÃ¤inen, Jens Mehnert, Peter Sanders
- ALENEX/ANALCO
- 2005

Suffix arrays are a simple and powerful data structure for text processing that can be used for full text indexes, data compression, and many other applications, in particular, in bioinformatics.â€¦ (More)

- Roman Dementiev, Peter Sanders, Dominik Schultes, Jop F. Sibeyn
- IFIP TCS
- 2004

We develop an external memory algorithm for computing minimum spanning trees. The algorithm is considerably simpler than previously known external memory algorithms for this problem and needs aâ€¦ (More)

- Tomas Karnagel, Roman Dementiev, +4 authors Wolfgang Lehner
- 2014 IEEE 20th International Symposium on Highâ€¦
- 2014

The increasing number of cores every generation poses challenges for high-performance in-memory database systems. While these systems use sophisticated high-level algorithms to partition a query orâ€¦ (More)

- Hamza Rihani, Peter Sanders, Roman Dementiev
- SPAA
- 2015

We present a simple, concurrent data structure that approximates the behavior of a priority queue and that gives very good performance guarantees. We also discuss models for the semantics of relaxedâ€¦ (More)

- Roman Dementiev, Peter Sanders
- SPAA
- 2003

We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and that guarantees almost perfect overlap between I/O and computation. Previous algorithms have eitherâ€¦ (More)

- Deepak Ajwani, Roman Dementiev, Ulrich Meyer
- SODA
- 2006

Breadth First Search (BFS) traversal is an archetype for many important graph problems. However, computing a BFS level decomposition for massive graphs was considered nonviable so far, because of theâ€¦ (More)

- Roman Dementiev
- 2006

- Andreas Beckmann, Roman Dementiev, Johannes Singler
- 2009 IEEE International Symposium on Parallelâ€¦
- 2009

Large and fast hard disks for little money have enabled the processing of huge amounts of data on a single machine. For this purpose, the well-established STXXL library provides a framework forâ€¦ (More)

- Roman Dementiev, Lutz Kettner, Peter Sanders
- ESA
- 2005