Linear expected time of a simple union-find algorithm

DOI10.1016/0020-0190(76)90061-2MaRDI QIDQ1233316zbMATH OpenOpenAlexFDO

Authors Jon Doyle, Ronald L. Rivest

Publication date 1976

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(76)90061-2

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Cites work

• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3569817 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Efficiency of a Good But Not Linear Set Union Algorithm

Cited in

(5)

• Applications of the theory of records in the study of random trees
• A linear-time algorithm for a special case of disjoint set union
• Note on the heights of random recursive trees and random m‐ary search trees
• The expected linearity of a simple equivalence algorithm
• A class of algorithms which require nonlinear time to maintain disjoint sets

This page was built for publication: Linear expected time of a simple union-find algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1233316)