Title of article
OPTIMAL SEARCH IN TREES
Author/Authors
BEN-ASHER، YOSI نويسنده , , FARCHI، EITAN نويسنده , , NEWMAN، ILAN نويسنده ,
Issue Information
دوماهنامه با شماره پیاپی سال 1999
Pages
-208
From page
209
To page
0
Abstract
An associative block design is a certain balanced partition of a hypercube into smaller hypercubes. We construct such a design, thus settling the smallest open case.
Keywords
optimal search , search in trees , binary search , search in graphs , posets
Journal title
SIAM Journal on Computing
Serial Year
1999
Journal title
SIAM Journal on Computing
Record number
16632
Link To Document