BibTeX
@MISC{Conchon_apersistent,
author = {Sylvain Conchon},
title = {A Persistent Union-Find Data Structure},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract The problem of disjoint sets, also known as union-find, consistsin maintaining a partition of a finite set within a data structure.
Citations
| 59 | Leiserson C and Rivest R, Introduction to Algorithms, (pp 776–800 for FFT, 837–844 for primality test, 812 for extended Euclid algorithm, 834–836 for RSA cryptosystem - Cormen - 1990 |
| 8 | Purely Functional Data Structures. Cambridge University - Okasaki - 1998 |
| 5 | Fully persistent arrays for efficient incremental updates and voluminous reads - Chuang - 1992 |
| 3 | Conchon and Evelyne Contejean. Ergo: A Decision Procedure for Program Verification. http://ergo.lri.fr - Sylvain |
| 3 | Conchon and Jean-Christophe Filliâtre. Semi-Persistent Data Structures - Sylvain - 2007 |
| 1 | Data Structuresand Algorithms - Aho, Hopcroft, et al. - 1983 |
| 1 | binding makes functional arrays fast.SIGPLAN Not - Shallow - 1991 |
