Binary search networks: A new method for key searching

DOI10.1016/0020-0190(87)90199-2MaRDI QIDQ1091827zbMATH OpenOpenAlexFDO

Authors Toshitsugu Yuba, Mamoru Hoshi

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)90199-2

zbMATH Keywords

binary search networkskey searchingoptimizationtwo-dimensional mesh structuresVLSI architecture

Mathematics Subject Classification ID

Searching and sorting (68P10)

Review text

A novel method for key searching, binary search networks, is proposed, and its search, insertion, and deletion algorithms are presented. A binary search network is an extension of a binary search tree which is widely used as a practical key search method. Some properties of binary search networks are discussed, and the optimization problem of minimizing a search cost is remarked upon. The advantages and disadvantages of binary search networks relative to binary search trees are also discussed.

Recommendations

• Binary search in graphs revisited
• Binary search in graphs revisited
• Publication:3468604
• A high performance k-NN approach using binary neural networks
• scientific article; zbMATH DE number 7641049
• Two new bidirectional search algorithms
• A Binary Search with a Parallel Recovery of the Bits

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• Implicit data structures for fast search and update
• Optimum Sequence Trees

Cited in

(7)

• The random generation of directed animals
• Exactly solved models
• scientific article; zbMATH DE number 1322968 (Why is no real title available?)
• scientific article; zbMATH DE number 708859 (Why is no real title available?)
• Binary search tree with vine
• Directed column-convex polyominoes by recurrence relations
• Binary Coding of Hierarchical Structures

This page was built for publication: Binary search networks: A new method for key searching

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