Efficiency of a Good But Not Linear Set Union Algorithm.
Robert Endre Tarjan:
Efficiency of a Good But Not Linear Set Union Algorithm.
J. ACM 22(2): 215-225(1975)@article{DBLP:journals/jacm/Tarjan75,
author = {Robert Endre Tarjan},
title = {Efficiency of a Good But Not Linear Set Union Algorithm},
journal = {J. ACM},
volume = {22},
number = {2},
year = {1975},
pages = {215-225},
ee = {db/journals/jacm/Tarjan75.html, http://doi.acm.org/10.1145/321879.321884},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX
BibTeX
Online Edition
Citation Page
BibTeX
Referenced by
- Heikki Mannila, Kari-Jouko Räihä:
Practical Algorithms for Finding Prime Attributes and Testing Normal Forms.
PODS 1989: 128-133
- Charles Elkan:
A Decision Procedure for Conjunctive Query Disjointness.
PODS 1989: 134-139
- Paris C. Kanellakis, Peter Z. Revesz:
On the Relationship of Congruence Closure and Unification.
DBPL 1987: 23-41
- Hanan Samet:
The Quadtree and Related Hierarchical Data Structures.
ACM Comput. Surv. 16(2): 187-260(1984)
BibTeX
Copyright © Sun May 17 00:05:23 2009
by Michael Ley (ley@uni-trier.de)