| 2002 |
|---|
| 9 | EE | Andreas Crauser,
Paolo Ferragina:
A Theoretical and Experimental Study on the Construction of Suffix Arrays in External Memory.
Algorithmica 32(1): 1-35 (2002) |
| 2001 |
|---|
| 8 | | Andreas Crauser,
Paolo Ferragina,
Kurt Mehlhorn,
Ulrich Meyer,
Edgar A. Ramos:
Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems.
Int. J. Comput. Geometry Appl. 11(3): 305-337 (2001) |
| 2000 |
|---|
| 7 | EE | Klaus Brengel,
Andreas Crauser,
Paolo Ferragina,
Ulrich Meyer:
An Experimental Study of Priority Queues in External Memory.
ACM Journal of Experimental Algorithmics 5: 17 (2000) |
| 1999 |
|---|
| 6 | EE | Andreas Crauser,
Kurt Mehlhorn:
LEDA-SM Extending LEDA to Secondary Memory.
Algorithm Engineering 1999: 229-243 |
| 5 | EE | Klaus Brengel,
Andreas Crauser,
Paolo Ferragina,
Ulrich Meyer:
An Experimental Study of Priority Queues in External Memory.
Algorithm Engineering 1999: 346-360 |
| 4 | EE | Andreas Crauser,
Paolo Ferragina:
On Constructing Suffix Arrays in External Memory.
ESA 1999: 224-235 |
| 3 | EE | Stefan Burkhardt,
Andreas Crauser,
Paolo Ferragina,
Hans-Peter Lenhof,
Eric Rivals,
Martin Vingron:
q-gram based database searching using a suffix array (QUASAR).
RECOMB 1999: 77-83 |
| 1998 |
|---|
| 2 | EE | Andreas Crauser,
Kurt Mehlhorn,
Ulrich Meyer,
Peter Sanders:
A Parallelization of Dijkstra's Shortest Path Algorithm.
MFCS 1998: 722-731 |
| 1 | EE | Andreas Crauser,
Paolo Ferragina,
Kurt Mehlhorn,
Ulrich Meyer,
Edgar A. Ramos:
Randomized External-Memory Algorithms for Some Geometric Problems.
Symposium on Computational Geometry 1998: 259-268 |
