• 
  Fabio Martinelli, Alistair Sinclair:
  Mixing time for the solid-on-solid model. STOC 2009: 571-580
• 
  Claire Mathieu, Alistair Sinclair:
  Sherali-adams relaxations of the matching polytope. STOC 2009: 293-302
• 
  Ravi Montenegro, Prasad Tetali:
  How long does it take to catch a wild kangaroo? STOC 2009: 553-560
• 
  Robin A. Moser:
  A constructive proof of the Lovász local lemma. STOC 2009: 343-350
• 
  Nam H. Nguyen, Thong T. Do, Trac D. Tran:
  A fast and efficient algorithm for low-rank approximation of a matrix. STOC 2009: 215-224
• 
  Ryan O'Donnell, Yi Wu:
  Conditional hardness for satisfiable 3-CSPs. STOC 2009: 493-502
• 
  Chris Peikert:
  Public-key cryptosystems from the worst-case shortest vector problem: extended abstract. STOC 2009: 333-342
• 
  Yuval Rabani, Amir Shpilka:
  Explicit construction of a small epsilon-net for linear threshold functions. STOC 2009: 649-658
• 
  Tim Roughgarden:
  Intrinsic robustness of the price of anarchy. STOC 2009: 513-522
• 
  Linda Sellie:
  Exact learning of random DNF over the uniform distribution. STOC 2009: 45-54
• 
  Asaf Shapira:
  Green's conjecture and testing linear-invariant properties. STOC 2009: 159-166
• 
  Allan Sly:
  Reconstruction for the Potts model. STOC 2009: 581-590
• 
  Amnon Ta-Shma:
  Short seed extractors against quantum storage. STOC 2009: 401-408
• 
  Luca Trevisan:
  Max cut and the smallest eigenvalue. STOC 2009: 263-272
• 
  Madhur Tulsiani:
  CSP gaps and reductions in the lasserre hierarchy. STOC 2009: 303-312
• 
  Virginia Vassilevska, Ryan Williams:
  Finding, minimizing, and counting weighted subgraphs. STOC 2009: 455-464
• 
  Emanuele Viola:
  Bit-probe lower bounds for succinct data structures. STOC 2009: 475-482
• 
  Avi Wigderson:
  The work of Leslie Valiant. STOC 2009: 1-2
• 
  Yuichi Yoshida, Masaki Yamamoto, Hiro Ito:
  An improved constant-time approximation algorithm for maximum matchings. STOC 2009: 225-234
• 
  Michael Mitzenmacher:
  Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009. ACM 2009, ISBN 978-1-60558-506-2 [contents]

[<< prev] #60 -- #79