logo
http://theoryofcomputing.org     ISSN 1557-2862
Endorsed by ACM SIGACT
  • Home
  • Introduction
  • Articles
  • Special Issues
  • Library
  • Editors
  • Submit
  • Issues
  • Contact Us
  • Search
Volume 8 (2012, in progress)
Volume 8, Article 8 (pages 197-208)
The Communication Complexity of Gap Hamming Distance
by Alexander A. Sherstov
Volume 8, Article 7 (pages 165-195) [Motwani Special Issue]
Online Scheduling to Minimize Maximum Response Time and Maximum Delay Factor
by Chandra Chekuri, Sungjin Im, and Benjamin Moseley
Volume 8, Article 6 (pages 121-164) [RESEARCH SURVEY]
The Multiplicative Weights Update Method: a Meta-Algorithm and Applications
by Sanjeev Arora, Elad Hazan, and Satyen Kale
Volume 8, Article 5 (pages 95-119) [Motwani Special Issue]
Revenue Submodularity
by Shaddin Dughmi, Tim Roughgarden, and Mukund Sundararajan
Volume 8, Article 4 (pages 69-94) [Motwani Special Issue]
Regularity Lemmas and Combinatorial Algorithms
by Nikhil Bansal and Ryan Williams
Volume 8, Article 3 (pages 55-68) [Motwani Special Issue]
Rajeev Motwani (1962-2009)
by Prabhakar Raghavan
Volume 8, Article 2 (pages 53-54) [Motwani Special Issue]
Special Issue in Honor of Rajeev Motwani (1962-2009): Guest Editors' Foreword
by Samir Khuller and Sudipto Guha
Volume 8, Article 1 (pages 1-51)
Time-Space Efficient Simulations of Quantum Computations
by Dieter van Melkebeek and Thomas Watson