Proceedings of the International Workshop on Accelerating Analytics and Data Management Systems Using Modern Processor and Storage Architectures, 2017

2016

FPTree: A Hybrid SCM-DRAM Persistent and Concurrent B-Tree for Storage Class Memory.

[BibT_eX]

[DOI]

Proceedings of the 2016 International Conference on Management of Data, 2016

2015

A Simple Model to Quantify the Impact of Memory Latency and Bandwidth on Performance.

[BibT_eX]

[DOI]

Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 2015

Quantifying the Performance Impact of Memory Latency and Bandwidth for Big Data Workloads.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE International Symposium on Workload Characterization, 2015

Instant Recovery for Main Memory Databases.

[BibT_eX]

[DOI]

Proceedings of the Seventh Biennial Conference on Innovative Data Systems Research, 2015

2014

SOFORT: a hybrid SCM-DRAM storage engine for fast data recovery.

[BibT_eX]

[DOI]

Proceedings of the Tenth International Workshop on Data Management on New Hardware, 2014

2013

Vectorizing Database Column Scans with Complex Predicates.

[BibT_eX]

[DOI]

Proceedings of the International Workshop on Accelerating Data Management Systems Using Modern Processor and Storage Architectures, 2013

Memory system characterization of big data workloads.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Conference on Big Data (IEEE BigData 2013), 2013

2011

Fast Sorted-Set Intersection using SIMD Instructions.

[BibT_eX]

[DOI]

Benjamin Schlegel

Thomas Willhalm

Wolfgang Lehner

Proceedings of the International Workshop on Accelerating Data Management Systems Using Modern Processor and Storage Architectures, 2011

2009

SIMD-Scan: Ultra Fast in-Memory Table Scan using on-Chip Vector Processing Units.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2009

2008

Putting intel® threading building blocks to work.

[BibT_eX]

[DOI]

Thomas Willhalm

Nicolae Popovici

Proceedings of the 1st International Workshop on Multicore Software Engineering, 2008

2007

Speed-Up Techniques for Shortest-Path Computations.

[BibT_eX]

[DOI]

Dorothea Wagner

Thomas Willhalm

Proceedings of the STACS 2007, 2007

2006

Partitioning graphs to speedup Dijkstra's algorithm.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2006

2005

Engineering shortest paths and layout algorithms for large graphs.

[BibT_eX]

[DOI]

Thomas Willhalm

PhD thesis, 2005

Geometric travel planning.

[BibT_eX]

[DOI]

Stefan Edelkamp

Shahid Jabbar

Thomas Willhalm

IEEE Trans. Intell. Transp. Syst., 2005

Geometric containers for efficient shortest-path computation.

[BibT_eX]

[DOI]

Dorothea Wagner

Thomas Willhalm

Christos D. Zaroliagis

ACM J. Exp. Algorithmics, 2005

Combining speed-up techniques for shortest-path computations.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2005

Partitioning Graphs to Speed Up Dijkstra's Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

Drawing Graphs to Speed Up Shortest-Path Computations.

[BibT_eX]

[DOI]

Dorothea Wagner

Thomas Willhalm

Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, 2005

2004

Generating node coordinates for shortest-path computations in transportation networks.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2004

Combining Speed-Up Techniques for Shortest-Path Computations.

[BibT_eX]

[DOI]

Martin Holzer

Frank Schulz

Thomas Willhalm

Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

2003

Dynamic Shortest Paths Containers.

[BibT_eX]

[DOI]

Dorothea Wagner

Thomas Willhalm

Christos D. Zaroliagis

Proceedings of the Algorithmic MeThods and Models for Optimization of RailwayS, 2003

Accelerating Heuristic Search in Spatial Domains.

[BibT_eX]

[DOI]

Stefan Edelkamp

Shahid Jabbar

Thomas Willhalm

Proceedings of the Proceedings Workshop Planen und Konfigurieren (PuK-2003), 2003

Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs.

[BibT_eX]

[DOI]

Dorothea Wagner

Thomas Willhalm

Proceedings of the Algorithms, 2003

2002

Visualization of Bibliographic Networks with a Reshaped Landscape Metaphor.

[BibT_eX]

[DOI]

Ulrik Brandes

Thomas Willhalm

Proceedings of the 4th Joint Eurographics - IEEE TCVG Symposium on Visualization, 2002

2001

Travel Planning with Self-Made Maps.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Engineering and Experimentation, Third International Workshop, 2001

2000

Dynamic WWW Structures in 3D.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2000

Reconstructing the Topology of a CAD Model - a Discrete Approach.

[BibT_eX]

[DOI]

Karsten Weihe

Thomas Willhalm

Algorithmica, 2000

1999

Software Packages.

[BibT_eX]

[DOI]

Thomas Willhalm

Proceedings of the Drawing Graphs, 1999

Empirical Design of Geometric Algorithms.

[BibT_eX]

[DOI]

Karsten Weihe

Ulrik Brandes

Annegret Liebers

Matthias Müller-Hannemann

Dorothea Wagner

Thomas Willhalm

Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1998

Why CAD Data Repair Requires Discrete Algorithmic Techniques.

[BibT_eX]

Karsten Weihe

Thomas Willhalm

Proceedings of the Algorithm Engineering, 2nd International Workshop, 1998

Thomas Willhalm

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...