Pages that link to "Item:Q4840895"

The following pages link to Minimum average cost testing for partially ordered components (Q4840895):

Displaying 7 items.

• Improved approximation algorithms for the average-case tree searching problem (Q476452) (← links)
• Searching in random partially ordered sets (Q596140) (← links)
• An approximation algorithm for binary searching in trees (Q633849) (← links)
• On the complexity of searching in trees and partially ordered structures (Q650925) (← links)
• Edge ranking and searching in partial orders (Q955315) (← links)
• The binary identification problem for weighted trees (Q1758172) (← links)
• A strategy for searching with different access costs. (Q1853499) (← links)