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)
Parents
57
Recursive Star-Tree Parallel Data Structure
Omer Berkman, Uzi Vishkin · SIAM Journal on Computing · 1993 · 189 citations
A linear algorithm for finding dominators in flow graphs and related problems
Dov Harel · 1985 · 113 citations
1–5 of 57
120
9
h-index
4
h-index
4
h-index
4
h-index
3
h-index
1–5 of 120
62

Tel Aviv University
Tel Aviv, Israel
10 h-index
21 publications
703 citations
New York University
New York, United States
6 h-index
10 publications
345 citations
Courant Institute of Mathematical Sciences
New York, United States
4 h-index
6 publications
210 citations
Massachusetts Institute of Technology
Cambridge, United States
3 h-index
4 publications
213 citations

McGill University
Montreal, Canada
3 h-index
4 publications
60 citations
Ben-Gurion University of the Negev
Beersheba, Israel
2 h-index
2 publications
50 citations
The University of Texas at Austin
Austin, United States
2 h-index
3 publications
227 citations
Hebrew University of Jerusalem
Jerusalem, Israel
2 h-index
2 publications
87 citations
1–8 of 62
12 publications · 221 citations
10
h-index
5 publications · 402 citations
5
h-index
3 publications · 89 citations
3
h-index
JACM · 3 publications · 421 citations
3
h-index
TALG · 2 publications · 32 citations
2
h-index
1–5