Searching ordered structures

DOI10.1016/0196-6774(85)90020-3zbMath0578.68050OpenAlexW1996384709MaRDI QIDQ3700849

Nathan Linial, Michael E. Saks

Publication date: 1985

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(85)90020-3

zbMATH Keywords

chainspartially ordered setcubematrixworst case complexitymergingnumber of comparisonssorted lists

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (18)

On complexity of maximizatin of submodular functions^* ⋮ On the tree search problem with non-uniform costs ⋮ On searching a table consistent with division poset ⋮ Searching in random partially ordered sets ⋮ On the optimality of tape merge of two lists with similar size ⋮ Searching rigid data structures ⋮ On the complexity of searching in trees and partially ordered structures ⋮ COMPACT REPRESENTATIONS OF SEARCH IN COMPLEX DOMAINS ⋮ COMPACT REPRESENTATIONS OF SEARCH IN COMPLEX DOMAINS ⋮ Improved approximation algorithms for the average-case tree searching problem ⋮ Binary search in graphs revisited ⋮ Edge ranking and searching in partial orders ⋮ Parallel searching of multidimensional cubes ⋮ Searching monotone multi-dimensional arrays ⋮ Binary search with delayed and missing answers ⋮ On the Tree Search Problem with Non-uniform Costs ⋮ Binary Search in Graphs Revisited ⋮ Every poset has a central element

This page was built for publication: Searching ordered structures