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 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994)

• Approximate graph coloring by semidefinite programming
  David Karger, Rajeev Motwani, Madhu Sudan
  Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994), 1994, pp. 2-13
• Finding separator cuts in planar graphs within twice the optimal
  Naveen Garg, Huzur Saran, Vijay V. Vazirani
  Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994), 1994, pp. 14-23
• Polynomial time randomized approximation schemes for the Tutte polynomial of dense graphs
  Noga Alon, Alan Frieze, Dominic Welsh
  Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994), 1994, pp. 24-35
• A note on the \Theta number of Lovász and the generalized Delsarte bound
  Mario Szegedy
  Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994), 1994, pp. 36-39
• An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
  Jeffrey Jackson
  Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994), 1994, pp. 42-53
• On learning discretized geometric concepts
  Nader H. Bshouty, Zhixiang Chen, Steve Homer
  Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994), 1994, pp. 54-63
• PAC learning with irrelevant attributes
  Aditi Dhagat, Lisa Hellerstein
  Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994), 1994, pp. 64-74
• The power of team exploration: Two robots can learn unlabeled directed graphs
  Michael A. Bender, Donna K. Slonim
  Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994), 1994, pp. 75-85
• Algorithmic number theory - The complexity contribution
  Leonard M. Adleman
  Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994), 1994, pp. 88-113
• On the power of quantum computation
  Daniel R. Simon
  Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994), 1994, pp. 116-123
• Algorithms for quantum computation: Discrete logarithms and factoring
  Peter W. Shor
  Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994), 1994, pp. 124-134
• The complexity of the membership problem for 2-generated commutative semigroups of rational matrices
  Jin-yi Cai, Richard J. Lipton, Yechezkel Zalcstein
  Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994), 1994, pp. 135-142
• Efficient average-case algorithms for the modular group
  Jin-Yi Cai, Wolfgang H. Fuchs, Dexter Kozen, Zicheng Liu
  Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994), 1994, pp. 143-152
• Finding the k shortest paths
  David Eppstein
  Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994), 1994, pp. 154-165
• Long tours and short superstrings
  S. Rao Kosaraju, James K. Park, Clifford Stein
  Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994), 1994, pp. 166-177
• Maximum (s,t)-flows in planar networks in O(|V|\log|V|) time
  Karsten Weihe
  Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994), 1994, pp. 178-189
• Estimating the size of the transitive closure in linear time
  Edith Cohen
  Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994), 1994, pp. 190-200
• Rapid rumor ramification: Approximating the minimum broadcast time
  R. Ravi
  Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994), 1994, pp. 202-213
• The load, capacity and availability of quorum systems
  Moni Naor, Avishai Wool
  Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994), 1994, pp. 214-225
• Fast and lean self-stabilizing asynchronous protocols
  Gene Itkis, Leonid Levin
  Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994), 1994, pp. 226-239
• Local optimization of global objectives: Competitive distributed deadlock resolution and resource allocation
  Baruch Awerbuch, Yossi Azar
  Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994), 1994, pp. 240-249
• (De)randomized construction of small sample spaces in NC
  David R. Karger, Daphne Koller
  Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994), 1994, pp. 252-263
• Computing with very weak random sources
  Aravind Srinivasan, David Zuckerman
  Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994), 1994, pp. 264-275
• Randomness-efficient oblivious sampling
  Mihir Bellare, John Rompel
  Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994), 1994, pp. 276-287
• On the robustness of functional equations
  Ronitt Rubinfeld
  Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, FOCS'94 (Santa Fe, New Mexico, November 20-22, 1994), 1994, pp. 288-299