Linearity and Unprovability of Set Union Problem Strategies
- 31 May 1997
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 23 (2) , 207-220
- https://doi.org/10.1006/jagm.1996.0815
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Postorder hierarchy for path compressions and set unionPublished by Springer Nature ,2005
- Postorder Disjoint Set Union is LinearSIAM Journal on Computing, 1990
- Linearity and unprovability of set union problemPublished by Association for Computing Machinery (ACM) ,1988
- Planar realizations of nonlinear Davenport-Schinzel sequences by segmentsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Geometric applications of Davenport-Schinzel sequencesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemesCombinatorica, 1986
- Applications of Path Compression on Balanced TreesJournal of the ACM, 1979
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975
- Set Merging AlgorithmsSIAM Journal on Computing, 1973
- An improved equivalence algorithmCommunications of the ACM, 1964