|
University home page of Roman Dementiev
|
|
Dr. Roman Dementiev
Email:
dementiev 
I have left academia, thus this university home page is not up-to-date
|
|
|
|
|
|
|
|
|
|
|
|
|
|
·
STXXL :
A high-performance generic algorithm
library for external computations:
[home page]
|
|
·
SB-PRAM project
[home page]
|
|
|
|
·
"Algorithm Engineering for Large Data Sets", Saarland University, 2006
[as a book]
|
|
|
|
|
R. Dementiev, L. Kettner, P. Sanders:
STXXL: standard template library for XXL data sets,
Software: Practice and Experience (August 2007, DOI: 10.1002/spe.844):
[link]
[preprint]
|
|
|
R. Dementiev, J. Kärkkäinen, J. Mehnert, P.
Sanders:
Better External Memory Suffix Array Construction,
ACM Journal of Experimental Algorithmics:
[to appear]
[input instances]
|
|
|
D. Ajwani, R. Dementiev, U. Meyer:
A Computational Study of External-Memory BFS Algorithms.
SODA2006: ACM-SIAM Symposium on Discrete Algorithms (January 2006, Miami, Florida ) [pdf]
|
|
|
R. Dementiev, L. Kettner, P. Sanders:
Stxxl: Standard Template Library for XXL Data Sets.
ESA2005: 13th Annual European Symposium on Algorithms (October 2005, Palma de Mallorca, Spain) [pdf] (see also the extended version)
|
|
|
R. Dementiev, L. Kettner, P. Sanders:
Stxxl: Standard Template Library for XXL Data Sets.
Technical Report 2005/18, Fakultät für Informatik, University of Karlsruhe
[ps][pdf] [html]
|
|
|
R. Dementiev, J. Kärkkäinen, J. Mehnert, P.
Sanders:
Better External Memory Suffix Array Construction
ALENEX05: Algorithm Engineering and Experiments
(January 2005,
Vancouver
, Canada):
[pdf]
[input instances]
|
|
|
R. Dementiev, P. Sanders, D. Schultes, and J. Sibeyn:
Engineering an External Memory
Minimum Spanning Tree Algorithm.
IFIP TSC04: 3rd IFIP International Conference on
Theoretical Computer Science
(August 24-26, 2004, Toulouse):
[ps]
[pdf]
|
|
|
R. Dementiev, L. Kettner, J. Mehnert and P. Sanders:
Engineering a Sorted List Data Structure for 32 Bit Keys.
ALENEX04: Algorithm Engineering and Experiments
(January 10, 2004, New
Orleans,LA
, USA):
[pdf]
|
|
|
R. Dementiev, P. Sanders:
Asynchronous Parallel Disk Sorting.
In 15th ACM Symposium on Parallelism in Algorithms and Architectures
(June 7-9, 2003, San Diego,
California, USA): pages 138-148
[pdf]
|
|
|
R. Dementiev, M.
Klein, W. J. Paul:
Performance of MP3D on the
SB-PRAM Prototype.
In 8th Euro-Par (August 27-30, 2002, Paderborn, Germany),
number 2400 in LNCS, pages 132-136. Springer ©, 2002.
[pdf]
|
|
|
|
|
R. Dementiev:
Algorithm Engineering for Large Data Sets.
PhD defense (December 1, 2006, Max-Planck-Institut für Informatik, Saarbrücken, Germany). Slides: [pdf]
|
|
|
R. Dementiev, J. Singler:
Software Libraries.
Dagstuhl Research Seminar on Algorithm Engineering (September 4-8, 2006, Schloss Dagstuhl, Germany). Slides: [pdf]
|
|
|
R. Dementiev:
Processing Huge Graphs with Stxxl.
CTW 2006: Cologne-Twente Workshop on Graphs and
Combinatorial Optimization (5-9 June 2006, PfalzAkademie Lambrecht). Slides: [pdf]
|
|
|
R. Dementiev:
Stxxl: Standard Template Library for XXL Data Sets.
ESA2005: 13th Annual European Symposium on Algorithms (October 2005, Palma de Mallorca, Spain). Slides: [pdf]
|
|
|
R. Dementiev: Engineering a Sorted List Data Structure for 32 Bit Keys.
ALENEX04: Algorithm Engineering and Experiments
(January 10, 2004, New
Orleans, LA , USA): . Slides:
[ppt]
|
|
|
R. Dementiev: Asynchronous
Parallel Disk Sorting,
SPAA 03:
ACM Symposium on Parallelism in Algorithms and Architectures,
7-9 June 2003, USA. Slides:
[ppt]
[pdf]
|
|
|
R. Dementiev: The SB-PRAM project,
ScalPerf 03:
Scalable Approaches to High
Performance and High Productivity Computing,
14-17 April 2003, Italy. Slides:[pdf]
|
|
|
|
|
|
|
|
|
1979
|
was born in the
Far East region
[map]
,
Russia
|
|
1996
|
graduated high-school 67, Khabarovsk, Russia
|
|
1996
|
student at Khabarovsk State
Technical University, Russia
|
|
2000
|
Master student at Saarland
University, Germany
|
|
2000 2001
|
programmer in IZfP
(Fraunhofer institute for non-destructive testing), Germany
|
|
2001
|
programmer in
Think & Solve
Beratungsgesellschaft mbH
|
|
2002
|
Diploma with distinction
(thesis: "Analysis and
Optimization of MP3D benchmark
for the SB-PRAM")
from Khabarovsk State
Technical University, Russia
|
|
2002
|
M.Sc. in CS with distinction (Grade
1.1 A) from
Saarland University, Germany
|
|
2002 2004
|
Ph.D. student at the Max-Planck-Institute
for Computer Science, Germany
(Kurt Mehlhorn's
Algorithms and Complexity group)
|
|
2004 2007
|
Research assistant at the University of Karlsruhe,
Germany (group of Prof. Sanders,
Faculty of Informatics)
|
|
2006
|
Ph.D. in Computer Science (Dr.-Ing.) from
Saarland University, Germany
|
|
For later positions view
|
|
|
|
|
|
|