Worst-case Bounds

Worst-Case Bounds is a theoretical construct in the analysis of algorithms that specifies the maximum asymptotic computational complexity of operations in a skip list under any possible input or execution scenario.

906

Publications

57.8K

Citations

1.7K

Authors

595

Institutions

Publications per year

2017–2026

120

Parents

Authors

1.7K

  1. RE
    Robert E. Tarjan

    Princeton University, United States

    8 publications · 3.7K citations

    8

    h-index

  2. JH
    Jan Hoffmann

    Carnegie Mellon University, United States

    7 publications · 306 citations

    7

    h-index

  3. ED
    Erik D. Demaine

    Massachusetts Institute of Technology, United States

    7 publications · 524 citations

    7

    h-index

  4. PB
    Paul Beame

    University of Washington, United States

    7 publications · 684 citations

    7

    h-index

  5. AC
    Andrew Chi-Chih Yao

    Princeton University, United States

    6 publications · 237 citations

    6

    h-index

1–5 of 1.7K

Venues

  1. SIAM Journal on Computing

    67 publications · 6.1K citations

    36

    h-index

  2. Journal of the ACM

    JACM · 32 publications · 5.3K citations

    25

    h-index

  3. Operations Research

    24 publications · 2.4K citations

    21

    h-index

  4. arXiv (Cornell University)

    Repository · 37 publications · 1K citations

    18

    h-index

  5. IEEE Transactions on Information Theory

    13 publications · 535 citations

    12

    h-index

1–5