On the expected performance of path compression algorithms

Authors:
Andrew C. Yao
Affiliations:
Stanford Univ., Stanford, CA
Venue:
SIAM Journal on Computing
Year:
1985

Citing 0
Cited 2

The complexity of using forwarding addresses for decentralized object finding

PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Coping with Erroneous Information While Sorting

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract