Algorithm Analysis

Algorithm Analysis is the systematic evaluation of algorithms in terms of computational complexity and resource consumption, distinguished by its focus on asymptotic performance metrics such as time and space efficiency within the theoretical framework of algorithm design and parallel computation.

10.5K

Publications

612.7K

Citations

16.5K

Authors

3.1K

Institutions

Publications per year

2017–2026

1.4K

Authors

16.5K

  1. RE
    Robert E. Tarjan

    Princeton University, United States

    41 publications · 10.8K citations

    32

    h-index

  2. JD
    James Demmel

    University of California, Berkeley, United States

    38 publications · 2.5K citations

    26

    h-index

  3. VY
    Victor Y. Pan

    Lehman College, United States

    36 publications · 1.6K citations

    25

    h-index

  4. CW
    Carsten Witt

    Technical University of Denmark, Denmark

    26 publications · 1.5K citations

    23

    h-index

  5. SS
    Sartaj Sahni

    University of Florida, United States

    25 publications · 2.9K citations

    21

    h-index

1–5 of 16.5K

Venues

  1. SIAM Journal on Computing

    362 publications · 38.3K citations

    101

    h-index

  2. Journal of the ACM

    JACM · 145 publications · 30.7K citations

    72

    h-index

  3. IEEE Transactions on Computers

    266 publications · 18.2K citations

    68

    h-index

  4. Theoretical Computer Science

    129 publications · 6.4K citations

    46

    h-index

  5. ACM Transactions on Mathematical Software

    TOMS · 114 publications · 10.8K citations

    46

    h-index

1–5