- Daniel Lokshtanov, Jesper Nederlof:
Saving space by algebraization. STOC 2010: 321-330 - Aleksander Madry:
Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms. STOC 2010: 121-130 - Frédéric Magniez, Claire Mathieu, Ashwin Nayak:
Recognizing well-parenthesized expressions in the streaming model. STOC 2010: 261-270 - Dániel Marx:
Tractable hypergraph properties for constraint satisfaction and conjunctive queries. STOC 2010: 735-744 - Raghu Meka, David Zuckerman:
Pseudorandom generators for polynomial threshold functions. STOC 2010: 427-436 - Daniele Micciancio
, Panagiotis Voulgaris:
A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations. STOC 2010: 351-358 - Andrea Montanari:
Message passing algorithms: a success looking for theoreticians. STOC 2010: 37-38 - Krzysztof Onak, Ronitt Rubinfeld:
Maintaining a large matching and a small vertex cover. STOC 2010: 457-464 - James B. Orlin:
Improved algorithms for computing fisher's market clearing prices: computing fisher's market clearing prices. STOC 2010: 291-300 - Mihai Patrascu:
Towards polynomial lower bounds for dynamic problems. STOC 2010: 603-610 - Ramamohan Paturi, Pavel Pudlák:
On the complexity of circuit satisfiability. STOC 2010: 241-250 - Prasad Raghavendra, David Steurer:
Graph expansion and the unique games conjecture. STOC 2010: 755-764 - Prasad Raghavendra, David Steurer, Prasad Tetali:
Approximations for the isoperimetric and spectral profile of graphs and related parameters. STOC 2010: 631-640 - Ran Raz:
Tensor-rank and lower bounds for arithmetic formulas. STOC 2010: 659-666 - Aaron Roth, Tim Roughgarden:
Interactive privacy via the median mechanism. STOC 2010: 765-774 - Alexander A. Sherstov:
Optimal bounds for sign-representing the intersection of two halfspaces by polynomials. STOC 2010: 523-532 - Ola Svensson:
Conditional hardness of precedence constrained scheduling on identical machines. STOC 2010: 745-754 - Michel Talagrand:
Are many small sets explicitly small? STOC 2010: 13-36 - Kasturi R. Varadarajan:
Weighted geometric set cover via quasi-uniform sampling. STOC 2010: 641-648 - László A. Végh:
Augmenting undirected node-connectivity by one. STOC 2010: 563-572 - Elad Verbin, Qin Zhang:
The limits of buffering: a tight lower bound for dynamic membership in the external memory model. STOC 2010: 447-456 - Ryan Williams:
Improving exhaustive search implies superpolynomial lower bounds. STOC 2010: 231-240 - Leonard J. Schulman:
Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010. ACM 2010, ISBN 978-1-4503-0050-6 [contents]
