Inverse Ackermann Function

The Inverse Ackermann Function is a mathematical function that arises in the analysis of disjoint set union data structures, distinguished from other slowly-growing functions by its asymptotic behavior being bounded above by the inverse of the Ackermann function, effectively describing the tight bound on the amortized time complexity of operations.

57

Publications

2.5K

Citations

120

Authors

62

Institutions

Publications per year

2017–2026

2

Variants

α(N)

Authors

120

  1. MS
    Micha Sharir

    Tel Aviv University, Israel

    9 publications · 235 citations

    9

    h-index

  2. KK
    Ken‐ichi Kawarabayashi

    National Institute of Informatics, Japan

    4 publications · 67 citations

    4

    h-index

  3. BR
    Bruce Reed

    McGill University, Canada

    4 publications · 67 citations

    4

    h-index

  4. SP
    Seth Pettie

    University of Michigan, United States

    4 publications · 197 citations

    4

    h-index

  5. JP
    János Pach

    Hungarian Academy of Sciences, Hungary

    3 publications · 150 citations

    3

    h-index

1–5 of 120

Venues

  1. Computer-Aided Design and Applications

    12 publications · 221 citations

    10

    h-index

  2. SIAM Journal on Computing

    5 publications · 402 citations

    5

    h-index

  3. SIAM Journal on Discrete Mathematics

    3 publications · 89 citations

    3

    h-index

  4. Journal of the ACM

    JACM · 3 publications · 421 citations

    3

    h-index

  5. ACM Transactions on Algorithms

    TALG · 2 publications · 32 citations

    2

    h-index

1–5