MPI-INF Logo

MPI-INF D1 Publications

Search the publication database
.
Return

Your search returned the following 6 documents:

  1. Randomized Data Structures for the Dynamic Closest-Pair Problem
    Mordecai J. Golin, Rajeev Raman, Christian Schwarz, and Michiel Smid
    SIAM Journal on Computing 27 (4): 1036-1072, 1998
  2. Routing on Meshes with Buses
    Michael Kaufmann, Rajeev Raman, and Jop F. Sibeyn
    Algorithmica 18 (3): 417-444, 1997
  3. Lower Bounds for Set Intersection queries
    Paul Dietz, Kurt Mehlhorn, Rajeev Raman, and Christian Uhrig
    In: Discrete algorithms (SODA-93) : 4th annual ACM-SIAM symposium, Austin, USA, 1993, 194-201
  4. Lower bounds for set intersection queries
    Paul Dietz, Kurt Mehlhorn, Rajeev Raman, and Christian Uhrig
    Algorithmica 14 (2): 154-168, 1995

  5. Simple randomized algorithms for closest pair problems
    Mordecai J. Golin, Rajeev Raman, Christian Schwarz, and Michiel Smid
    Nordic Journal of Computing 2: 3-27, 1995
  6. Sorting in Linear Time?
    Arne Andersson, Torben Hagerup, Stefan Nilsson, and Rajeev Raman
    In: 27th Annual ACM Symposium on Theory of Computing (STOC95), Las Vegas, Nevada, USA, May, 29th - June, 1st, 1995, 427-436