The following pages link to On two random search problems (Q1058449):
Displaying 12 items.
- Almost separable matrices (Q512882) (← links)
- On randomizing two derandomized greedy algorithms (Q547862) (← links)
- Ratewise-optimal non-sequential search strategies under constraints on the tests (Q947084) (← links)
- A non-adaptive search algorithm that identifies up to three defects (Q1361624) (← links)
- Nonadaptive search problem with sets of equal sum (Q1407191) (← links)
- On some problems of guaranteed search (Q1922654) (← links)
- Bounds for the Number of Tests in Non-adaptive Randomized Algorithms for Group Testing (Q3297759) (← links)
- (Q3716855) (← links)
- Search problems. Transl. from the German by Jean E. Wotschke (Q3792452) (← links)
- (Q4777205) (← links)
- Decoding from Pooled Data: Sharp Information-Theoretic Bounds (Q5025779) (← links)
- (Q5685987) (← links)