Jump interpolation search trees and symmetric binary numbers

DOI10.1016/0020-0190(87)90005-6zbMath0635.68064OpenAlexW2093980096MaRDI QIDQ1097702

B. George

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0020-0190(87)90005-6

zbMATH Keywords

search algorithmsdata structures for searchinginterpolation search treesnumber representations

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05)

Related Items (2)

On \(\alpha \)-greedy expansions of numbers ⋮ Parallel algorithms for power circuits and the word problem of the Baumslag group

Cites Work

• Understanding the complexity of interpolation search
• An algorithmic and complexity analysis of interpolation search
• Interpolation search—a log log N search
• Number Systems and Arithmetic
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Jump interpolation search trees and symmetric binary numbers