Parallel tree contraction and its application
- 1 January 1985
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 02725428,p. 478-489
- https://doi.org/10.1109/sfcs.1985.43
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Optimal parallel generation of a computation tree formACM Transactions on Programming Languages and Systems, 1985
- Symmetric ComplementationJournal of the ACM, 1984
- On Synchronous Parallel Computations with Independent Probabilistic ChoiceSIAM Journal on Computing, 1984
- Finding small simple cycle separators for 2-connected planar graphs.Published by Association for Computing Machinery (ACM) ,1984
- Tight bounds on the complexity of parallel sortingPublished by Association for Computing Machinery (ACM) ,1984
- Probabilistic Algorithms for Deciding Equivalence of Straight-Line ProgramsJournal of the ACM, 1983
- A logarithmic time sort for linear size networksPublished by Association for Computing Machinery (ACM) ,1983
- Parallel Algorithms in Graph Theory: Planarity TestingSIAM Journal on Computing, 1982
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952