The DOI matches its Crossref record.
Proceedings of the forty-third annual ACM symposium on Theory of computing
Abstract
The papers in this volume were presented at the 43rd ACM Symposium on Theory of Computing (STOC), held June 6-8, 2011 in San Jose, California, as part of the fifth Federated Computing Research Conference (FCRC). STOC is sponsored by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT). The papers at STOC were selected by the program committee from among 304 submissions received by November 4, 2010 (5 of which were withdrawn by authors during the review process). The committee did its work by a combination of extensive electronic discussion and a physical meeting of the entire committee in San Francisco on January 26-27, 2011. These proceedings contain the 84 papers that were accepted to STOC, one of which is a merge of two related submissions. Three pairs of papers having similar results shared presentation slots at the conference, for a total of 81 talks. All submissions received careful consideration, but they were not refereed in a formal sense. Authors are encouraged to submit full versions of their papers to journals for a complete review and archival publication. The committee selected two papers for a Best Paper Award: "Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs," by Paul Christiano, Jonathan A. Kelner, Aleksander Madry, Daniel A. Spielman, and Shang-Hua Teng, and "Subexponential Lower Bounds for Randomized Pivoting Rules for the Simplex Algorithm," by Oliver Friedmann, Thomas Dueholm Hansen, and Uri Zwick. The committee selected "Analyzing Network Coding Gossip Made Easy" by Bernhard Haeupler for the Danny Lewin Best Student Paper Award. STOC was preceded by an FCRC plenary talk on June 5 given by Leslie Valiant as recipient of the 2011 ACM Turing Award for his transformative contributions to the theory of computation, including the theory of probably approximately correct (PAC) learning, the complexity of enumeration and of algebraic computation, and the theory of parallel and distributed computing. At the conference, the 11th Knuth Prize was awarded to Ravi Kannan for his work on algorithmic techniques that have fundamentally contributed to computational complexity, discrete mathematics, geometry, and operations research. He presented the Knuth Prize Lecture as an FCRC plenary talk on the morning of June 7. The program committee also decided to add a Poster Session, held on the evening of June 6, to increase the opportunities for disseminating and discussing research at the conference. Posters were not refereed; any registered FCRC attendee could present a poster on research in any aspect of theoretical computer science.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Chitambar, E., & Gour, G. (2019) · Reviews of Modern Physics · doi:10.1103/revmodphys.91.025001 · Cited by 1,276
Strong Quantum Computational Advantage Using a Superconducting Quantum Processor
Wu, Y., Bao, W.-S., Cao, S., Chen, F., Chen, M.-C., Chen, X., Chung, T.-H., Deng, H., Du, Y., Fan, D., et al. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.180501 · Cited by 1,059
Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light
Zhong, H.-S., Deng, Y.-H., Qin, J., Wang, H., Chen, M.-C., Peng, L.-C., Luo, Y.-H., Wu, D., Gong, S.-Q., Su, H., et al. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.180502 · Cited by 434
Differentiable learning of quantum circuit Born machines
Liu, J.-G., & Wang, L. (2018) · Physical Review A · doi:10.1103/physreva.98.062324 · Cited by 279
Quantum computational advantage via 60-qubit 24-cycle random circuit sampling
Zhu, Q., Cao, S., Chen, F., Chen, M.-C., Chen, X., Chung, T.-H., Deng, H., Du, Y., Fan, D., Gong, M., et al. (2022) · Science Bulletin · doi:10.1016/j.scib.2021.10.017 · Cited by 263
Detailed study of Gaussian boson sampling
Kruse, R., Hamilton, C. S., Sansoni, L., Barkhofen, S., Silberhorn, C., & Jex, I. (2019) · Physical Review A · doi:10.1103/physreva.100.032326 · Cited by 180
Gaussian boson sampling using threshold detectors
Quesada, N., Arrazola, J. M., & Killoran, N. (2018) · Physical Review A · doi:10.1103/physreva.98.062322 · Cited by 120
The boundary for quantum advantage in Gaussian boson sampling
Bulmer, J. F. F., Bell, B. A., Chadwick, R. S., Jones, A. E., Moise, D., Rigazzi, A., Thorbecke, J., Haus, U.-U., Van Vaerenbergh, T., Patel, R. B., et al. (2022) · Science Advances · doi:10.1126/sciadv.abl9236 · Cited by 88
Regimes of Classical Simulability for Noisy Gaussian Boson Sampling
Qi, H., Brod, D. J., Quesada, N., & García-Patrón, R. (2020) · Physical Review Letters · doi:10.1103/physrevlett.124.100502 · Cited by 87
Computational Power of Random Quantum Circuits in Arbitrary Geometries
(2025) · doi:10.1103/physrevx.15.021052 · Cited by 45
The computational power of random quantum circuits in arbitrary geometries
DeCross, M., Haghshenas, R., Liu, M., Rinaldi, E., Gray, J., Alexeev, Y., Baldwin, C. H., Bartolotta, J. P., Bohn, M., Chertkov, E., et al. (2024) · arXiv · doi:10.48550/arxiv.2406.02501 · Cited by 45
Seshadreesan, K. P., Olson, J. P., Motes, K. R., Rohde, P. P., & Dowling, J. P. (2015) · Physical Review A · doi:10.1103/physreva.91.022334 · Cited by 41
Random circuit block-encoded matrix and a proposal of quantum LINPACK benchmark
Dong, Y., & Lin, L. (2021) · Physical Review A · doi:10.1103/physreva.103.062412 · Cited by 34
Metadata
- Publisher
- ACM
- Published
- 2011-06-06
- OpenAlex
- W4238717878
- Cited by
- 182
- References
- 0
- Type
- paratext
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.