Some Completeness Results on Decision Trees and Group Testing

This publication has 19 references indexed in Scilit:

• Cutoff points for roll call protocols in multiple access systems
  IEEE Transactions on Information Theory, 1987
• On the number of queries necessary to identify a permutation
  Journal of Algorithms, 1986
• The Information-Theoretic Bound is Good for Merging
  SIAM Journal on Computing, 1984
• Three Versions of a Group Testing Game
  SIAM Journal on Algebraic Discrete Methods, 1984
• Hypergeometric and Generalized Hypergeometric Group Testing
  SIAM Journal on Algebraic Discrete Methods, 1981
• A Note on Sparse Complete Sets
  SIAM Journal on Computing, 1979
• A Combinatorial Problem Which Is Complete in Polynomial Space
  Journal of the ACM, 1976
• Optimal Binary Identification Procedures
  SIAM Journal on Applied Mathematics, 1972
• Determination of a Subset from Certain Combinatorial Properties
  Canadian Journal of Mathematics, 1966
• The Detection of Defective Members of Large Populations
  The Annals of Mathematical Statistics, 1943