The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Trie memory
Open accessAbstract
The work reported here was begun at the MIT Lincoln Laboratory and completed at Bolt Beranek
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
Cites
Prediction and Entropy of Printed English
Shannon, C. E. (1951) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1951.tb01366.x · Cited by 2,686
A command structure for complex information processing
Shaw, J. C., Newell, A., Simon, H. A., & Ellis, T. O. (1958) · AFIPS Spring Joint Computer Conference (SJCC) · doi:10.1145/1457769.1457803 · Cited by 38
Cited by
Global patterns of 16S rRNA diversity at a depth of millions of sequences per sample
Caporaso, J. G., Lauber, C. L., Walters, W. A., Berg-Lyons, D., Lozupone, C. A., Turnbaugh, P. J., Fierer, N., & Knight, R. (2011) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1000080107 · Cited by 9,711
The Quadtree and Related Hierarchical Data Structures
Samet, H. (1984) · ACM Computing Surveys · doi:10.1145/356924.356930 · Cited by 2,205
Techniques for automatically correcting words in text
Kukich, K. (1992) · ACM Computing Surveys · doi:10.1145/146370.146380 · Cited by 1,257
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric
Morrison, D. R. (1968) · Journal of the ACM · doi:10.1145/321479.321481 · Cited by 969
The Case for Learned Index Structures
Kraska, T., Beutel, A., Chi, E. H., Dean, J., & Polyzotis, N. (2018) · Proceedings of the 2018 International Conference on Management of Data · doi:10.1145/3183713.3196909 · Cited by 956
(1998) · Choice Reviews Online · doi:10.5860/choice.35-6287 · Cited by 904
Navarro, G., & Mäkinen, V. (2007) · ACM Computing Surveys · doi:10.1145/1216370.1216372 · Cited by 735
Extendible hashing—a fast access method for dynamic files
Fagin, R., Nievergelt, J., Pippenger, N., & Strong, H. R. (1979) · ACM Transactions on Database Systems · doi:10.1145/320083.320092 · Cited by 659
Cache craftiness for fast multicore key-value storage
Mao, Y., Kohler, E., & Morris, R. T. (2012) · Proceedings of the 7th ACM european conference on Computer Systems · doi:10.1145/2168836.2168855 · Cited by 467
Efficient and precise datarace detection for multithreaded object-oriented programs
Choi, J.-D., Lee, K., Loginov, A., O'Callahan, R., Sarkar, V., & Sridharan, M. (2002) · Proceedings of the ACM SIGPLAN 2002 conference on Programming language design and implementation · doi:10.1145/512529.512560 · Cited by 441
The adaptive radix tree: ARTful indexing for main-memory databases
Leis, V., Kemper, A., & Neumann, T. (2013) · 2013 IEEE 29th International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2013.6544812 · Cited by 420
Autonomous agents modelling other agents: A comprehensive survey and open problems
Albrecht, S. V., & Stone, P. (2018) · Artificial Intelligence · doi:10.1016/j.artint.2018.01.002 · Cited by 417
“[152] extract symbolic sequences of game events from which subsequences of a certain length are extracted and their frequencies represented in a “trie” structure [104], which is compared to known models using statistical hypothesis testing.”
MethodNamed Data Networking: A survey
Saxena, D., Raychoudhury, V., Suri, N., Becker, C., & Cao, J. (2016) · Computer Science Review · doi:10.1016/j.cosrev.2016.01.001 · Cited by 291
Plitt, M., & Masselot, F. (2010) · The Prague Bulletin of Mathematical Linguistics · doi:10.2478/v10108-010-0010-x · Cited by 265
GZoltar: an eclipse plug-in for testing and debugging
Campos, J., Riboira, A., Perez, A., & Abreu, R. (2012) · Proceedings of the 27th IEEE/ACM International Conference on Automated Software Engineering · doi:10.1145/2351676.2351752 · Cited by 208
“Finally, the TRIE [7] structure has a interface written in Java and implemented in C for efficiency.”
MethodBetter Together? An Evaluation of AI-Supported Code Translation
Weisz, J. D., Muller, M., Ross, S. I., Martinez, F., Houde, S., Agarwal, M., Talamadupula, K., & Richards, J. T. (2022) · 27th International Conference on Intelligent User Interfaces · doi:10.1145/3490099.3511157 · Cited by 69
Zhu, Z., Li, J., Zhao, Q., & Akhtar, F. (2023) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.120709 · Cited by 24
Graph-constrained Reasoning: Faithful Reasoning on Knowledge Graphs with Large Language Models
Luo, L., Zhao, Z., Haffari, G., Li, Y.-F., Gong, C., & Pan, S. (2024) · arXiv · doi:10.48550/arxiv.2410.13080 · Cited by 8
Metadata
- Authors
- Fredkin, E.
- Venue
- Communications of the ACM
- Published
- 1960-09
- Volume
- 3
- Issue
- 9
- Pages
- 490-499
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2337480916
- Cited by
- 1,090
- References
- 2
- FWCI
- 3.67
- Type
- journal article
- Language
- en
- Open access
- bronze
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.