Pages that link to "Item:Q596140"
From MaRDI portal
The following pages link to Searching in random partially ordered sets (Q596140):
Displaying 9 items.
- An approximation algorithm for binary searching in trees (Q633849) (← links)
- On the complexity of searching in trees and partially ordered structures (Q650925) (← links)
- On searching a table consistent with division poset (Q868956) (← links)
- Binary search in graphs revisited (Q1741841) (← links)
- On the Huffman and alphabetic tree problem with general cost functions (Q2249740) (← links)
- Approximating optimal binary decision trees (Q2428690) (← links)
- The complexity of bicriteria tree-depth (Q5918682) (← links)
- The complexity of bicriteria tree-depth (Q5925612) (← links)
- Theoretical Analysis of Git Bisect (Q6492083) (← links)
