Searching in 2-dimensional partial orders

DOI10.1016/0196-6774(87)90029-0MaRDI QIDQ3783596zbMATH OpenOpenAlexFDO

Authors George Steiner

Publication date 1987

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

Full work available at URL https://doi.org/10.1016/0196-6774(87)90029-0

zbMATH Keywords

2-dimensional posetspolynomial timesearching

Mathematics Subject Classification ID

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

Recommendations

• Searching ordered structures
• On a 2-dimensional search problem
• Dimension versus size
• Searching for quicksand ideals in partially ordered sets
• scientific article; zbMATH DE number 2086235

Cited in

(15)

• Every poset has a central element
• Transitive closure for restricted classes of partial orders
• On a 2-dimensional search problem
• Finding specified sections of arrangements: 2D results
• Two-dimensional homing sort
• Understanding the generalized median stable matchings
• Cross-series-parallel digraphs
• On generalized comparison-based sorting problems
• Search in an Ordered Array Having Variable Probe Cost
• On complexity of maximizatin of submodular functions^*
• scientific article; zbMATH DE number 2101003 (Why is no real title available?)
• Searching for quicksand ideals in partially ordered sets
• Second-Order Behavior of Pattern Search
• Linearizing partial search orders
• On searching a table consistent with division poset

This page was built for publication: Searching in 2-dimensional partial orders

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