Upper Bounds
Upper Bounds is a theoretical limit in algorithm analysis that specifies the maximum time complexity an algorithm can exhibit for any input of a given size, serving as a worst-case performance guarantee within the asymptotic analysis of algorithms.
8.9K
Publications
461K
Citations
56K
Authors
3.7K
Institutions
Publications per year
2017–2026
1.7K
Variants
Worst-case Complexity
8.9K
Lloyd M. Robeson · Journal of Membrane Science · 2008 · 5.8K citations
TSPLIB—A Traveling Salesman Problem Library
Gerhard Reinelt · INFORMS Journal on Computing · 1991 · 2.6K citations
Bounds on Multiprocessing Timing Anomalies
Ron Graham · SIAM Journal on Applied Mathematics · 1969 · 2.4K citations
Consensus in the presence of partial synchrony
Cynthia Dwork, Nancy Lynch, Larry Stockmeyer · Journal of the ACM · 1988 · 1.9K citations · Full text
1–5 of 8.9K
56K
30
h-index
24
h-index
23
h-index
22
h-index
22
h-index
1–5 of 56K
3.7K
Massachusetts Institute of Technology
Cambridge, United States
72 h-index
1.6K publications
138.6K citations
University of California, Berkeley
Berkeley, United States
65 h-index
784 publications
58.3K citations

Centre National de la Recherche Scientifique
Paris, France
63 h-index
4K publications
274.5K citations
California Institute of Technology
Pasadena, United States
60 h-index
2K publications
200.7K citations
University of Maryland, College Park
College Park, United States
56 h-index
634 publications
51.9K citations
Princeton University
Princeton, United States
50 h-index
567 publications
33.6K citations
Technion – Israel Institute of Technology
Haifa, Israel
50 h-index
326 publications
19.6K citations
Stanford University
Stanford, United States
50 h-index
543 publications
76.2K citations
1–8 of 3.7K
417 publications · 31.5K citations
84
h-index
PRL · 109 publications · 11.8K citations
54
h-index
Repository · 340 publications · 10K citations
49
h-index
81 publications · 6.5K citations
43
h-index
ApJ · 87 publications · 7.5K citations
43
h-index
1–5