der Universität des Saarlandes von (2008)
Andreas Crauser, Professor Dr, Kurt Mehlhorn, Mpi Für Informatik, Deutsche Kurzzusammenfassung
Die zu verarbeitenden Datenmengen sind in den letzten Jahren dramatisch gestiegen, so daß Externspeicher (in Form von Festplatten) eingesetzt wird, um die Datenmengen zu speichern. Algorithmen und...
q-gram Based Database Searching Using a Suffix Array (QUASAR) (2007)
Stefan Burkhardt, Andreas Crauser, Paolo Ferragina, Hans-peter Lenhof, Eric Rivals, Martin Vingron
With the increasing amount of DNA sequence information deposited in public databases, searching for similarity to a query sequence has become a basic operation in molecular biology. But even...
LEDA-SM: External Memory Algorithms and Data Structures in theory and practice (2004)
Data to be processed has dramatically increased during the last years. Nowadays,external memory (mostly hard disks) has to be used to store this massive data. Algorithms and data structures that work...
A theoretical and experimental study on the construction of suffix arrays in external memory (2002)
Crauser,Andreas, Ferragina,Paolo
The construction of full-text indexes on very large text collections is nowadays a hot problem. The suffix array [Manber-Myers,~1993] is one of the most attractive full-text indexing data structures...
A theoretical and experimental study on the construction of suffix arrays in external memory (2002)
Crauser, Andreas, Ferragina, Paolo
The construction of full-text indexes on very large text collections is nowadays a hot problem. The suffix array [Manber-Myers,~1993] is one of the most attractive full-text indexing data structures...
LEDA-SM: External Memory Algorithms and Data Structures in theory and practice (2001)
Data to be processed has dramatically increased during the last years. Nowadays, external memory (mostly hard disks) has to be used to store this massive data. Algorithms and data structures that...
LEDA-SM: external memory algorithms and data structure in theory and practice / (2001)
Saarbrücken, University, Diss., 2000.
An Experimental Study of Priority Queues in External Memory (1999)
Klaus Brengel, Andreas Crauser, Paolo Ferragina, Ulrich Meyer
this paper we show that this hierarchical approach offers some advantages over the tree-based data structures which make it appealing also in practice.
LEDA-SM - A Platform for Secondary Memory Computation (1999)
Andreas Crauser, Kurt Mehlhorn
Contents 1 Introduction 3 1.1 License Terms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.2 Overview . . . . . . . . . . . . . . . . . . . . . . . . . . ....
LEDA-SM : Extending LEDA to Secondary Memory (1999)
Crauser, Andreas, Mehlhorn, Kurt, Vitter, Jeffrey S., Zaroliagis, Christos D.
During the last years, many software libraries for \emph{in-core} computation have been developed. Most internal memory algorithms perform very badly when used in an \emph{external memory} setting....
I/O-optimal computation of segment intersections (1999)
Crauser, Andreas, Ferragina, Paolo, Mehlhorn, Kurt, Meyer, Ulrich, Ramos, Edgar A., Abello, James M., ...
A Parallelization of Dijkstra's Shortest Path Algorithm (1998)
Crauser, Andreas, Mehlhorn, Kurt, Meyer, Ulrich, Sanders, Peter, Brim, Lubos, Gruska, Jozef, ...
The single source shortest path (SSSP) problem lacks parallel solutions which are fast and simultaneously work-efficient. We propose simple criteria which divide Dijkstra's sequential SSSP algorithm...
Randomized External-Memory Algorithms for some Geometric Problems (1998)
Crauser, Andreas, Ferragina, Paolo, Mehlhorn, Kurt, Meyer, Ulrich, Ramos, Edgar A.
Efficient priority queues in external memory. working paper (1997)
Andreas Crauser, Paolo Ferragina, Ulli Meyer
Priority Queues are widely used in many fields of computer science, i.e. in Dijkstra's algorithm, for time forward processing, job scheduling, event simulation and others. In internal memory...
Kürzeste-Wege-Berechnung bei sehr großen Datenmengen (1997)
Crauser, Andreas, Mehlhorn, Kurt, Meyer, Ulrich, Spaniol, Otto
In diesem Report untersuchen wir die Ein/Ausgabe-Komplexität (I/O Komplexität) des Kürzesten-Wege-Problems mit einem Startknoten (single source shortest path) auf Graphen mit nicht-negativen...