Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Booktitle=Proceedings of the 28th Annual ACM Symposium on Theory of Computing, STOC'96 (Philadelphia, Pennsylvania, May 22-24, 1996)

• Approximating s-t minimum cuts in {\tilde{O}}(n^2) time
  András A. Benczúr, David R. Karger
  Proceedings of the 28th Annual ACM Symposium on Theory of Computing, STOC'96 (Philadelphia, Pennsylvania, May 22-24, 1996), 1996, pp. 47-55
• Deterministic {\tilde{O}}(nm) time edge-splitting in undirected graphs
  Hiroshi Nagamochi, Toshihide Ibaraki
  Proceedings of the 28th Annual ACM Symposium on Theory of Computing, STOC'96 (Philadelphia, Pennsylvania, May 22-24, 1996), 1996, pp. 64-73
• The PL hierarchy collapses
  Mitsunori Ogihara
  Proceedings of the 28th Annual ACM Symposium on Theory of Computing, STOC'96 (Philadelphia, Pennsylvania, May 22-24, 1996), 1996, pp. 84-88
• The complexity of matrix rank and feasible systems of linear equations
  Eric Allender, Robert Beals, Mitsunori Ogihara
  Proceedings of the 28th Annual ACM Symposium on Theory of Computing, STOC'96 (Philadelphia, Pennsylvania, May 22-24, 1996), 1996, pp. 161-167
• Approximability and nonapproximability results for minimizing total flow time on a single machine
  Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woeginger
  Proceedings of the 28th Annual ACM Symposium on Theory of Computing, STOC'96 (Philadelphia, Pennsylvania, May 22-24, 1996), 1996, pp. 418-426