Pages that link to "Item:Q3587405"
From MaRDI portal
The following pages link to On the Complexity of Searching in Trees: Average-Case Minimization (Q3587405):
Displaying 13 items.
- Improved approximation algorithms for the average-case tree searching problem (Q476452) (← links)
- Average time complexity of decision trees. (Q639456) (← links)
- Average-case analysis of best-first search in two representative directed acyclic graphs (Q814592) (← links)
- The binary identification problem for weighted trees (Q1758172) (← links)
- On the Huffman and alphabetic tree problem with general cost functions (Q2249740) (← links)
- Average-case analysis of quicksort and binary insertion tree height using incompressibility (Q2379940) (← links)
- Cost-error relationships in A* tree-searching (Q3474277) (← links)
- The average complexity of depth-first search with backtracking and cutoff (Q3776618) (← links)
- Average-Case Lower Bounds for Searching (Q3813304) (← links)
- Average Profile of the Generalized Digital Search Tree and the Generalized Lempel--Ziv Algorithm (Q4229414) (← links)
- (Q4515740) (← links)
- (Q4939662) (← links)
- Partial order multiway search (Q6535268) (← links)