Searching in random partially ordered sets (extended abstract)

DOI10.1007/3-540-45995-2_27MaRDI QIDQ3044333zbMATH OpenFDO

Authors Yoshiharu Kohayakawa, Renato Carmo, Jair Donadelli, Eduardo S. Laber

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2286/22860278.htm

Mathematics Subject Classification ID

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

Recommendations

• Searching in random partially ordered sets
• Edge ranking and searching in partial orders
• Optimal Search in Trees
• Searching ordered structures
• Searching in Trees, Series-Parallel and Interval Orders

Cited in

(12)

• A lower bound for the complexity of information networks for one partial order relation
• Searching ordered structures
• Searching in 2-dimensional partial orders
• Optimal Search in Trees
• scientific article; zbMATH DE number 2101003 (Why is no real title available?)
• Searching for quicksand ideals in partially ordered sets
• Binary search in graphs revisited
• Searching in random partially ordered sets
• Edge and pair queries-random graphs and complexity
• Partial order multiway search
• On searching a table consistent with division poset
• Edge ranking and searching in partial orders

This page was built for publication: Searching in random partially ordered sets (extended abstract)

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