Concepedia

Inverse Ackermann Complexity

Inverse Ackermann Complexity is a time complexity class characterized by the asymptotic growth rate bounded by the inverse of the Ackermann function, commonly arising in the analysis of disjoint set data structures with path compression and union by rank.

22

Publications

744

Citations

50

Authors

26

Institutions

Publications per year

2017–2026

1

Parents

Publications

22

A minimum spanning tree algorithm with inverse-Ackermann type complexity

Bernard Chazelle · Journal of the ACM · 2000 · 332 citations · Full text

, , +14

Arrangements of lines in 3-space: a data structure with applications

Michael McKenna, Joseph O’Rourke · 1988 · 43 citations

, , +13

Computer Aided Product Color Design with Artificial Intelligence

Hung‐Cheng Tsai, Chia-Young Hung, Fei-Kung Hung · Computer-Aided Design and Applications · 2007 · 35 citations

, , +12

Constant-time <i>O</i> (1) all pairs geodesic distance query on triangle meshes

Shiqing Xin, Xiang Ying, Ying He · 2011 · 30 citations

, , +14

SIMULATING ENHANCED MESHES, WITH APPLICATIONS

Rong Lin, Stephan Olariu, James L. Schwing et al. · Parallel Processing Letters · 1993 · 28 citations

, , +15

1–5 of 22

Authors

50

  1. MS
    Micha Sharir

    Tel Aviv University, Israel

    3 publications · 46 citations

    3

    h-index

  2. SM
    Shay Mozes

    Brown University, United States

    2 publications · 34 citations

    2

    h-index

  3. HK
    Haim Kaplan

    Tel Aviv University, Israel

    2 publications · 34 citations

    2

    h-index

  4. YN
    Yahav Nussbaum

    Tel Aviv University, Israel

    2 publications · 34 citations

    2

    h-index

  5. JL
    James L. Schwing

    Old Dominion University, United States

    1 publications · 28 citations

    1

    h-index

1–5 of 50

Institutions

26

  1. Tel Aviv University

    Tel Aviv, Israel

    2 h-index

    4 publications

    66 citations

  2. Reichman University

    Herzliya, Israel

    1 h-index

    1 publications

    18 citations

  3. University of South China

    Hengyang, China

    1 h-index

    1 publications

    35 citations

  4. Tokyo University of Agriculture and Technology

    Tokyo, Japan

    1 h-index

    1 publications

    27 citations

  5. Brigham Young University

    Provo, United States

    1 h-index

    1 publications

    10 citations

  6. Nanyang Technological University

    Singapore, Singapore

    1 h-index

    3 publications

    90 citations

  7. Elizabeth City State University

    Elizabeth City, United States

    1 h-index

    1 publications

    28 citations

  8. Old Dominion University

    Norfolk, United States

    1 h-index

    2 publications

    56 citations

1–8 of 26

Venues

  1. Computer-Aided Design and Applications

    12 publications · 221 citations

    10

    h-index

  2. Computational Geometry

    1 publications · 12 citations

    1

    h-index

  3. SIAM Journal on Discrete Mathematics

    1 publications · 12 citations

    1

    h-index

  4. Journal of the ACM

    JACM · 1 publications · 332 citations

    1

    h-index

  5. Parallel Processing Letters

    1 publications · 28 citations

    1

    h-index

1–5