Amortized analysis of algorithms for set union with backtracking

Authors:
J. Westbrook;R. E. Tarjan
Affiliations:
Princeton Univ., Princeton, NJ;Princeton Univ., Princeton, NJ/ and AT&T Bell Labs., Murray Hill, NJ
Venue:
SIAM Journal on Computing
Year:
1989

Data structures and algorithms for disjoint set union problems

ACM Computing Surveys (CSUR)
An efficient representation for sparse sets

ACM Letters on Programming Languages and Systems (LOPLAS)
Fully dynamic planarity testing with applications

Journal of the ACM (JACM)
Dynamic two-connectivity with backtracking

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Randomized fully dynamic graph algorithms with polylogarithmic time per operation

Journal of the ACM (JACM)
Retroactive data structures

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Retroactive data structures

ACM Transactions on Algorithms (TALG)
Topics in data structures

Algorithms and theory of computation handbook
Banshee: a scalable constraint-based analysis toolkit

SAS'05 Proceedings of the 12th international conference on Static Analysis

Hi-index	0.00