Amanote Research

Amanote Research

    RegisterSign In

Group Testing Algorithms: Bounds and Simulations

IEEE Transactions on Information Theory - United States
doi 10.1109/tit.2014.2314472
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
Date

June 1, 2014

Authors
Matthew AldridgeLeonardo BaldassiniOliver Johnson
Publisher

Institute of Electrical and Electronics Engineers (IEEE)


Related search

Three-Dimensional Array-Based Group Testing Algorithms

Biometrics
StatisticsGeneticsProbabilityMolecular BiologyBiochemistryApplied MathematicsMicrobiology ImmunologyBiological SciencesMedicineAgricultural
2008English

Hexagonal Grid Drawings: Algorithms and Lower Bounds

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds

2020English

Efficient Algorithms and Lower Bounds for Robust Linear Regression

2019English

Quantum Algorithms for Fluid Simulations

2020English

Tight Approximation Bounds for Greedy Frugal Coverage Algorithms

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

The XL-mHG Test for Enrichment: Algorithms, Bounds, and Power

2016English

Property Testing Lower Bounds via Communication Complexity

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2012English

Nearly Tight Bounds for Testing Function Isomorphism

2011English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy