On the Complexity of Searching in Trees: Average-Case Minimization
Authors:
- 1 January 2010
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 527-539
Abstract
No abstract availableKeywords
All Related Versions
This publication has 21 references indexed in Scilit:
- Sorting and Selection in Posets2009
- Approximating Optimal Binary Decision Trees2008
- Edge ranking and searching in partial ordersDiscrete Applied Mathematics, 2008
- Decision trees for entity identification2007
- Searching in random partially ordered setsTheoretical Computer Science, 2004
- Optimal Search in TreesSIAM Journal on Computing, 1999
- Decision Trees for Geometric ModelsInternational Journal of Computational Geometry & Applications, 1998
- Optimal edge ranking of trees in polynomial timeAlgorithmica, 1995
- A New Algorithm for Minimum Cost Binary TreesSIAM Journal on Computing, 1977
- Optimal Binary Identification ProceduresSIAM Journal on Applied Mathematics, 1972