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
906
Bounds on Multiprocessing Timing Anomalies
Ron Graham · SIAM Journal on Applied Mathematics · 1969 · 2.4K citations
Online Passive-Aggressive Algorithms
Koby Crammer, Ofer Dekel, Joseph Keshet et al. · 2006 · 1.5K citations
Jyrki Kivinen, Alex Smola, Robert C. Williamson · IEEE Transactions on Signal Processing · 2004 · 1K citations
1–5 of 906
1.7K
8
h-index
7
h-index
7
h-index
7
h-index
6
h-index
1–5 of 1.7K
595
Massachusetts Institute of Technology
Cambridge, United States
23 h-index
59 publications
5.6K citations
Stanford University
Stanford, United States
20 h-index
47 publications
3.4K citations
University of California, Berkeley
Berkeley, United States
19 h-index
42 publications
2K citations

University of Waterloo
Waterloo, Canada
17 h-index
34 publications
1.3K citations
Carnegie Mellon University
Pittsburgh, United States
17 h-index
42 publications
3.1K citations
Columbia University
New York, United States
17 h-index
32 publications
1.9K citations

Tel Aviv University
Tel Aviv, Israel
17 h-index
32 publications
882 citations
Princeton University
Princeton, United States
16 h-index
27 publications
1.9K citations
1–8 of 595
67 publications · 6.1K citations
36
h-index
JACM · 32 publications · 5.3K citations
25
h-index
24 publications · 2.4K citations
21
h-index
Repository · 37 publications · 1K citations
18
h-index
13 publications · 535 citations
12
h-index
1–5