Fast decision algorithms based on union and find

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 1977-October, Issue , 1977, Pages 114-119

  Nelson, Greg ^a   Oppen, Derek C ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84980187685     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/sfcs.1977.12     Document Type: Conference Paper

References (8)

1. W. Ackermann, "Solvable Cases of the Decision Problem", North-Holland, Amsterdam.
2. A. V. Aho, J. E. Hopcroft and J. D. Ullmann, "The Design and Analysis of Computer Algorithms", Addison-Wesley, Reading, Massachusetts.
3. R. Boyer and J. Moore, "A Computer Proof of the Correctness of a Simple Optimizing Compiler for Expressions", Technical Report, SRI International, January, 1977.
4. P. J. Downey and R. Sethi, unpublished memorandum.
5. D. S. Johnson and R. E. Tarjan, "Finding Equivalent Expressions".
6. C. G. Nelson and D. C. Oppen, "A Simplifier for Program Manipulation", in preparation.
7. R. Shostak, "An Algorithm for Reasoning about Equality", Proceedings of the Fifth Annual International Conference on Artificial Intelligence, 1977.
8. R. E. Tarjan, "Efficiency of a Good But Not Linear Set Union Algorithm", Journal of the ACM, pp. 215-225.