Jump interpolation search trees and symmetric binary numbers

DOI10.1016/0020-0190(87)90005-6zbMATH Open0635.68064OpenAlexW2093980096MaRDI QIDQ1097702FDOQ1097702

Authors: 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

Recommendations

• scientific article; zbMATH DE number 1103060
• Binary jumbled pattern matching on trees and tree-like structures
• Binary jumbled pattern matching on trees and tree-like structures
• On the average profile of symmetric digital search trees
• External profile of symmetric digital search trees (extended abstract)
• scientific article; zbMATH DE number 2013191
• A new representation of binary search trees
• Interpolation-binary search
• The algebra of binary search trees
• Binary search trees of almost optimal height

zbMATH Keywords

search algorithmsdata structures for searchinginterpolation search treesnumber representations

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Interpolation search—a log log N search
• Understanding the complexity of interpolation search
• An algorithmic and complexity analysis of interpolation search
• Number Systems and Arithmetic
• Title not available (Why is that?)

Cited In (2)

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

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

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