Optimal search in trees

SIAM Journal on Computing

Volumn 28, Issue 6, 1999, Pages 2090-2102

  Ben Asher, Yosi ^a   Farchi, Eitan ^b   Newman, Ilan ^a  

^a UNIVERSITY OF HAIFA   (Israel)

^b IBM HAIFA RESEARCH LAB   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; PROBLEM SOLVING; SET THEORY;

BINARY SEARCH; OPTIMAL SEARCH;

TREES (MATHEMATICS);

EID: 0033342277     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S009753979731858X     Document Type: Article

References (5)

1. B. BEIZER, Software Testing Techniques, Van Nostrand Reinhold, New York, 1990.
2. P. G. FRANKL AND E. J. WEYKER, Provable improvements on branch testing, IEEE Transaction on Software Engineering, 19 (1993), pp. 962-975.
3. J. R. HORGAN, S. LONDON, AND M. R. LYU, Achieving software quality with testing coverage measures, IEEE Trans. Comput., 27 (1994), pp. 60-69.
4. N. LINIAL AND M. SAKS, Every poset has a central element, J. Combin. Theory, 40 (1985), pp. 195-210.
5. N. LINIAL AND M. SAKS, Searching order structures, J. Algorithms, 6 (1985), pp. 86-103.