Meldable heaps and Boolean union-find

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 573-582

  Kaplan, Haim ^a   Shafrir, Nira ^a   Tarjan, Robert E ^b,c  

^a TEL AVIV UNIVERSITY   (Israel)

^b PRINCETON UNIVERSITY   (United States)

^c HEWLETT PACKARD COMPANY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; POLYNOMIALS; PROBLEM SOLVING;

BOOLEAN UNION FIND; FIBONACCI HEAPS; MELDABLE HEAPS; UNION FIND PROBLEM;

BOOLEAN FUNCTIONS;

EID: 0036040064     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509907.509990     Document Type: Conference Paper

References (14)

1. Worst-case and amortised optimality in union-find
2. Marked ancestor problems
3. A generalization of a lower bound technique due to Fredman and Saks
4. Fast meldable priority queues
5. Worst-case priority queues
6. Implementation and analysis of binomial queue algorithms
7. A programming and problem-solving seminar
8. Relaxed heaps: An alternative to Fibonacci heaps with applications to parallel computation
9. The cell probe complexity of dynamic data structures
10. Fibonacci heaps and their uses in improved network optimization algorithms
11. Purely functional representations of catenable sorted lists
12. Union-find with deletions
13. Efficiency of a good but not linear set union algorithm
14. Worst case analysis of set union algorithms