The expected linearity of a simple equivalence algorithm
- 31 December 1978
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 6 (3) , 281-315
- https://doi.org/10.1016/0304-3975(78)90009-9
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Linear expected time of a simple union-find algorithmInformation Processing Letters, 1976
- Activity in an Interleaved MemoryIEEE Transactions on Computers, 1975
- Structure of the Random Graphs $\mathcal{G}_m (x|h)$Theory of Probability and Its Applications, 1973
- On the Probability of Connectedness of a Random Graph $\mathcal{G}_m (t)$Theory of Probability and Its Applications, 1970
- Combinatorial Algebra and Random GraphsTheory of Probability and Its Applications, 1969
- Random GraphsThe Annals of Mathematical Statistics, 1959
- The Expected Number of Components Under a Random Mapping FunctionThe American Mathematical Monthly, 1954