The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Amortized Computational Complexity
Abstract
A powerful technique in the complexity analysis of data structures is amortization, or averaging over time. Amortized running time is a realistic but robust complexity measure for which we can obtain surprisingly tight upper and lower bounds on a variety of algorithms. By following the principle of designing algorithms whose amortized complexity is low, we obtain “self-adjusting” data structures that are simple, flexible and efficient. This paper surveys recent work by several researchers on amortized complexity.
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 Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Fast Pattern Matching in Strings
Knuth, D. E., Morris, Jr., & Pratt, V. R. (1977) · SIAM Journal on Computing · doi:10.1137/0206024 · Cited by 2,936
Amortized efficiency of list update and paging rules
Sleator, D. D., & Tarjan, R. E. (1985) · Communications of the ACM · doi:10.1145/2786.2793 · Cited by 2,123
Self-citationData Structures and Network Algorithms
Tarjan, R. E. (1983) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970265 · Cited by 2,057
Self-citationEfficiency of a Good But Not Linear Set Union Algorithm
Tarjan, R. E. (1975) · Journal of the ACM · doi:10.1145/321879.321884 · Cited by 1,403
Self-citationSelf-adjusting binary search trees
Sleator, D. D., & Tarjan, R. E. (1985) · Journal of the ACM · doi:10.1145/3828.3835 · Cited by 1,228
Self-citationHopcroft, J., & Tarjan, R. (1974) · Journal of the ACM · doi:10.1145/321850.321852 · Cited by 1,081
Self-citationA dichromatic framework for balanced trees
Guibas, L. J., & Sedgewick, R. (1978) · 19th Annual Symposium on Foundations of Computer Science (sfcs 1978) · doi:10.1109/sfcs.1978.3 · Cited by 661
Symmetric binary B-Trees: Data structure and maintenance algorithms
Bayer, R. (1972) · Acta Informatica · doi:10.1007/bf00289509 · Cited by 495
An improved equivalence algorithm
Galler, B. A., & Fischer, M. J. (1964) · Communications of the ACM · doi:10.1145/364099.364331 · Cited by 312
Cited by
Fibonacci heaps and their uses in improved network optimization algorithms
Fredman, M. L., & Tarjan, R. E. (1987) · Journal of the ACM · doi:10.1145/28869.28874 · Cited by 3,132
Self-citationOn Distinguishing Epistemic from Pragmatic Action
Kirsh, D., & Maglio, P. (1994) · Cognitive Science · doi:10.1207/s15516709cog1804_1 · Cited by 1,641
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
Self-citationKirsh, D. (1995) · Artificial Intelligence · doi:10.1016/0004-3702(94)00017-u · Cited by 935
Purely Functional Data Structures
Okasaki, C. (1998) · Cambridge University Press eBooks · doi:10.1017/cbo9780511530104 · Cited by 625
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
Self-citationEfficient algorithms for finding minimum spanning trees in undirected and directed graphs
Gabow, H. N., Galil, Z., Spencer, T., & Tarjan, R. E. (1986) · Combinatorica · doi:10.1007/bf02579168 · Cited by 517
Self-citationMaking data structures persistent
Driscoll, J. R., Sarnak, N., Sleator, D. D., & Tarjan, R. E. (1989) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(89)90034-2 · Cited by 428
Self-citationAn optimal on-line algorithm for metrical task system
Borodin, A., Linial, N., & Saks, M. E. (1992) · Journal of the ACM · doi:10.1145/146585.146588 · Cited by 326
Topologically sweeping an arrangement
Edelsbrunner, H., & Guibas, L. J. (1986) · Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 · doi:10.1145/12130.12171 · Cited by 283
Metadata
- Authors
- Tarjan, R. E.
- Venue
- SIAM Journal on Algebraic Discrete Methods
- Published
- 1985-04
- Volume
- 6
- Issue
- 2
- Pages
- 306-318
- ISSN
- 0196-5212 (ISSN-L)
- 2168-345X
- OpenAlex
- W1987927249
- Cited by
- 520
- References
- 16
- FWCI
- 16.20
- Type
- journal article
- 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.