Researcher Portfolio

 
   

Dr. Crauser, Andreas

Algorithms and Complexity, MPI for Informatics, Max Planck Society  

 

Researcher Profile

 
Position: Algorithms and Complexity, MPI for Informatics, Max Planck Society
Researcher ID: https://pure.mpg.de/cone/persons/resource/persons44266

External references

 

Publications

 
 
 : Crauser, A., & Ferragina, P. (2002). A theoretical and experimental study on the construction of suffix arrays in external memory. Algorithmica, 32, 1-35. [PubMan] : Crauser, A., Meyer, U., & Brengel, K. (2001). An experimental study of priority queues in external memory. New York, USA: ACM. [PubMan] : Crauser, A., Ferragina, P., Mehlhorn, K., Meyer, U., & Ramos, E. A. (2001). Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems. International Journal of Computational Geometry & Applications, 11, 305-337. [PubMan] : Crauser, A. (2001). LEDA-SM: External Memory Algorithms and Data Structures in Theory and Practice. PhD Thesis, Universität des Saarlandes, Saarbrücken. [PubMan] : Crauser, A., & Ferragina, P. (1999). On Constructing Suffix Arrays in External Memory. In J. Nesetril (Ed.), Proceedings of the 7th Annual European Symposium on Algorithms (ESA-99) (pp. 224-235). Berlin: Springer. [PubMan] : Burkhardt, S., Crauser, A., Ferragina, P., Lenhof, H.-P., Rivals, E., & Vingron, M. (1999). q-gram Based Database Searching Using a Suffix Array (QUASAR). In S. Istrail, P. Pevzner, & M. Waterman (Eds.), Proceedings of the 3rd Annual International Conference on Computational Molecular Biology (RECOMB-99) (pp. 77-83). New York, USA: ACM. [PubMan] : Brengel, K., Crauser, A., Meyer, U., & Ferragina, P. (1999). An Experimental Study of Priority Queues in External Memory. In J. S. Vitter, & C. D. Zaroliagis (Eds.), Algorithm engineering (WAE-99): 3rd International Workshop, WAE'99 (pp. 345-359). Berlin: Springer. [PubMan] : Crauser, A., & Ferragina, P.(1999). A theoretical and experimental study on the construction of suffix arrays in external memory (MPI-I-1999-1-001). Saarbrücken: Max-Planck-Institut für Informatik. [PubMan] : Crauser, A., Ferragina, P., Mehlhorn, K., Meyer, U., & Ramos, E. A. (1999). I/O-optimal computation of segment intersections. In Proceedings of the DIMACS Workshop on External Algorithms and Visualization (pp. 131-138). Providence, USA: AMS. [PubMan] : Crauser, A., & Mehlhorn, K. (1999). LEDA-SM: Extending LEDA to Secondary Memory. In Algorithm engineering (WAE-99): 3rd International Workshop, WAE'99 (pp. 228-242). Berlin, Germany: Springer. [PubMan] : Crauser, A., Ferragina, P., Mehlhorn, K., Meyer, U., & Ramos, E. A.(1998). Randomized external-memory algorithms for some geometric problems (MPI-I-1998-1-017). Saarbrücken: Max-Planck-Institut für Informatik. [PubMan] : Crauser, A., Mehlhorn, K., Meyer, U., & Sanders, P. (1998). A Parallelization of Dijkstra's Shortest Path Algorithm. In L. Brim, J. Gruska, & J. Zlatuška (Eds.), Mathematical Foundations of Computer Science 1998 (pp. 722-731). Berlin, Germany: Springer. doi:10.1007/BFb0055823. [PubMan] : Crauser, A., Ferragina, P., Mehlhorn, K., Meyer, U., & Ramos, E. A. (1998). Randomized External-Memory Algorithms for some Geometric Problems. In Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (pp. 259-268). New York, USA: ACM. [PubMan] : Crauser, A., Mehlhorn, K., Althaus, E., Brengel, K., Buchheit, T., Keller, J., Krone, H., Lambert, O., Schulte, R., Thiel, S., Westphal, M., & Wirth, R.(1998). On the performance of LEDA-SM (MPI-I-1998-1-028). Saarbrücken: Max-Planck-Institut für Informatik. [PubMan] : Burkhardt, S., Crauser, A., Ferragina, P., Lenhof, H.-P., Rivals, E., & Vingron, M.(1998). $q$-gram based database searching using a suffix array (QUASAR) (MPI-I-1998-1-024). Saarbrücken: Max-Planck-Institut für Informatik. [PubMan] : Crauser, A., Mehlhorn, K., & Meyer, U. (1997). Kürzeste-Wege-Berechnung bei sehr großen Datenmengen. In O. Spaniol (Ed.), Promotion tut not: Innovationsmotor "Graduiertenkolleg" (pp. 113-132). Aachen, Germany: Verlag Günter Mainz. [PubMan]