Randomized External-Memory Algorithms for Some Geometric Problems. - Andreas Crauser; Paolo Ferragina; Kurt Mehlhorn; Ulrich Meyer 001; Edgar A. Ramos (SCG, 1998)

I/O-optimal computation of segment intersections. - Andreas Crauser; Paolo Ferragina; Kurt Mehlhorn; Ulrich Meyer 001; Edgar A. Ramos (External Memory Algorithms, 1998)

A Parallelization of Dijkstra's Shortest Path Algorithm. - Andreas Crauser; Kurt Mehlhorn; Ulrich Meyer 001; Peter Sanders 001 (MFCS, 1998)

On Constructing Suffix Arrays in External Memory. - Andreas Crauser; Paolo Ferragina (ESA, 1999)

q-gram based database searching using a suffix array (QUASAR). - Stefan Burkhardt; Andreas Crauser; Paolo Ferragina; Hans-Peter Lenhof; Eric Rivals; Martin Vingron (RECOMB, 1999)

LEDA-SM Extending LEDA to Secondary Memory. - Andreas Crauser; Kurt Mehlhorn (WAE, 1999)

An Experimental Study of Priority Queues in External Memory. - Klaus Brengel; Andreas Crauser; Paolo Ferragina; Ulrich Meyer 001 (ACM J. Exp. Algorithmics, 2000)

Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems. - Andreas Crauser; Paolo Ferragina; Kurt Mehlhorn; Ulrich Meyer 001; Edgar A. Ramos (Int. J. Comput. Geom. Appl., 2001)

LEDA-SM: external memory algorithms and data structures in theory and practice. - Andreas Crauser (2001)

A Theoretical and Experimental Study on the Construction of Suffix Arrays in External Memory. - Andreas Crauser; Paolo Ferragina (Algorithmica, 2002)