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 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS'95 (Milwaukee, Wisconsin, October 23-25, 1995)

• Cognitive computation
  Leslie G. Valiant
  Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS'95 (Milwaukee, Wisconsin, October 23-25, 1995), 1995, pp. 2-3
• Spectral methods for matrix rigidity with applications to size-depth tradeoffs and communication complexity
  Satyanarayana V. Lokam
  Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS'95 (Milwaukee, Wisconsin, October 23-25, 1995), 1995, pp. 6-15
• Lower bounds on arithmetic circuits via partial derivatives
  Noam Nisan, Avi Wigderson
  Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS'95 (Milwaukee, Wisconsin, October 23-25, 1995), 1995, pp. 16-25
• Pseudorandom generators, measure theory, and natural proofs
  Kenneth W. Regan, D. Sivakumar, Jin-yi Cai
  Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS'95 (Milwaukee, Wisconsin, October 23-25, 1995), 1995, pp. 26-35
• Private information retrieval
  Benny Chor, Oded Goldreich, Eyal Kushilevitz, Madhu Sudan
  Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS'95 (Milwaukee, Wisconsin, October 23-25, 1995), 1995, pp. 41-50
• Disjoint paths in densely embedded graphs
  Jon Kleinberg, Éva Tardos
  Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS'95 (Milwaukee, Wisconsin, October 23-25, 1995), 1995, pp. 52-61
• Approximability of flow shop scheduling
  Leslie A. Hall
  Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS'95 (Milwaukee, Wisconsin, October 23-25, 1995), 1995, pp. 82-91
• A representation of cuts within 6/5 times the edge connectivity with applications
  András A. Benczúr
  Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS'95 (Milwaukee, Wisconsin, October 23-25, 1995), 1995, pp. 92-102
• Contention resolution with bounded delay
  Mike Paterson, Aravind Srinivasan
  Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS'95 (Milwaukee, Wisconsin, October 23-25, 1995), 1995, pp. 104-113
• Tight bounds for a distributed selection game with applications to fixed-connection machines
  C. Greg Plaxton
  Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS'95 (Milwaukee, Wisconsin, October 23-25, 1995), 1995, pp. 114-122
• Efficient parallel solution of sparse eigenvalue and eigenvector problems
  John H. Reif
  Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS'95 (Milwaukee, Wisconsin, October 23-25, 1995), 1995, pp. 123-132
• Approximating the volume of definable sets
  Pascal Koiran
  Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS'95 (Milwaukee, Wisconsin, October 23-25, 1995), 1995, pp. 134-141
• An optimal algorithm for Monte Carlo estimation
  Paul Dagum, Richard Karp, Michael Luby, Sheldon Ross
  Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS'95 (Milwaukee, Wisconsin, October 23-25, 1995), 1995, pp. 142-149
• Derandomizing semidefinite programming based approximation algorithms
  Sanjeev Mahajan, H. Ramesh
  Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS'95 (Milwaukee, Wisconsin, October 23-25, 1995), 1995, pp. 162-169
• Synthesizers and their appplication to the parallel construction of pseudo-random functions
  Moni Naor, Omer Reingold
  Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS'95 (Milwaukee, Wisconsin, October 23-25, 1995), 1995, pp. 170-181
• Splitters and near-optimal derandomization
  Moni Naor, Leonard J. Schulman, Aravind Srinivasan
  Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS'95 (Milwaukee, Wisconsin, October 23-25, 1995), 1995, pp. 182-191
• A unified analysis of paging and caching
  Eric Torng
  Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS'95 (Milwaukee, Wisconsin, October 23-25, 1995), 1995, pp. 194-203
• Application-controlled paging for a shared cache
  Rakesh D. Barve, Edward F. Grove, Jeffrey Scott Vitter
  Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS'95 (Milwaukee, Wisconsin, October 23-25, 1995), 1995, pp. 204-213
• Speed is as powerful as clairvoyance
  Bala Kalyanasundaram, Kirk Pruhs
  Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS'95 (Milwaukee, Wisconsin, October 23-25, 1995), 1995, pp. 214-221
• Perspectives on database theory
  Mihalis Yannakakis
  Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS'95 (Milwaukee, Wisconsin, October 23-25, 1995), 1995, pp. 224-246
• Algebraic decomposition of non-convex polyhedra
  Herbert Edelsbrunner
  Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS'95 (Milwaukee, Wisconsin, October 23-25, 1995), 1995, pp. 248-257
• Improved lower bound on testing membership to a polyhedron by algebraic decision trees
  Dima Grigoriev, Marek Karpinski, Nicolai Vorobjov
  Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS'95 (Milwaukee, Wisconsin, October 23-25, 1995), 1995, pp. 258-265
• Optimal algorithms for curves on surfaces
  Tamal K. Dey, Sumanta Guha
  Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS'95 (Milwaukee, Wisconsin, October 23-25, 1995), 1995, pp. 266-274
• Integral geometry of higher-dimensional polytopes and the average case in combinatorial optimization
  A.I. Barvinok
  Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS'95 (Milwaukee, Wisconsin, October 23-25, 1995), 1995, pp. 275-283
• Finding points on curves over finite fields
  Joachim von zur Gathen, Igor Shparlinski
  Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS'95 (Milwaukee, Wisconsin, October 23-25, 1995), 1995, pp. 284-292