Andreas Crauser

According to our database, Andreas Crauser authored at least 10 papers between 1998 and 2002.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2002

A Theoretical and Experimental Study on the Construction of Suffix Arrays in External Memory.

Andreas Crauser, Paolo Ferragina

Algorithmica, 2002

2001

LEDA-SM: external memory algorithms and data structures in theory and practice.

Andreas Crauser

PhD thesis, 2001

Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems.

Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos

Int. J. Comput. Geom. Appl., 2001

2000

An Experimental Study of Priority Queues in External Memory.

Klaus Brengel, Andreas Crauser, Paolo Ferragina, Ulrich Meyer

ACM J. Exp. Algorithmics, 2000

1999

LEDA-SM Extending LEDA to Secondary Memory.

Andreas Crauser, Kurt Mehlhorn

Proceedings of the Algorithm Engineering, 1999

<i>q</i>-gram based database searching using a suffix array (QUASAR).

Stefan Burkhardt, Andreas Crauser, Paolo Ferragina, Hans-Peter Lenhof, Eric Rivals, Martin Vingron

Proceedings of the Third Annual International Conference on Research in Computational Molecular Biology, 1999

On Constructing Suffix Arrays in External Memory.

Andreas Crauser, Paolo Ferragina

Proceedings of the Algorithms, 1999

1998

A Parallelization of Dijkstra's Shortest Path Algorithm.

Andreas Crauser, Kurt Mehlhorn, Ulrich Meyer, Peter Sanders

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

I/O-optimal computation of segment intersections.

Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos

Proceedings of the External Memory Algorithms, 1998

Randomized External-Memory Algorithms for Some Geometric Problems.

Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos

Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998