38. STOC 2006:
Seattle,
WA,
USA
Jon M. Kleinberg (Ed.):
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006.
ACM 2006, ISBN 1-59593-134-1 BibTeX
Session 1A
Session 1B
Session 2A
Session 2B
Session 3
Session 4A
Session 4B
Session 5A
Session 5B
Session 6
Session 7A
- Noga Alon, Eldar Fischer, Ilan Newman, Asaf Shapira:
A combinatorial characterization of the testable graph properties: it's all about regularity.
251-260
Electronic Edition (ACM DL) BibTeX
- Christian Borgs, Jennifer T. Chayes, László Lovász, Vera T. Sós, Balázs Szegedy, Katalin Vesztergombi:
Graph limits and parameter testing.
261-270
Electronic Edition (ACM DL) BibTeX
- Ittai Abraham, Yair Bartal, Ofer Neiman:
Advances in metric embedding theory.
271-286
Electronic Edition (ACM DL) BibTeX
Session 7B
Session 8A
Session 8B
Session 9
Session 10A
Session 10B
Session 11A
Session 11B
Session 12
Session 13A
- Matthew Andrews, Lisa Zhang:
Logarithmic hardness of the directed congestion minimization problem.
517-526
Electronic Edition (ACM DL) BibTeX
- Julia Chuzhoy, Sanjeev Khanna:
Hardness of cut problems in directed graphs.
527-536
Electronic Edition (ACM DL) BibTeX
- Nikhil R. Devanur, Subhash Khot, Rishi Saket, Nisheeth K. Vishnoi:
Integrality gaps for sparsest cut and minimum linear arrangement problems.
537-546
Electronic Edition (ACM DL) BibTeX
- Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani:
On earthmover distance, metric labeling, and 0-extension.
547-556
Electronic Edition (ACM DL) BibTeX
Session 13B
Session 14A
- Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald de Wolf:
Bounded-error quantum state identification and exponential separations in communication complexity.
594-603
Electronic Edition (ACM DL) BibTeX
- Sean Hallgren, Cristopher Moore, Martin Rötteler, Alexander Russell, Pranab Sen:
Limitations of quantum coset states for graph isomorphism.
604-617
Electronic Edition (ACM DL) BibTeX
- Andris Ambainis, Robert Spalek, Ronald de Wolf:
A new quantum lower bound method, : with applications to direct product theorems and time-space tradeoffs.
618-633
Electronic Edition (ACM DL) BibTeX
- Shengyu Zhang:
New upper and lower bounds for randomized and quantum local search.
634-643
Electronic Edition (ACM DL) BibTeX
Session 14B
Session 15A
- Boaz Barak, Anup Rao, Ronen Shaltiel, Avi Wigderson:
2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction.
671-680
Electronic Edition (ACM DL) BibTeX
- David Zuckerman:
Linear degree extractors and the inapproximability of max clique and chromatic number.
681-690
Electronic Edition (ACM DL) BibTeX
- Jesse Kamp, Anup Rao, Salil P. Vadhan, David Zuckerman:
Deterministic extractors for small-space sources.
691-700
Electronic Edition (ACM DL) BibTeX
- Adi Akavia, Oded Goldreich, Shafi Goldwasser, Dana Moshkovitz:
On basing one-way functions on NP-hardness.
701-710
Electronic Edition (ACM DL) BibTeX
- Bella Dubrov, Yuval Ishai:
On the randomness complexity of efficient sampling.
711-720
Electronic Edition (ACM DL) BibTeX
Session 15B
Copyright © Sat May 16 23:43:12 2009
by Michael Ley (ley@uni-trier.de)