Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Binary search networks: A new method for key searching

From MaRDI portal
Publication:1091827
Jump to:navigation, search

DOI10.1016/0020-0190(87)90199-2zbMath0623.68061OpenAlexW2016420340MaRDI QIDQ1091827

Mamoru Hoshi, Toshitsugu Yuba

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

optimizationVLSI architecturebinary search networkskey searchingtwo-dimensional mesh structures


Mathematics Subject Classification ID

Searching and sorting (68P10)


Related Items

Directed column-convex polyominoes by recurrence relations ⋮ The random generation of directed animals ⋮ Exactly Solved Models



Cites Work

  • Unnamed Item
  • Implicit data structures for fast search and update
  • Optimum Sequence Trees
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1091827&oldid=13119599"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 02:16.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki