The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Algorithms and Complexity: Second Italian Conference, CIAC '94 Rome, Italy, February 23–25, 1994 Proceedings
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
Cites
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
An algorithm for the machine calculation of complex Fourier series
Cooley, J. W., & Tukey, J. W. (1965) · Mathematics of Computation · doi:10.1090/s0025-5718-1965-0178586-1 · Cited by 13,154
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
B., T. A. A. (1946) · The Mathematical Gazette · doi:10.1017/s0025557200071461 · Cited by 7,129
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
Fast probabilistic algorithms for hamiltonian circuits and matchings
Angluin, D., & Valiant, L. G. (1979) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(79)90045-x · Cited by 570
Finding a Maximum Independent Set
Tarjan, R. E., & Trojanowski, A. E. (1977) · SIAM Journal on Computing · doi:10.1137/0206038 · Cited by 474
On Distinguishing Prime Numbers from Composite Numbers
Adleman, L. M., Pomerance, C., & Rumely, R. S. (1983) · The Annals of Mathematics · doi:10.2307/2006975 · Cited by 305
Asymptotically Fast Factorization of Integers
Dixon, J. D. (1981) · Mathematics of Computation · doi:10.1090/s0025-5718-1981-0595059-1 · Cited by 134
The Mathematics of Public-Key Cryptography
Hellman, M. E. (1979) · Scientific American · doi:10.1038/scientificamerican0879-146 · Cited by 88
Metadata
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1994
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2146766934
- Cited by
- 417
- References
- 11
- FWCI
- 79.15
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Algorithms and Complexity: Second Italian Conference, CIAC '94 Rome, Italy, February 23–25, 1994 Proceedings. https://app.cochat.ai/papers/10.1007/3-540-57811-0
- The paper
- Algorithms and Complexity: Second Italian Conference, CIAC '94 Rome, Italy, February 23–25, 1994 Proceedings. (1994). Lecture Notes in Computer Science. https://doi.org/10.1007/3-540-57811-0
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.
