Concepedia

Amortized Running Time

Amortized Running Time is an analytical measure of algorithmic efficiency that belongs to the class of time complexity metrics and is distinguished by its characterization of the average cost per operation over a sequence of operations, rather than the worst-case cost of any single operation.

123

Publications

8.1K

Citations

208

Authors

110

Institutions

Publications per year

2017–2026

18

Parents

Publications

123

Self-adjusting binary search trees

Daniel D. Sleator, Robert E. Tarjan · Journal of the ACM · 1985 · 1.2K citations · Full text

, , +14

Amortized Computational Complexity

Robert E. Tarjan · SIAM Journal on Algebraic and Discrete Methods · 1985 · 525 citations

, , +16

Dynamic social network analysis using latent space models

Purnamrita Sarkar, Andrew Moore · ACM SIGKDD Explorations Newsletter · 2005 · 440 citations

, , +16

Trans-dichotomous algorithms for minimum spanning trees and shortest paths

Michael L. Fredman, Dan E. Willard · Journal of Computer and System Sciences · 1994 · 419 citations

, , +14

Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs

Valerie King · 2003 · 228 citations

, , +14

1–5 of 123

Authors

208

  1. TM
    Timothy M. Chan

    University of Waterloo, Canada

    9 publications · 262 citations

    9

    h-index

  2. RE
    Robert E. Tarjan

    Princeton University, United States

    8 publications · 2.2K citations

    8

    h-index

  3. VK
    Valerie King

    University of Victoria, Canada

    5 publications · 657 citations

    5

    h-index

  4. ML
    Michael L. Fredman

    University of California San Diego, United States

    4 publications · 584 citations

    4

    h-index

  5. SB
    Surender Baswana

    Indian Institute of Technology Kanpur, India

    3 publications · 155 citations

    3

    h-index

1–5 of 208

Institutions

110

  1. University of Waterloo

    Waterloo, Canada

    11 h-index

    12 publications

    308 citations

  2. Max Planck Society

    Munich, Germany

    5 h-index

    8 publications

    148 citations

  3. University of Victoria

    Victoria, Canada

    5 h-index

    7 publications

    884 citations

  4. Massachusetts Institute of Technology

    Cambridge, United States

    5 h-index

    5 publications

    150 citations

  5. Carnegie Mellon University

    Pittsburgh, United States

    5 h-index

    10 publications

    1.1K citations

  6. Princeton University

    Princeton, United States

    5 h-index

    7 publications

    352 citations

  7. Ludwig-Maximilians-Universität München

    Munich, Germany

    4 h-index

    9 publications

    852 citations

  8. Rutgers, The State University of New Jersey

    New Brunswick, United States

    4 h-index

    8 publications

    840 citations

1–8 of 110

Venues

  1. SIAM Journal on Computing

    15 publications · 815 citations

    13

    h-index

  2. ACM Transactions on Algorithms

    TALG · 7 publications · 446 citations

    7

    h-index

  3. arXiv (Cornell University)

    Repository · 6 publications · 276 citations

    6

    h-index

  4. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 4 publications · 76 citations

    4

    h-index

  5. Journal of the ACM

    JACM · 4 publications · 1.4K citations

    4

    h-index

1–5