A principle of independence for binary tree searching

DOI10.1007/BF00289612MaRDI QIDQ1223161zbMATH OpenOpenAlexFDO

Authors Leonidas Guibas

Publication date 1975

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00289612

Mathematics Subject Classification ID

Algorithms in computer science (68W99)

Cites work

• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Randomized binary search technique

Cited in

(3)

• Randomly balanced binary trees
• scientific article; zbMATH DE number 3536107 (Why is no real title available?)
• Optimal binary search trees

This page was built for publication: A principle of independence for binary tree searching

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