The following pages link to (Q4857782):
Displaying 50 items.
- A universal bound for a covering in regular posets and its application to pool testing (Q1810653) (← links)
- Application of cover-free codes and combinatorial designs to two-stage testing. (Q1811089) (← links)
- Searching in trees (Q1827845) (← links)
- A group testing problem for hypergraphs of bounded rank (Q1917312) (← links)
- Strengthening hash families and compressive sensing (Q1932362) (← links)
- Comparing the strength of query types in property testing: the case of \(k\)-colorability (Q1947037) (← links)
- An NP-completeness result of edge search in graphs (Q2014718) (← links)
- On optimal randomized group testing with one defective item and a constrained number of positive responses (Q2019424) (← links)
- A recovery algorithm and pooling designs for one-stage noisy group testing under the probabilistic framework (Q2061995) (← links)
- Nested cover-free families for unbounded fault-tolerant aggregate signatures (Q2220866) (← links)
- Group testing problem with two defectives (Q2262985) (← links)
- Low-weight superimposed codes and related combinatorial structures: bounds and applications (Q2285161) (← links)
- Sampling schemes and recovery algorithms for functions of few coordinate variables (Q2307488) (← links)
- On separating systems with bounded set size (Q2309567) (← links)
- Pooling design and bias correction in DNA library screening (Q2320756) (← links)
- A class of asymptotically optimal group screening strategies with limited item participation (Q2334043) (← links)
- Truth tellers and liars with fewer questions (Q2342617) (← links)
- Locating modifications in signed data for partial data integrity (Q2348699) (← links)
- Quantum algorithms for learning symmetric juntas via the adversary bound (Q2351390) (← links)
- Applications of bulk queues to group testing models with incomplete identification (Q2370347) (← links)
- Efficiently correcting matrix products (Q2408920) (← links)
- Identifying defective sets using queries of small size (Q2411609) (← links)
- Steiner systems for two-stage disjunctive testing (Q2426657) (← links)
- On a hyperplane arrangement problem and tighter analysis of an error-tolerant pooling design (Q2426665) (← links)
- New combinatorial structures with applications to efficient group testing with inhibitors (Q2426666) (← links)
- Strict group testing and the set basis problem (Q2452424) (← links)
- Cyclic sequences of \(k\)-subsets with distinct consecutive unions (Q2468032) (← links)
- On error-tolerant DNA screening (Q2499595) (← links)
- Optimal search procedure on coin-weighing problem (Q2507901) (← links)
- Searching for a counterfeit coin with two unreliable weighings (Q2565856) (← links)
- An improved model-based method to test circuit faults (Q2566007) (← links)
- Improved bounds for group testing designs (Q2581815) (← links)
- An improved zig zag approach for competitive group testing (Q2691200) (← links)
- Disjoint spread systems and fault location (Q2830441) (← links)
- Efficiently Correcting Matrix Products (Q2942613) (← links)
- Combinatorial Group Testing for Corruption Localizing Hashing (Q3087984) (← links)
- Three-Dimensional Array-Based Group Testing Algorithms (Q3183239) (← links)
- Bounds for the Number of Tests in Non-adaptive Randomized Algorithms for Group Testing (Q3297759) (← links)
- Threshold Group Testing (Q3439262) (← links)
- Reconstructing Weighted Graphs with Minimal Query Complexity (Q3648745) (← links)
- On optimal superimposed codes (Q4458733) (← links)
- A General Framework for Estimation and Inference From Clusters of Features (Q4690957) (← links)
- Detecting Deficiencies: An Optimal Group Testing Algorithm (Q4692182) (← links)
- Superimposed Codes and Threshold Group Testing (Q4915254) (← links)
- New Construction of Error-Tolerant Pooling Designs (Q4915255) (← links)
- Density-Based Group Testing (Q4915256) (← links)
- Randomized Post-optimization for t-Restrictions (Q4915260) (← links)
- Search When the Lie Depends on the Target (Q4915262) (← links)
- Comparing the Strength of Query Types in Property Testing: The Case of Testing k-Colorability (Q4933375) (← links)
- Binary Search in Graphs Revisited (Q5111234) (← links)
