Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Booktitle=Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011)

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

The power of simple tabulation hashing
Mihai Pȃtraşcu, Mikkel Thorup
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011), 2011, pp. 1-10
Tight bounds for parallel randomized load balancing
Christoph Lenzen, Roger Wattenhofer
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011), 2011, pp. 11-20
Social networks spread rumors in sublogarithmic time
Benjamin Doerr, Mahmoud Fouz, Tobias Friedrich
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011), 2011, pp. 21-30
Quantum one-way communication can be exponentially stronger than classical communication
Bo'az Klartag, Oded Regev
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011), 2011, pp. 31-40
Strong direct product theorems for quantum communication and query complexity
Alexander A. Sherstov
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011), 2011, pp. 41-50
An optimal lower bound on the communication complexity of Gap-Hamming-Distance
Amit Chakrabarti, Oded Regev
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011), 2011, pp. 51-60
Cover times, blanket times, and majorizing measures
Jian Ding, James R. Lee, Yuval Peres
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011), 2011, pp. 61-70
A general framework for graph sparsification
Wai Shing Fung, Ramesh Hariharan, Nicholas J.A. Harvey, Debmalya Panigrahi
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011), 2011, pp. 71-80
Breaking O(n^{1/2})-approximation algorithms for the edge-disjoint paths problem with congestion two
Ken-ichi Kawarabayashi, Yusuke Kobayashi
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011), 2011, pp. 81-88
The equivalence of the random oracle model and the ideal cipher model, revisited
Thomas Holenstein, Robin Künzler, Stefano Tessaro
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011), 2011, pp. 89-98
Separating succinct non-interactive arguments from all falsifiable assumptions
Craig Gentry, Daniel Wichs
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011), 2011, pp. 99-108
Limits of provable security from standard assumptions
Rafael Pass
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011), 2011, pp. 109-118
On optimal single-item auctions
Christos H. Papadimitriou, George Pierrakos
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011), 2011, pp. 119-128
Optimal auctions with correlated bidders are easy
Shahar Dobzinski, Hu Fu, Robert Kleinberg
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011), 2011, pp. 129-138
An impossibility result for truthful combinatorial auctions with submodular valuations
Shahar Dobzinski
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011), 2011, pp. 139-147
From convex optimization to randomized mechanisms: Toward optimal combinatorial auctions
Shaddin Dughmi, Tim Roughgarden, Qiqi Yan
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011), 2011, pp. 149-158
Towards coding for maximum errors in interactive communication
Mark Braverman, Anup Rao
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011), 2011, pp. 159-166
High-rate codes with sublinear-time decoding
Swastik Kopparty, Shubhangi Saraf, Sergey Yekhanin
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011), 2011, pp. 167-176
From affine to two-source extractors via approximate duality
Eli Ben-Sasson, Noga Zewi
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011), 2011, pp. 177-186
Correlation testing for affine invariant properties on \mathbb{F}_p^n in the high error regime
Hamed Hatami, Shachar Lovett
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011), 2011, pp. 187-193
Rank-1 bimatrix games: A homeomorphism and a polynomial time algorithm
Bharat Adsul, Jugal Garg, Ruta Mehta, Milind Sohoni
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011), 2011, pp. 195-204
Exact algorithms for solving stochastic games
Kristoffer Arnsfelt Hansen, Michal Koucký, Niels Lauritzen, Peter Bro Miltersen, Elias P. Tsigaridas
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011), 2011, pp. 205-214
Dueling algorithms
Nicole Immorlica, Adam Tauman Kalai, Brendan Lucier, Ankur Moitra, Andrew Postlewaite, Moshe Tennenholtz
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011), 2011, pp. 215-224
Pareto optimal solutions for smoothed analysts
Ankur Moitra, Ryan O'Donnell
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011), 2011, pp. 225-234
Moser and Tardos meet Lovász
Kashyap Kolipaka, Mario Szegedy
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011), 2011, pp. 235-243

Seiten 1 2 3 4 >