MPI-INF Logo

MPI-INF D1 Publications

Search the publication database
.
Return

Your search returned the following 8 documents:

  1. Approximate hypergraph coloring
    Pierre Kelsen, Sanjeev Mahajan, and Hariharan Ramesh
    In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, Reykjavik, Iceland, July 3-5, 1996, 41-52
  2. Coloring 2-colorable hypergraphs with a sublinear number of colors
    Ramesh Hariharan, Pierre Kelsen, and Sanjeev Mahajan
    In: Scandinavian Workshop on Algorithm Theory (SWAT96), Reykjavik, Iceland, July, 3-5, 1996, 41-52
  3. Efficient Algorithms for Lempel-Ziv Encoding
    Leszek Gasieniec, Marek Karpinski, Wojciech Plandowski, and Wojciech Rytter
    In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, Reykjavik, Iceland, July, 3-5, 1996, 392-403
  4. Neighborhood graphs and distributed "^" + 1-coloring
    Pierre Kelsen
    In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, Reykjavik, Iceland, July 3-5, 1996, 223-233
  5. The randomized complexity of maintaining the minimum
    Gerth Stølting Brodal, Shiva Chaudhuri, and Jaikumar Radhakrishnan
    In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, Reykjavik, Iceland, July 3-5, 1996, 4-15
  6. Vertex partitioning problems on partial k-trees
    Arvind Gupta, Damon Kaller, Sanjeev Mahajan, and Thomas C. Shermer
    In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, Reykjavik, Iceland, July, 3-5, 1996, 161-172
  7. Upper and Lower Bounds for the Dictionary Problem
    Martin Dietzfelbinger, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, and H. Rohnert
    In: Algorithm theory (SWAT-88) : 1st Scandinavian workshop, Halmstad, Sweden, 1988, 214-215
  8. Maintaining Discrete Probability Distributions Optimally
    Torben Hagerup, Kurt Mehlhorn, and I. Munro
    In: Automata, languages and programming (ICALP-93) : 20th international colloquium, Lund, Sweden, 1993, 253-264