The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Dynamic storage allocation: A survey and critical review
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
The Structure of Scientific Revolutions
Kuhn, T. S., & Schlegel, R. (1963) · Physics Today · doi:10.1063/1.3050879 · Cited by 35,538
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,337
The Structure of Scientific Revolutions.
Bohm, D., & Kuhn, T. S. (1964) · The Philosophical Quarterly · doi:10.2307/2217783 · Cited by 9,130
Kripke, S. A. (1972) · Semantics of Natural Language · doi:10.1007/978-94-010-2557-7_9 · Cited by 7,028
The Art of Computer Programming. Volume 1: Fundamental Algorithms.
Odeh, R. E., & Knuth, D. E. (1969) · Journal of the American Statistical Association · doi:10.2307/2283757 · Cited by 2,525
DENNETT, D. C. (1995) · The Sciences · doi:10.1002/j.2326-1951.1995.tb03633.x · Cited by 1,975
The design and implementation of a log-structured file system
Rosenblum, M., & Ousterhout, J. K. (1992) · ACM Transactions on Computer Systems · doi:10.1145/146941.146943 · Cited by 1,268
Self-adjusting binary search trees
Sleator, D. D., & Tarjan, R. E. (1985) · Journal of the ACM · doi:10.1145/3828.3835 · Cited by 1,228
Putnam, H. (2011) · The Pragmatism Reader · doi:10.1515/9781400838684-021 · Cited by 1,190
Notes on Structured Programming
Dijkstra, E. W. (1970) · TU/e Research Portal · doi:10.26153/tsw/53177 · Cited by 824
Garbage collection in an uncooperative environment
Boehm, H., & Weiser, M. (1988) · Software: Practice and Experience · doi:10.1002/spe.4380180902 · Cited by 627
Evaluating associativity in CPU caches
Hill, M. D., & Smith, A. J. (1989) · IEEE Transactions on Computers · doi:10.1109/12.40842 · Cited by 606
Denning, P. J. (1970) · ACM Computing Surveys · doi:10.1145/356571.356573 · Cited by 407
Knowlton, K. C. (1965) · Communications of the ACM · doi:10.1145/365628.365655 · Cited by 303
Worst-case analysis of memory allocation algorithms
Garey, M. R., Graham, R. L., & Ullman, J. D. (1972) · Proceedings of the fourth annual ACM symposium on Theory of computing - STOC '72 · doi:10.1145/800152.804907 · Cited by 178
Optimally profiling and tracing programs
Ball, T., & Larus, J. R. (1992) · Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '92 · doi:10.1145/143165.143180 · Cited by 165
Marr's three levels: A re-evaluation
McClamrock, R. (1991) · Minds and Machines · doi:10.1007/bf00361036 · Cited by 162
Turing Award lecture on computational complexity and the nature of computer science
Hartmanis, J. (1994) · Communications of the ACM · doi:10.1145/194313.214781 · Cited by 113
Existential cognition: computational minds in the world
(1995) · Choice Reviews Online · doi:10.5860/choice.33-0865 · Cited by 88
Ross, D. T. (1967) · Communications of the ACM · doi:10.1145/363534.363546 · Cited by 78
Bounds for Some Functions Concerning Dynamic Storage Allocation
Robson, J. M. (1974) · Journal of the ACM · doi:10.1145/321832.321846 · Cited by 77
Worst case fragmentation of first fit and best fit storage allocation strategies
Robson, J. M. (1977) · The Computer Journal · doi:10.1093/comjnl/20.3.242 · Cited by 67
Gries, D. (1978) · Springer eBooks · doi:10.1007/978-1-4612-6315-9_7 · Cited by 59
A generalized technique for symbol manipulation and numerical calculation
Ross, D. T. (1961) · Communications of the ACM · doi:10.1145/366199.366256 · Cited by 53
A Dynamic Storage Allocation Scheme
Iliffe, J. K., & Jodeit, J. G. (1962) · The Computer Journal · doi:10.1093/comjnl/5.3.200 · Cited by 43
On computational complexity and the nature of computer science
Hartmanis, J. (1995) · ACM Computing Surveys · doi:10.1145/214037.214040 · Cited by 42
Analysis of free-storage algorithms
Margolin, B. H., Parmelee, R. P., & Schatzoff, M. (1971) · IBM Systems Journal · doi:10.1147/sj.104.0283 · Cited by 40
Dynamic memory allocation in computer simulation
Nielsen, N. R. (1977) · Communications of the ACM · doi:10.1145/359863.359890 · Cited by 29
Garbage collection using a dynamic threatening boundary
Barrett, D. A., & Zorn, B. G. (1995) · Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/207110.207164 · Cited by 29
Analysis of free-storage algorithms-visited
Bozman, G. P., Buco, W. M., Daly, T. P., & Tetzlaff, W. H. (1984) · IBM Systems Journal · doi:10.1147/sj.231.0044 · Cited by 20
Program Behavior at the Symbolic Level
Batson, A. P. (1976) · Computer · doi:10.1109/c-m.1976.218436 · Cited by 18
An adaptive system for dynamic storage allocation
Leverett, B. W., & Hibbard, P. G. (1982) · Software Practice and Experience · doi:10.1002/spe.4380120606 · Cited by 10
Cited by
Hybrid computing using a neural network with dynamic external memory
Graves, A., Wayne, G., Reynolds, M., Harley, T., Danihelka, I., Grabska-Barwińska, A., Colmenarejo, S. G., Grefenstette, E., Ramalho, T., Agapiou, J., et al. (2016) · Nature · doi:10.1038/nature20101 · Cited by 1,412
“To allow the controller to free and allocate memory as needed, we developed a differentiable analogue of the ‘free list’ memory allocation scheme 42 , whereby a list of available memory locations is maintained by adding to and removing addresses from a linked list.”
MethodDieHard: probabilistic memory safety for unsafe languages
Berger, E. D., & Zorn, B. G. (2006) · ACM SIGPLAN Notices · doi:10.1145/1133255.1134000 · Cited by 405
MICA: A Holistic Approach to Fast In-Memory Key-Value Storage
Lim, H., Han, D., Andersen, D. G., & Kaminsky, M. (2018) · Figshare · doi:10.1184/r1/6607280 · Cited by 361
SILT: a memory-efficient, high-performance key-value store
Lim, H., Fan, B., Andersen, D. G., & Kaminsky, M. (2011) · Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles · doi:10.1145/2043556.2043558 · Cited by 294
Metadata
- Authors
- Wilson, P. R., Johnstone, M. S., Neely, M., & Boles, D.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1995
- Pages
- 1-116
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1899349177
- Cited by
- 594
- References
- 32
- FWCI
- 5.94
- 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.