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 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987)

• Matrix multiplication via arithmetic progressions
  D. Coppersmith, S. Winograd
  Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987), 1987, pp. 1-6
• Solving minimum-cost flow problems by successive approximations
  A. Goldberg, R. Tarjan
  Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987), 1987, pp. 7-18
• A new approach to all pairs shortest paths in planar graphs
  G.N. Frederickson
  Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987), 1987, pp. 19-28
• An algorithm for linear programming which requires O(((m+n)n^2 + (m+n)^{1.5}n)L) arithmetic operations
  P.M. Vaidya
  Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987), 1987, pp. 29-38
• A linear time algorithm for computing the Voronoi diagram of a convex polygon
  A. Aggarwal, L. Guibas, J. Saxe, P. Shor
  Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987), 1987, pp. 39-45
• Testing for cycles in infinite graphs with periodic structure
  K. Iwano, K. Steiglitz
  Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987), 1987, pp. 46-55
• Approximation algorithms for shortest path motion planning
  K. Clarkson
  Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987), 1987, pp. 56-65
• The complexity of cutting convex polytopes
  B. Chazelle, H. Edelsbrunner, L. Guibas
  Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987), 1987, pp. 66-76
• Algebraic methods in the theory of lower bounds for boolean circuit complexity
  R. Smolensky
  Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987), 1987, pp. 77-82
• Optimal bounds for decision problems on the CRCW PRAM
  P. Beame, J. Håstad
  Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987), 1987, pp. 83-93
• Two tapes are better than one for off-line Turing machines
  W. Maass, G. Schnitger, E. Szemerédi
  Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987), 1987, pp. 94-100
• Finite monoids and the fine structure of NC^1
  D. Barrington, D. Thérien
  Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987), 1987, pp. 101-109
• The strong exponential hierarchy collapses
  L.A. Hemachandra
  Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987), 1987, pp. 110-122
• The boolean formula value problem is in ALOGTIME
  S.R. Buss
  Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987), 1987, pp. 123-131
• Deterministic simulation in LOGSPACE
  M. Ajtai, J. Komlós, E. Szemerédi
  Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987), 1987, pp. 132-140
• Properties that characterize LOGCFL
  H. Venkateswaran
  Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987), 1987, pp. 141-150
• Some consequences of the existence of pseudorandom generators
  E. Allender
  Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987), 1987, pp. 151-159
• Efficiency considerations in using semi-random sources
  U. Vazirani
  Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987), 1987, pp. 160-168
• Imperfect random sources and discrete controlled processes
  D. Lichtenstein, N. Linial, M. Saks
  Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987), 1987, pp. 169-177
• The power of randomness for communication complexity
  Martin Fürer
  Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987), 1987, pp. 178-181
• Towards a theory of software protection and simulation by oblivious RAMs
  O. Goldreich
  Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987), 1987, pp. 182-194
• On hiding information from an oracle
  M. Abadi, J. Feigenbaum, J. Kilian
  Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987), 1987, pp. 195-203
• The complexity of perfect zero-knowledge
  L. Fortnow
  Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987), 1987, pp. 204-209
• Zero knowledge proofs of identity
  U. Feige, A. Fiat, A. Shamir
  Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987), 1987, pp. 210-217
• How to play ANY mental game
  O. Goldreich, S. Micali, A. Wigderson
  Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987), 1987, pp. 218-229