MPI-INF Logo

MPI-INF D1 Publications

Search the publication database
.
Return

Your search returned the following 9 documents:

  1. Computing H/D-exchange speeds of single residues from data of peptic fragments
    Ernst Althaus, Stefan Canzar, Mark Emmett, Andreas Karrenbauer, Alan Marshall, Anke Meyer-Bäse, and Huimin Zhang
    In: 23rd Annual ACM Symposium on Applied Computing (SAC), Fortaleza, Brazil, 2008, 1273-1277
  2. Updated Website to include Benchmark Instances for Arrangements of Quadrics and Planar Algebraic Curves
    Eric Berberich, Efi Fogel, and Andreas Meyer
    University of Groningen, Groningen, ACS-TR-243305-01, Technical Report
  3. An experimental study of priority queues in external memory
    Andreas Crauser, Ulrich Meyer, and Klaus Brengel
    ACM
  4. Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems
    Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, and Edgar A. Ramos
    International Journal of Computational Geometry & Applications 11 (3): 305-337, 2001. Note: Special issue edited by J Hershberger: Selected Papers from the Fourteenth ACM Symposium on Computational Geometry, Minneapolis, MN, June, 1998
  5. An Experimental Study of Priority Queues in External Memory
    Klaus Brengel, Andreas Crauser, Ulrich Meyer, and Paolo Ferragina
    In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, London, UK, July, 19-21, 1999, 345-359
  6. I/O-optimal computation of segment intersections
    Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, and Edgar A. Ramos
    In: Proceedings of the DIMACS Workshop on External Algorithms and Visualization, New Brunswick, New Jersey, May 20-22, 1998, 1999, 131-138
  7. Kürzeste-Wege-Berechnung bei sehr großen Datenmengen
    Andreas Crauser, Kurt Mehlhorn, and Ulrich Meyer
    In: Promotion tut not: Innovationsmotor "Graduiertenkolleg", Aachen, Germany, September, 22-23, 1997, 113-132
  8. A Parallelization of Dijkstra's Shortest Path Algorithm
    Andreas Crauser, Kurt Mehlhorn, Ulrich Meyer, and Peter Sanders
    In: Proceedings of the 23rd International Symposium on the Mathematical Foundations of Computer Science (MFCS-98), Brno, Czech Republic, August, 24 - August, 28, 1998, 722-731

  9. Randomized External-Memory Algorithms for some Geometric Problems
    Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, and Edgar A. Ramos
    In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), Minneapolis, Minnesota, June 7-10, 1998, 259-268