The DOI matches its Crossref record.
Proceedings. 45th Annual IEEE Symposium on Foundations of Computer Science
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Horodecki, R., Horodecki, P., Horodecki, M., & Horodecki, K. (2009) · Reviews of Modern Physics · doi:10.1103/revmodphys.81.865 · Cited by 10,118
Finding community structure in networks using the eigenvectors of matrices
Newman, M. E. J. (2006) · Physical Review E · doi:10.1103/physreve.74.036104 · Cited by 4,761
Impossibility of distributed consensus with one faulty process
Fischer, M. J., Lynch, N. A., & Paterson, M. S. (1985) · Journal of the ACM · doi:10.1145/3149.214121 · Cited by 4,579
Selection of relevant features and examples in machine learning
Blum, A. L., & Langley, P. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00063-5 · Cited by 3,298
Goldwasser, S., & Micali, S. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,603
Random sampling with a reservoir
Vitter, J. S. (1985) · ACM Transactions on Mathematical Software · doi:10.1145/3147.3165 · Cited by 1,758
Goldreich, O., Micali, S., & Wigderson, A. (1991) · Journal of the ACM · doi:10.1145/116825.116852 · Cited by 1,349
Which Problems Have Strongly Exponential Complexity?
Impagliazzo, R., Paturi, R., & Zane, F. (2001) · Journal of Computer and System Sciences · doi:10.1006/jcss.2001.1774 · Cited by 1,331
Higher-order organization of complex networks
Benson, A. R., Gleich, D. F., & Leskovec, J. (2016) · Science · doi:10.1126/science.aad9029 · Cited by 1,270
Primitives for the manipulation of general subdivisions and the computation of Voronoi
Guibas, L., & Stolfi, J. (1985) · ACM Transactions on Graphics · doi:10.1145/282918.282923 · Cited by 1,260
Learning metric-topological maps for indoor mobile robot navigation
Thrun, S. (1998) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00078-7 · Cited by 1,042
Impagliazzo, R., & Paturi, R. (2001) · Journal of Computer and System Sciences · doi:10.1006/jcss.2000.1727 · Cited by 1,002
Minimum disclosure proofs of knowledge
Brassard, G., Chaum, D., & Crépeau, C. (1988) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(88)90005-0 · Cited by 959
A survey of distributed optimization
Yang, T., Yi, X., Wu, J., Yuan, Y., Wu, D., Meng, Z., Hong, Y., Wang, H., Lin, Z., & Johansson, K. H. (2019) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2019.05.006 · Cited by 913
Belief, awareness, and limited reasoning
Fagin, R., & Halpern, J. Y. (1987) · Artificial Intelligence · doi:10.1016/0004-3702(87)90003-8 · Cited by 885
Quantum random number generators
Herrero-Collantes, M., & Garcia-Escartin, J. C. (2017) · Reviews of Modern Physics · doi:10.1103/revmodphys.89.015004 · Cited by 791
Unconditionally Secure Quantum Bit Commitment is Impossible
Mayers, D. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.3414 · Cited by 748
Shortcut to Adiabatic Passage in Two- and Three-Level Atoms
Chen, X., Lizuain, I., Ruschhaupt, A., Guéry-Odelin, D., & Muga, J. G. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.123003 · Cited by 627
On the minimal synchronism needed for distributed consensus
Dolev, D., Dwork, C., & Stockmeyer, L. (1987) · Journal of the ACM · doi:10.1145/7531.7533 · Cited by 620
Håstad, J. (1990) · Journal of Algorithms · doi:10.1016/0196-6774(90)90014-6 · Cited by 584
Faster algorithms for the shortest path problem
Ahuja, R. K., Mehlhorn, K., Orlin, J., & Tarjan, R. E. (1990) · Journal of the ACM · doi:10.1145/77600.77615 · Cited by 554
The node-deletion problem for hereditary properties is NP-complete
Lewis, J. M., & Yannakakis, M. (1980) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(80)90060-4 · Cited by 513
High-Rate, High-Fidelity Entanglement of Qubits Across an Elementary Quantum Network
Stephenson, L. J., Nadlinger, D. P., Nichol, B. C., An, S., Drmota, P., Ballance, T. G., Thirumalai, K., Goodwin, J. F., Lucas, D. M., & Ballance, C. J. (2020) · Physical Review Letters · doi:10.1103/physrevlett.124.110501 · Cited by 291
Quantum computation and quantum information
Nagy, M., & Akl, S. G. (2006) · International Journal of Parallel, Emergent and Distributed Systems · doi:10.1080/17445760500355678 · Cited by 287
A Game of Prediction with Expert Advice
Vovk, V (1998) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1556 · Cited by 281
Korte, B., & Vygen, J. (2002) · Algorithms and Combinatorics · doi:10.1007/978-3-662-21711-5_16 · Cited by 273
Efficient algorithms for geometric optimization
Agarwal, P. K., & Sharir, M. (1998) · ACM Computing Surveys · doi:10.1145/299917.299918 · Cited by 257
The complexity of reasoning about knowledge and time. I. Lower bounds
Halpern, J. Y., & Vardi, M. Y. (1989) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(89)90039-1 · Cited by 252
Measurement-based quantum computation beyond the one-way model
Gross, D., Eisert, J., Schuch, N., & Perez-Garcia, D. (2007) · Physical Review A · doi:10.1103/physreva.76.052315 · Cited by 236
Quantum Speedup for Active Learning Agents
Paparo, G. D., Dunjko, V., Makmal, A., Martin-Delgado, M. A., & Briegel, H. J. (2014) · Physical Review X · doi:10.1103/physrevx.4.031002 · Cited by 192
Quantum Algorithm for Spectral Measurement with a Lower Gate Count
Poulin, D., Kitaev, A., Steiger, D. S., Hastings, M. B., & Troyer, M. (2018) · Physical Review Letters · doi:10.1103/physrevlett.121.010501 · Cited by 108
SafePath: Differentially-private publishing of passenger trajectories in transportation systems
Al-Hussaeni, K., Fung, B. C. M., Iqbal, F., Dagher, G. G., & Park, E. G. (2018) · Computer Networks · doi:10.1016/j.comnet.2018.07.007 · Cited by 52
Irreconcilable difference between quantum walks and adiabatic quantum computing
Wong, T. G., & Meyer, D. A. (2016) · Physical Review A · doi:10.1103/physreva.93.062313 · Cited by 13
Singh, S., Alderete, C. H., Balu, R., Monroe, C., Linke, N. M., & Chandrashekar, C. M. (2021) · Physical Review A · doi:10.1103/physreva.104.062401 · Cited by 13
Singh, S., Alderete, C. H., Balu, R., Monroe, C., Linke, N. M., & Chandrashekar, C. M. (2020) · arXiv · doi:10.48550/arxiv.2001.11197 · Cited by 13
Costa, P. C. S., Morales, M. E. S., An, D., & Sanders, Y. R. (2025) · Physical Review A · doi:10.1103/hm1z-z9p2
Metadata
- Venue
- 45th Annual IEEE Symposium on Foundations of Computer Science
- Publisher
- IEEE
- Published
- 2004
- ISSN
- 0272-5428 (ISSN-L)
- OpenAlex
- W4245266864
- Cited by
- 805
- References
- 0
- FWCI
- 18.67
- Type
- conference paper
- 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.