dblp.uni-trier.dewww.uni-trier.de

Andreas Crauser Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2002
9EEAndreas 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
7EEKlaus 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
6EEAndreas Crauser, Kurt Mehlhorn: LEDA-SM Extending LEDA to Secondary Memory. Algorithm Engineering 1999: 229-243
5EEKlaus Brengel, Andreas Crauser, Paolo Ferragina, Ulrich Meyer: An Experimental Study of Priority Queues in External Memory. Algorithm Engineering 1999: 346-360
4EEAndreas Crauser, Paolo Ferragina: On Constructing Suffix Arrays in External Memory. ESA 1999: 224-235
3EEStefan 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
2EEAndreas Crauser, Kurt Mehlhorn, Ulrich Meyer, Peter Sanders: A Parallelization of Dijkstra's Shortest Path Algorithm. MFCS 1998: 722-731
1EEAndreas 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

Coauthor Index

1Klaus Brengel [5] [7]
2Stefan Burkhardt [3]
3Paolo Ferragina [1] [3] [4] [5] [7] [8] [9]
4Hans-Peter Lenhof [3]
5Kurt Mehlhorn [1] [2] [6] [8]
6Ulrich Meyer [1] [2] [5] [7] [8]
7Edgar A. Ramos [1] [8]
8Eric Rivals [3]
9Peter Sanders [2]
10Martin Vingron [3]

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)