Group testing: an information theory perspective
暂无分享,去创建一个
[1] Sidharth Jaggi,et al. Nearly optimal sparse group testing , 2016, 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[2] Chou Hsiung Li. A Sequential Method for Screening Experimental Variables , 1962 .
[3] Peter Damaschke,et al. Randomized Group Testing Both Query-Optimal and Minimal Adaptive , 2012, SOFSEM.
[4] Nader H. Bshouty. Lower Bound for Non-Adaptive Estimate the Number of Defective Items , 2018, Electron. Colloquium Comput. Complex..
[5] Martin Aigner. Search problems on graphs , 1986, Discret. Appl. Math..
[6] Jonathan Scarlett,et al. Noisy Adaptive Group Testing: Bounds and Algorithms , 2018, IEEE Transactions on Information Theory.
[7] Volkan Cevher,et al. How little does non-exact recovery help in group testing? , 2017, 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).
[9] M. O’Donovan,et al. DNA Pooling: a tool for large-scale association studies , 2002, Nature Reviews Genetics.
[10] R. Vershynin,et al. One sketch for all: fast algorithms for compressed sensing , 2007, STOC '07.
[11] Tadashi Wadayama,et al. Comments on “Nonadaptive Group Testing Based on Sparse Pooling Graphs” , 2018, IEEE Transactions on Information Theory.
[12] Hiroki Koga,et al. Information-Spectrum Methods in Information Theory , 2002 .
[13] Matthew Aldridge. On the optimality of some group testing algorithms , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).
[14] Volkan Cevher,et al. Phase Transitions in the Pooled Data Problem , 2017, NIPS.
[15] Siraj A. Khan,et al. Detection of West Nile virus in six mosquito species in synchrony with seroconversion among sentinel chickens in India , 2017, Parasites & Vectors.
[16] Enrique Mallada,et al. Recent results on sparse recovery over graphs , 2011, 2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR).
[17] Teddy Furon. The illusion of group testing , 2018 .
[18] Keith H. Thompson,et al. Estimation of the Proportion of Vectors in a Natural Population of Insects , 1962 .
[19] Frank E. Grubbs,et al. An Introduction to Probability Theory and Its Applications , 1951 .
[20] Arkadii G. D'yachkov,et al. Lectures on Designing Screening Experiments , 2014, ArXiv.
[21] Sampath Kannan,et al. Group testing problems with sequences in experimental molecular biology , 1997, Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171).
[22] Frank K. Hwang,et al. A survey on nonadaptive group testing algorithms through the angle of decoding , 2008, J. Comb. Optim..
[23] M. Tsfasman,et al. Modular curves, Shimura curves, and Goppa codes, better than Varshamov‐Gilbert bound , 1982 .
[24] Volkan Cevher,et al. Phase Transitions in Group Testing , 2016, SODA.
[25] Claude E. Shannon,et al. The zero error capacity of a noisy channel , 1956, IRE Trans. Inf. Theory.
[26] Muriel Médard,et al. Blind Group Testing , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).
[27] F. K. Hwang,et al. A Boundary Problem for Group Testing , 1981 .
[28] Volkan Cevher,et al. Converse bounds for noisy group testing with arbitrary measurement matrices , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).
[29] János Komlós,et al. An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels , 1985, IEEE Trans. Inf. Theory.
[30] Teddy Furon,et al. Decoding fingerprints using the Markov Chain Monte Carlo method , 2012, 2012 IEEE International Workshop on Information Forensics and Security (WIFS).
[31] Peter Damaschke,et al. Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity , 2010, Discret. Math. Algorithms Appl..
[32] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[33] Kannan Ramchandran,et al. SAFFRON: A fast, efficient, and robust framework for group testing based on sparse-graph codes , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).
[34] Matthew Aldridge,et al. Almost separable matrices , 2017, J. Comb. Optim..
[35] Volkan Cevher,et al. Limits on Support Recovery With Probabilistic Models: An Information-Theoretic Framework , 2015, IEEE Transactions on Information Theory.
[36] Kush R. Varshney,et al. Exact Rule Learning via Boolean Compressed Sensing , 2013, ICML.
[37] Mahdi Cheraghchi,et al. Noise-resilient group testing: Limitations and constructions , 2008, Discret. Appl. Math..
[38] Nader H. Bshouty,et al. On Learning Graphs with Edge-Detecting Queries , 2018, ALT.
[39] V. Saligrama,et al. On Throughput Maximization and Interference Avoidance in Cognitive Radios , 2008, 2008 5th IEEE Consumer Communications and Networking Conference.
[40] Joel A. Tropp,et al. Algorithmic linear dimension reduction in the l_1 norm for sparse vectors , 2006, ArXiv.
[41] Rüdiger L. Urbanke,et al. Modern Coding Theory , 2008 .
[42] Frank K. Hwang,et al. A Group Testing Problem on Two Disjoint Sets , 1981 .
[43] Andrew B. Kahng,et al. New and improved BIST diagnosis methods from combinatorial Group testing theory , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[44] Mikhail J. Atallah,et al. Indexing Information for Data Forensics , 2005, ACNS.
[45] Dino Sejdinovic,et al. Note on noisy group testing: Asymptotic bounds and belief propagation reconstruction , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[46] Frank K. Hwang,et al. Isolating a Single Defective Using Group Testing , 1974 .
[47] Amin Coja-Oghlan,et al. Information-Theoretic and Algorithmic Thresholds for Group Testing , 2019, IEEE Transactions on Information Theory.
[48] Arkadii G. D'yachkov,et al. A survey of superimposed code theory , 1983 .
[49] Kannan Ramchandran,et al. Sub-linear time compressed sensing using sparse-graph codes , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).
[50] Ely Porat,et al. Pattern matching with don't cares and few errors , 2010, J. Comput. Syst. Sci..
[51] Volkan Cevher,et al. Near-Optimal Noisy Group Testing via Separate Decoding of Items , 2017, IEEE Journal of Selected Topics in Signal Processing.
[52] Yonggang Wen,et al. Non-Adaptive Fault Diagnosis for All-Optical Networks via Combinatorial Group Testing on Graphs , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.
[53] Toby Berger,et al. Asymptotic efficiency of two-stage disjunctive testing , 2002, IEEE Trans. Inf. Theory.
[54] Nader H. Bshouty,et al. Optimal Algorithms for the Coin Weighing Problem with a Spring Scale , 2009, COLT.
[55] Alexander Schliep,et al. Interpretation of Pooling Experiments Using the Markov Chain Monte Carlo Method , 1996, J. Comput. Biol..
[56] Ayfer Özgür,et al. On the Optimality of the Kautz-Singleton Construction in Probabilistic Group Testing , 2018, 2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[57] D. Du,et al. Combinatorial Group Testing and Its Applications , 1993 .
[58] George Atia,et al. Boolean Compressed Sensing and Noisy Group Testing , 2009, IEEE Transactions on Information Theory.
[59] Atri Rudra,et al. Recovering simple signals , 2012, 2012 Information Theory and Applications Workshop.
[60] Aleksandrs Belovs,et al. Quantum Algorithms for Learning Symmetric Juntas via the Adversary Bound , 2013, 2014 IEEE 29th Conference on Computational Complexity (CCC).
[61] Paul Erdgs,et al. ON TWO PROBLEMS OF INFORMATION THEORY bY PAUL ERDGS and ALFRJ~D RgNYI , 2001 .
[62] Mingyan Liu,et al. Efficient Sensor Fault Detection Using Combinatorial Group Testing , 2013, 2013 IEEE International Conference on Distributed Computing in Sensor Systems.
[63] Jonathan Scarlett,et al. An Efficient Algorithm for Capacity-Approaching Noisy Adaptive Group Testing , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).
[64] Amin Coja-Oghlan,et al. Optimal non-adaptive group testing , 2019, ArXiv.
[65] Milton Sobel,et al. FINITE AND INFINITE MODELS FOR GENERALIZED GROUP-TESTING WITH UNEQUAL PROBABILITIES OF SUCCESS FOR EACH ITEM* , 1973 .
[66] Atri Rudra,et al. Biological screens from linear codes: theory and tools , 2015, bioRxiv.
[67] Burton H. Bloom,et al. Space/time trade-offs in hash coding with allowable errors , 1970, CACM.
[68] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
[69] Mahesh K. Varanasi,et al. Group detection for synchronous Gaussian code-division multiple-access channels , 1995, IEEE Trans. Inf. Theory.
[70] V. L. Freidlina. On a Design Problem for Screening Experiments , 1975 .
[71] P. Erd6s. ON A CLASSICAL PROBLEM OF PROBABILITY THEORY b , 2001 .
[72] Ugo Vaccaro,et al. $\epsilon $ -Almost Selectors and Their Applications to Multiple-Access Communication , 2017, IEEE Transactions on Information Theory.
[73] H. M. Finucan. The Blood Testing Problem , 1964 .
[74] Tom Madej,et al. An application of group testing to the file comparison problem , 1989, [1989] Proceedings. The 9th International Conference on Distributed Computing Systems.
[75] Peter Damaschke. Adaptive group testing with a constrained number of positive responses improved , 2016, Discret. Appl. Math..
[76] A.C. Gilbert,et al. Group testing and sparse signal recovery , 2008, 2008 42nd Asilomar Conference on Signals, Systems and Computers.
[77] M. Sobel,et al. Group testing to eliminate efficiently all defectives in a binomial sample , 1959 .
[78] David J. C. MacKay,et al. Information Theory, Inference, and Learning Algorithms , 2004, IEEE Transactions on Information Theory.
[79] Venkatesh Saligrama,et al. Learning immune-defectives graph through group tests , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).
[80] Sidharth Jaggi,et al. Non-adaptive group testing with inhibitors , 2014, 2015 IEEE Information Theory Workshop (ITW).
[81] Shuangqing Wei,et al. Achievable partition information rate over noisy multi-access Boolean channel , 2014, 2014 IEEE International Symposium on Information Theory.
[82] Marcello Pagano,et al. On the informativeness and accuracy of pooled testing in estimating prevalence of a rare disease: Application to HIV screening , 1995 .
[83] Annalisa De Bonis,et al. Optimal Two-Stage Algorithms for Group Testing Problems , 2005, SIAM J. Comput..
[84] Sidharth Jaggi,et al. Novel Impossibility Results for Group-Testing , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).
[85] L. Goddard. Information Theory , 1962, Nature.
[86] Annalisa De Bonis,et al. Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels , 2003, Theor. Comput. Sci..
[87] C. Ignacio,et al. Pooled Nucleic Acid Testing to Detect Antiretroviral Treatment Failure in HIV-Infected Patients in Mozambique , 2015, Journal of acquired immune deficiency syndromes.
[88] Richard C. Singleton,et al. Nonrandom binary superimposed codes , 1964, IEEE Trans. Inf. Theory.
[89] Thijs Laarhoven,et al. Asymptotics of Fingerprinting and Group Testing: Tight Bounds From Channel Capacities , 2014, IEEE Transactions on Information Forensics and Security.
[90] Frank K. Hwang,et al. Exploring the missing link among d-separable, d_-separable and d-disjunct matrices , 2007, Discret. Appl. Math..
[91] Shuangqing Wei,et al. Partition Information and its Transmission Over Boolean Multi-Access Channels , 2014, IEEE Transactions on Information Theory.
[92] Andrew P Morris,et al. Pooling DNA in the identification of parents , 1998, Heredity.
[93] Tadashi Wadayama. Nonadaptive Group Testing Based on Sparse Pooling Graphs , 2017, IEEE Transactions on Information Theory.
[94] Donald F. Towsley,et al. Random Multiple-Access Communication and Group Testing , 1984, IEEE Trans. Commun..
[95] Wenyi Zhang,et al. On OR many-access channels , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).
[96] A. Sterrett. On the Detection of Defective Members of Large Populations , 1957 .
[97] Holger Rauhut,et al. A Mathematical Introduction to Compressive Sensing , 2013, Applied and Numerical Harmonic Analysis.
[98] Oliver Johnson,et al. Strong Converses for Group Testing From Finite Blocklength Results , 2015, IEEE Transactions on Information Theory.
[99] Man Lung Yiu,et al. Identifying the Most Connected Vertices in Hidden Bipartite Graphs Using Group Testing , 2013, IEEE Transactions on Knowledge and Data Engineering.
[100] Nader H. Bshouty,et al. Adaptive Group Testing Algorithms to Estimate the Number of Defectives , 2018, ALT.
[101] Galen Reeves,et al. Understanding Phase Transitions via Mutual Information and MMSE , 2019, Information-Theoretic Methods in Data Science.
[102] Ely Porat,et al. Search Methodologies , 2022 .
[103] Mahdi Cheraghchi,et al. Derandomization and group testing , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[104] Andreas Allemann. An Efficient Algorithm for Combinatorial Group Testing , 2013, Information Theory, Combinatorics, and Search Theory.
[105] Alon Orlitsky,et al. Estimating the number of defectives with group testing , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).
[106] F. Hwang. A Method for Detecting all Defective Members in a Population by Group Testing , 1972 .
[107] Petra Johann. A group testing problem for graphs with several defective edges , 2002, Discret. Appl. Math..
[108] Dmitry M. Malioutov,et al. Boolean compressed sensing: LP relaxation for group testing , 2012, 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).
[109] Milton Sobel,et al. Group testing with a new goal, estimation , 1975 .
[110] Matthew Aldridge,et al. The Capacity of Bernoulli Nonadaptive Group Testing , 2015, IEEE Transactions on Information Theory.
[111] Jun Luo,et al. Neighbor discovery in wireless ad hoc networks based on group testing , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.
[112] A. Macula. Probabilistic nonadaptive group testing in the presence of errors and DNA library screening , 1999 .
[113] Anthony J. Macula,et al. Probabilistic Nonadaptive and Two-Stage Group Testing with Relatively Small Pools and DNA Library Screening , 1998, J. Comb. Optim..
[114] Feller William,et al. An Introduction To Probability Theory And Its Applications , 1950 .
[115] Sidharth Jaggi,et al. Non-Adaptive Group Testing: Explicit Bounds and Novel Algorithms , 2014, IEEE Trans. Inf. Theory.
[116] B. Harshbarger. An Introduction to Probability Theory and its Applications, Volume I , 1958 .
[117] Amiel Feinstein,et al. A new basic theorem of information theory , 1954, Trans. IRE Prof. Group Inf. Theory.
[118] Peter Damaschke,et al. Optimal group testing algorithms with interval queries and their application to splice site detection , 2005, Int. J. Bioinform. Res. Appl..
[119] Seth Copen Goldstein,et al. Molecular electronics: from devices and interconnect to circuits and architecture , 2003, Proc. IEEE.
[120] Emanuel Knill,et al. A Comparative Survey of Non-Adaptive Pooling Designs , 1996 .
[121] Charles Coutelle,et al. A pooling strategy for heterozygote screening of the ΔF508 cystic fibrosis mutation , 2004, Human Genetics.
[122] Binbin Chen,et al. Sublinear-Time Non-Adaptive Group Testing With O(k log n) Tests via Bit-Mixing Coding , 2019, IEEE Transactions on Information Theory.
[123] Richard E. Ladner,et al. Group testing for image compression , 2000, Proceedings DCC 2000. Data Compression Conference.
[124] Venkatesh Saligrama,et al. Non-adaptive probabilistic group testing with noisy measurements: Near-optimal bounds with efficient algorithms , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[125] Amin Karbasi,et al. Graph-Constrained Group Testing , 2010, IEEE Transactions on Information Theory.
[126] Milton Sobel,et al. Binomial Group-Testing With an Unknown Proportion of Defectives* , 1966 .
[127] Oliver Johnson,et al. Noisy Non-Adaptive Group Testing: A (Near-)Definite Defectives Approach , 2018, IEEE Transactions on Information Theory.
[128] E. Edwards.. Communication theory. , 1967, Ergonomics.
[129] Nader H. Bshouty,et al. Exact Learning of Juntas from Membership Queries , 2017, ALT.
[130] Alexander Schliep,et al. Group testing with DNA chips: generating designs and decoding experiments , 2003, Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003.
[131] Kush R. Varshney,et al. Learning Interpretable Classification Rules with Boolean Compressed Sensing , 2017 .
[132] Imre Csiszár,et al. Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .
[133] Andris Ambainis,et al. Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing , 2015, SODA.
[134] Jack K. Wolf,et al. Born again group testing: Multiaccess communications , 1985, IEEE Trans. Inf. Theory.
[135] Mayank Bakshi,et al. Efficient Algorithms for Noisy Group Testing , 2017, IEEE Transactions on Information Theory.
[136] Marc Mézard,et al. Group Testing With Random Pools: Optimal Two-Stage Algorithms , 2007, IEEE Transactions on Information Theory.
[137] H. Vincent Poor,et al. Channel Coding Rate in the Finite Blocklength Regime , 2010, IEEE Transactions on Information Theory.
[138] Ronald L. Rivest,et al. Introduction to Algorithms, 3rd Edition , 2009 .
[139] Michael Brand,et al. Compressed Genotyping , 2009, IEEE Transactions on Information Theory.
[140] Zoltán Füredi. On r-Cover-free Families , 1996, J. Comb. Theory, Ser. A.
[141] Piotr Indyk,et al. Deterministic superimposed coding with applications to pattern matching , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[142] D. Du,et al. Pooling Designs And Nonadaptive Group Testing: Important Tools For Dna Sequencing , 2006 .
[143] A. Sebő. ON TWO RANDOM SEARCH PROBLEMS , 1985 .
[144] Jonathan Scarlett,et al. Learning Erdős-Rényi Random Graphs via Edge Detecting Queries , 2019, NeurIPS.
[145] Yongxi Cheng. An efficient randomized group testing procedure to determine the number of defectives , 2011, Oper. Res. Lett..
[146] Mikhail B. Malyutov,et al. Search for Sparse Active Inputs: A Review , 2013, Information Theory, Combinatorics, and Search Theory.
[147] Taieb Znati,et al. Detecting Application Denial-of-Service Attacks: A Group-Testing-Based Approach , 2010, IEEE Transactions on Parallel and Distributed Systems.
[148] Cem Aksoylar,et al. Correction to “Boolean Compressed Sensing and Noisy Group Testing” [Mar 12 1880-1901] , 2015, IEEE Transactions on Information Theory.
[149] Mahdi Cheraghchi,et al. Improved Constructions for Non-adaptive Threshold Group Testing , 2010, Algorithmica.
[150] M. Malyutov,et al. Maximization of ESI. Jaynes principle in testing significant inputs of linear model , 1998 .
[151] Matthew Aldridge,et al. Rates of Adaptive Group Testing in the Linear Regime , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).
[152] W. Swallow,et al. Using group testing to estimate a proportion, and to test the binomial model. , 1990, Biometrics.
[153] Gennian Ge,et al. New Bounds on the Number of Tests for Disjunct Matrices , 2015, IEEE Transactions on Information Theory.
[154] M. Malyutov. The separating property of random matrices , 1978 .
[155] Eric Blais. Testing Juntas: A Brief Survey , 2010, Property Testing.
[156] Rocco A. Servedio,et al. Quantum Algorithms for Learning and Testing Juntas , 2007, Quantum Inf. Process..
[157] Rami G. Melhem,et al. Live Baiting for Service-Level DoS Attackers , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.
[158] S D Walter,et al. Estimation of infection rates in population of organisms using pools of variable size. , 1980, American journal of epidemiology.
[159] Robert J. Piechocki,et al. The capacity of non-identical adaptive group testing , 2014, 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[160] Ryan O'Donnell,et al. Learning functions of k relevant variables , 2004, J. Comput. Syst. Sci..
[161] Michael T. Goodrich,et al. Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis , 2009, J. Comb. Optim..
[162] Colin McDiarmid,et al. Surveys in Combinatorics, 1989: On the method of bounded differences , 1989 .
[163] Zaher Dawy,et al. Designing Pooling Systems for Noisy High-Throughput Protein-Protein Interaction Experiments Using Boolean Compressed Sensing , 2013, IEEE/ACM Transactions on Computational Biology and Bioinformatics.
[164] Anthony J. Macula,et al. A group testing method for finding patterns in data , 2004, Discret. Appl. Math..
[165] T R Unnasch,et al. Determining the prevalence of Onchocerca volvulus infection in vector populations by polymerase chain reaction screening of pools of black flies. , 1995, The Journal of infectious diseases.
[166] A. Scaglione,et al. Group testing for sensor networks: the value of asking the right questions , 2004, Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004..
[167] Chao Wang,et al. Optimal Nested Test Plan for Combinatorial Quantitative Group Testing , 2014, IEEE Transactions on Signal Processing.
[168] Olgica Milenkovic,et al. Poisson group testing: A probabilistic model for nonadaptive streaming boolean compressed sensing , 2014, 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).
[169] Dominik Kaaser,et al. Quantitative Group Testing in the Sublinear Regime , 2019, ArXiv.
[170] Matthew Aldridge,et al. Performance of Group Testing Algorithms With Near-Constant Tests Per Item , 2016, IEEE Transactions on Information Theory.
[171] M. Mézard,et al. Group Testing with Random Pools: Phase Transitions and Optimal Strategy , 2007, 0711.2242.
[172] Raghunandan M Kainkaryam,et al. Pooling in high-throughput drug screening. , 2009, Current opinion in drug discovery & development.
[173] Gyula Katona,et al. Combinatorial Search Problems , 1972, International Centre for Mechanical Sciences.
[174] Frank K. Hwang,et al. A Generalized Binomial Group Testing Problem , 1975 .
[175] Matthew Aldridge,et al. Group Testing Algorithms: Bounds and Simulations , 2013, IEEE Transactions on Information Theory.
[176] Kush R. Varshney,et al. A Semiquantitative Group Testing Approach for Learning Interpretable Clinical Prediction Rules , 2015 .
[177] Atri Rudra,et al. Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications - (Extended Abstract) , 2011, ICALP.
[178] Hervé Jégou,et al. A Group Testing Framework for Similarity Search in High-dimensional Spaces , 2014, ACM Multimedia.
[179] Matthew Aldridge,et al. Individual Testing Is Optimal for Nonadaptive Group Testing in the Linear Regime , 2018, IEEE Transactions on Information Theory.
[180] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.
[181] Annalisa De Bonis,et al. Improved Algorithms for Group Testing with Inhibitors , 1998, Inf. Process. Lett..
[182] Peter Damaschke,et al. Bounds for Nonadaptive Group Tests to Estimate the Amount of Defectives , 2010, COCOA.
[183] Graham Cormode,et al. What's hot and what's not: tracking most frequent items dynamically , 2003, PODS '03.
[184] Kin K. Leung,et al. Node Failure Localization via Network Tomography , 2014, Internet Measurement Conference.
[185] Mikhail Malyutov,et al. Planning of screening experiments for a nonsymmetric response function , 1980 .
[186] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[187] Chandra R. Murthy,et al. Group Testing-Based Spectrum Hole Search for Cognitive Radios , 2014, IEEE Transactions on Vehicular Technology.
[188] Daniel A. Spielman,et al. Linear-time encodable and decodable error-correcting codes , 1995, STOC '95.
[189] Peter Damaschke. Threshold Group Testing , 2005, Electron. Notes Discret. Math..
[190] J. Hayes,et al. An Adaptive Technique for Local Distribution , 1978, IEEE Trans. Commun..
[191] Wenhao Huang,et al. Group testing with prior statistics , 2014, 2014 IEEE International Symposium on Information Theory.
[192] Cem Aksoylar,et al. Sparse Signal Processing With Linear and Nonlinear Observations: A Unified Shannon-Theoretic Approach , 2017, IEEE Trans. Inf. Theory.
[193] William H. Swallow,et al. Group testing for estimating infection rates and probabilities of disease transmission , 1985 .
[194] Joseph L. Gastwirth,et al. Estimation of the prevalence of a rare disease, preserving the anonymity of the subjects by group testing: application to estimating the prevalence of aids antibodies in blood donors , 1989 .
[195] Matthew Aldridge. Interference Mitigation in Large Random Wireless Networks , 2011, ArXiv.
[196] Claude E. Shannon,et al. Certain Results in Coding Theory for Noisy Channels , 1957, Inf. Control..
[197] Atri Rudra,et al. Efficiently decodable non-adaptive group testing , 2010, SODA '10.
[198] Olgica Milenkovic,et al. Semiquantitative Group Testing , 2014, IEEE Transactions on Information Theory.
[199] Nicholas Pippenger,et al. ASYMPTOTIC ANALYSIS OF OPTIMAL NESTED GROUP-TESTING PROCEDURES , 2016, Probability in the Engineering and Informational Sciences.
[200] Ingo Wegener,et al. On the Cut-off Point for Combinatorial Group Testing , 1999, Discret. Appl. Math..
[201] Pierre Moulin,et al. Universal fingerprinting: Capacity and random-coding exponents , 2008, 2008 IEEE International Symposium on Information Theory.
[202] Vasek Chvátal,et al. A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..
[203] Miklós Ruszinkó,et al. On the upper bound of the size of the r -cover-free families , 1994 .
[204] N. Shental,et al. Identification of rare alleles and their carriers using compressed se(que)nsing , 2010, Nucleic acids research.
[205] Eberhard Triesch,et al. Searching for an edge in a graph , 1988, J. Graph Theory.
[206] Matthew Aldridge,et al. The capacity of adaptive group testing , 2013, 2013 IEEE International Symposium on Information Theory.
[207] Arya Mazumdar,et al. Nonadaptive Group Testing With Random Set of Defectives , 2015, IEEE Transactions on Information Theory.