Concepedia

Union-find Analysis

Union-Find Analysis is a theoretical framework in amortized analysis that characterizes the efficiency of dynamic connectivity algorithms by analyzing the aggregate or worst-case cost of a sequence of union and find operations on disjoint sets.

44

Publications

2.3K

Citations

86

Authors

58

Institutions

Publications per year

2017–2026

2

Parents

Publications

44

Two linear time Union-Find strategies for image processing

Christophe Fiorio, Jens Gustedt · Theoretical Computer Science · 1996 · 231 citations · Full text

, , +13

Building the Component Tree in Quasi-Linear Time

Laurent Najman, Michel Couprie · IEEE Transactions on Image Processing · 2006 · 226 citations

, , +12

Continuum percolation thresholds in two dimensions

Stephan Mertens, Cristopher Moore · Physical Review E · 2012 · 212 citations · Full text

, , +16

Area-efficient graph layouts

Charles E. Leiserson · 1980 · 152 citations

, , +17

A linear algorithm for finding dominators in flow graphs and related problems

Dov Harel · 1985 · 113 citations

, , +16

1–5 of 44

Authors

86

  1. PK
    Pankaj K. Agarwal

    Duke University, United States

    2 publications · 55 citations

    2

    h-index

  2. ZG
    Zvi Galil

    Tel Aviv University, Israel

    2 publications · 39 citations

    2

    h-index

  3. JG
    Jens Gustedt

    Institut national de recherche en sciences et technologies du numérique, France

    2 publications · 247 citations

    2

    h-index

  4. AM
    Arnold Meijster

    University of Groningen, Netherlands

    2 publications · 46 citations

    2

    h-index

  5. KY
    Ke Yi

    Hong Kong University of Science and Technology, Hong Kong SAR China

    2 publications · 55 citations

    2

    h-index

1–5 of 86

Institutions

58

  1. Utrecht University

    Utrecht, The Netherlands

    3 h-index

    3 publications

    84 citations

  2. Centre National de la Recherche Scientifique

    Paris, France

    3 h-index

    3 publications

    330 citations

  3. Tel Aviv University

    Tel Aviv, Israel

    3 h-index

    6 publications

    156 citations

  4. Université Paris-Sud

    Orsay, France

    2 h-index

    2 publications

    99 citations

  5. Université Gustave Eiffel

    Champs-sur-Marne, France

    2 h-index

    4 publications

    514 citations

  6. Technische Universität Berlin

    Berlin, Germany

    2 h-index

    2 publications

    247 citations

  7. University of Groningen

    Groningen, The Netherlands

    2 h-index

    4 publications

    92 citations

  8. UniLaSalle Amiens (ESIEE-Amiens)

    Amiens, France

    2 h-index

    3 publications

    288 citations

1–8 of 58

Venues

  1. Theoretical Computer Science

    2 publications · 247 citations

    2

    h-index

  2. International Journal of Parallel Programming

    1 publications · 25 citations

    1

    h-index

  3. ACM Transactions on Algorithms

    TALG · 1 publications · 18 citations

    1

    h-index

  4. Electronic Notes in Theoretical Computer Science

    ENTCS · 1 publications · 10 citations

    1

    h-index

  5. Journal of Computer and System Sciences

    1 publications · 34 citations

    1

    h-index

1–5