36. STOC 2004:
Chicago,
IL,
USA
László Babai (Ed.):
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004.
ACM 2004, ISBN 1-58113-852-0 BibTeX
@proceedings{DBLP:conf/stoc/2004,
editor = {L{\'a}szl{\'o} Babai},
title = {Proceedings of the 36th Annual ACM Symposium on Theory of Computing,
Chicago, IL, USA, June 13-16, 2004},
booktitle = {STOC},
publisher = {ACM},
year = {2004},
isbn = {1-58113-852-0},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Session 1A
- Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan:
Robust pcps of proximity, shorter pcps and applications to coding.
1-10
Electronic Edition (ACM DL) BibTeX
- Jonas Holmerin, Subhash Khot:
A new PCP outer verifier with applications to homogeneous linear equations and max-bisection.
11-20
Electronic Edition (ACM DL) BibTeX
- Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Joseph Naor:
Asymmetric k-center is log* n-hard to approximate.
21-27
Electronic Edition (ACM DL) BibTeX
- Julia Chuzhoy, Joseph Naor:
New hardness results for congestion minimization and machine scheduling.
28-34
Electronic Edition (ACM DL) BibTeX
- Susanne Albers, Markus Schmidt:
On the performance of greedy algorithms in packet buffering.
35-44
Electronic Edition (ACM DL) BibTeX
Session 1B
Session 2A
Session 2B
Session 4A
Session 4B
Session 5A
Session 5B
Session 7A
Session 7B
Session 8A
Session 8B
Session 10A
Session 10B
Session 11A
Session 11B
Session 14A
Session 14B
Session 15A
Session 15B
Session 17A
Session 17B
Copyright © Sat May 16 23:43:12 2009
by Michael Ley (ley@uni-trier.de)
