A principle of independence for binary tree searching

DOI10.1007/BF00289612zbMATH Open0321.68030OpenAlexW2140092022MaRDI QIDQ1223161FDOQ1223161

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Randomized binary search technique

Cited In (3)

• Optimal binary search trees
• Randomly balanced binary trees
• Title not available (Why is that?)

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)