Skip to main content
SpringerLink
Log in

Efficient Decodable Group Testing

  • Reference work entry
  • First Online:
Book cover Encyclopedia of Algorithms

  • 81 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Cheraghchi M (2013) Noise-resilient group testing: Limitations and constructions. Discret Appl Math 161(1–2):81–95

    Article  MathSciNet  MATH  Google Scholar 

  2. Cormode G, Muthukrishnan S (2005) What’s hot and what’s not: tracking most frequent items dynamically. ACM Trans Database Syst 30(1):249–278

    Article  MathSciNet  Google Scholar 

  3. Dorfman R (1943) The detection of defective members of large populations. Ann Math Stat 14(4):436–440

    Article  Google Scholar 

  4. Du DZ, Hwang FK (2000) Combinatorial group testing and its applications. Series on applied mathematics, vol 12, 2nd edn. World Scientific, River Edge

    Google Scholar 

  5. D’yachkov AG, Rykov VV (1982) Bounds on the length of disjunctive codes. Problemy Peredachi Informatsii 18(3):7–13

    MathSciNet  MATH  Google Scholar 

  6. Guruswami V (2004) List decoding of error-correcting codes (Winning thesis of the 2002 ACM doctoral dissertation competition). Lecture notes in computer science, vol 3282. Springer

    Google Scholar 

  7. Indyk P, Ngo HQ, Rudra A (2010) Efficiently decodable non-adaptive group testing. In: Proceedings of the twenty first annual ACM-SIAM symposium on discrete algorithms (SODA’2010). ACM, New York, pp 1126–1142

    Chapter  Google Scholar 

  8. Muthukrishnan S (2005) Data streams: algorithms and applications. Found Trends Theor Comput Sci 1(2)

    Google Scholar 

  9. Ngo HQ, Du DZ (2000) A survey on combinatorial group testing algorithms with applications to DNA library screening. In: Discrete mathematical problems with medical applications (New Brunswick, 1999). DIMACS series in discrete mathematics and theoretical computer science, vol 55. American Mathematical Society, Providence, pp 171–182

    Google Scholar 

  10. Ngo HQ, Porat E, Rudra A (2011) Efficiently decodable error-correcting list disjunct matrices and applications – (extended abstract). In: ICALP (1), pp 557–568

    MathSciNet  MATH  Google Scholar 

  11. Porat E, Rothschild A (2011) Explicit nonadaptive combinatorial group testing schemes. IEEE Trans Inf Theory 57(12):7982–7989

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science and Engineering, The State University of New York, 338 Davis Hall, 14260-2500, Buffalo, NY, USA

    Hung Q. Ngo

  2. Department of Computer Science and Engineering, State University of New York, Buffalo, NY, USA

    Atri Rudra

Authors
  1. Hung Q. Ngo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Atri Rudra
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Hung Q. Ngo or Atri Rudra .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Ngo, H.Q., Rudra, A. (2016). Efficient Decodable Group Testing. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_613

Download citation

Publish with us

Policies and ethics

Search

Navigation