MPI-INF Logo

MPI-INF D1 Publications

Search the publication database
.
Return

Your search returned the following 10 documents:

  1. Computing minimal spanning subgraphs in linear time
    Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, and Robert E. Tarjan
    SIAM Journal on Computing 24 (6): 1332-1358, 1995
  2. Dynamic Perfect Hashing: Upper and Lower Bounds
    Martin Dietzfelbinger, Anna Karlin, Kurt Mehlhorn, Friedhelm Meyer Auf Der Heide, Hans Rohnert, and Robert E. Tarjan
    SIAM Journal on Computing 23 (4): 738-761, 1994

  3. Dynamic Perfect Hashing: Upper and Lower Bounds
    Martin Dietzfelbinger, Anna Karlin, Kurt Mehlhorn, Friedhelm Meyer Auf Der Heide, Hans Rohnert, and Robert E. Tarjan
    Princeton University, Princeton, TR-310-91. Note: This technical report has been published as Dynamic Perfect Hashing: Upper and Lower Bounds. Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert and Robert E. Tarjan, Proc. 29th Annual IEEE Symp. on Foundations of Computer Science (1988), 524-531 and SIAM J. Comput. 23 (1994) 738-761.
  4. Faster algorithms for the shortest path problem
    Ravindra K. Ahuja, Kurt Mehlhorn, James B. Orlin, and Robert E. Tarjan
    Journal of the ACM 37 (2): 213-223, 1990
    [PDF: Download: p213-ahuja.pdf]
  5. Dynamic Perfect Hashing: Upper and Lower Bounds
    Martin Dietzfelbinger, Anna Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, and Robert E. Tarjan
    In: 29th Annual Symposium on Foundations of Computer Science (FOCS 1988), White Plains, New York, USA, 1988, 524-531
  6. Faster Algorithms for the Shortest Path Problem
    Ravindra K. Ahuja, Kurt Mehlhorn, James B. Orlin, and Robert E. Tarjan
    Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 88/04
  7. Faster Algorithms for the Shortest Path Problem
    Ravindra K. Ahuja, Kurt Mehlhorn, James B. Orlin, and Robert E. Tarjan
    MIT Operations Research Center, Cambridge, TR-193
  8. Sorting Jordan Sequences in Linear Time Using Level-Linked Search Trees
    Kurt Hoffmann, Kurt Mehlhorn, Pierre Rosenstiehl, and Robert E. Tarjan
    Information and Control 68 (1--3): 170-184, 1986
    [PDF: Download: JordanSorting.pdf]
  9. Sorting Jordan sequences in linear time
    Kurt Hoffmann, Kurt Mehlhorn, Pierre Rosenstiehl, and Robert E. Tarjan
    Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 84/09
  10. Sorting Jordan sequences in linear time
    Kurt Hoffmann, Kurt Mehlhorn, Pierre Rosenstiehl, and Robert E. Tarjan
    In: Computational geometry (SCG-85) : 1st symposium, Baltimore, MD, USA, 1985, 196-203