A principle of independence for binary tree searching

DOI10.1007/BF00289612zbMath0321.68030OpenAlexW2140092022MaRDI QIDQ1223161

Leonidas J. 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)

Related Items (3)

Unnamed Item ⋮ Randomly balanced binary trees ⋮ Optimal binary search trees

Cites Work

• Unnamed Item
• Unnamed Item
• Randomized binary search technique

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