40. STOC 2008:
Victoria, British Columbia, Canada
Cynthia Dwork (Ed.):
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008.
ACM 2008, ISBN 978-1-60558-047-0
- Anup Rao:
Parallel repetition in projection games and a concentration bound.
- Rajsekar Manokaran, Joseph Naor, Prasad Raghavendra, Roy Schwartz:
Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling.
- Sanjeev Arora, Subhash Khot, Alexandra Kolla, David Steurer, Madhur Tulsiani, Nisheeth K. Vishnoi:
Unique games on expanding constraint graphs are easy: extended abstract.
- Prasad Raghavendra:
Optimal algorithms and inapproximability results for every CSP?
- Harald Räcke:
Optimal hierarchical decompositions for congestion minimization in networks.
Last update Wed May 22 16:42:08 2013
CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page