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

Authors

56K

  1. GM
    G. Mitselmakher

    University of Florida, United States

    31 publications · 3K citations

    30

    h-index

  2. MC
    M. Costa

    Rutherford Appleton Laboratory, United Kingdom

    26 publications · 1.8K citations

    24

    h-index

  3. SS
    Shlomo Shamai

    Technion – Israel Institute of Technology, Israel

    36 publications · 3.4K citations

    23

    h-index

  4. CT
    C. Tully

    Tata Institute of Fundamental Research, India

    29 publications · 1.7K citations

    22

    h-index

  5. TF
    T. Ferguson

    European Organization for Nuclear Research, Switzerland

    29 publications · 1.7K citations

    22

    h-index

1–5 of 56K

Venues

  1. IEEE Transactions on Information Theory

    417 publications · 31.5K citations

    84

    h-index

  2. Physical Review Letters

    PRL · 109 publications · 11.8K citations

    54

    h-index

  3. arXiv (Cornell University)

    Repository · 340 publications · 10K citations

    49

    h-index

  4. 43

    h-index

  5. The Astrophysical Journal

    ApJ · 87 publications · 7.5K citations

    43

    h-index

1–5