Technical Reports 1996

  • Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel:
    An Efficient Competitive Strategy for Learning a Polygon (B 96-01)
  • Regina Klimmek, Frank Wagner:
    A Simple Hypergraph Min Cut Algorithm (B 96-02)
  • Helmut Alt, Ulrich Fuchs, Günter Rote, Gerald Weber:
    Matching Convex Shapes With Respect to the Symmetric Difference (B 96-03)
  • Raúl Rojas:
    Die Rechenmaschinen von Konrad Zuse - Sechzig Jahre Computergeschichte (B 96-04)
  • Christian E. G. Maurer:
    List Objects and Recursive Algorithms in Elementary Topoi (B 96-05)
  • David A. Grable, Alessandro Panconesi:
    Nearly optimal distributed edge colouring in $O(\log \log n)$ rounds (B 96-06)
  • Matthias Horn:
    Improved Integration of Multithreading into the STGM (B 96-07)
  • Viggo Kann, Jens Lagergren, Alessandro Panconesi:
    Approximate Max $k$-Cut with Subgraph Guarantee (B 96-08)
  • Christian Mauerer:
    Didaktische Überlegungen zur Unlösbarkeit des Halteproblems und seinen Bezug zur Rusellschen Antinomie (B 96-09)
  • Boris Bokowski:
    Interaction Protocols: Typing of Object Interactions in Frameworks (B 96-10)
  • Helmut Alt, Leonidas J. Guibas:
    Discrete Geometric Shapes: Matching, Interpolation, and Approximation - A Survey (B 96-11)