✦ LIBER ✦

Optimal Two-Stage Algorithms for Group Testing Problems

✍ Scribed by De Bonis, Annalisa; Gasieniec, Leszek; Vaccaro, Ugo

Book ID: 118181243
Publisher: Society for Industrial and Applied Mathematics
Year: 2005
Tongue: English
Weight: 210 KB
Volume: 34
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s0097539703428002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Group Testing With Random Pools: Optimal

Group Testing With Random Pools: Optimal Two-Stage Algorithms

✍ Mézard, M.; Toninelli, C. 📂 Article 📅 2011 🏛 IEEE 🌐 English ⚖ 270 KB

Optimal Algorithms for Two Group Testing

Optimal Algorithms for Two Group Testing Problems, and New Bounds on Generalized Superimposed Codes

✍ De Bonis, A.; Vaccaro, U. 📂 Article 📅 2006 🏛 IEEE 🌐 English ⚖ 388 KB

On optimal nested group testing algorith

On optimal nested group testing algorithms

✍ Y.C. Yao; F.K. Hwang 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 557 KB

Algorithms for two bottleneck optimizati

Algorithms for two bottleneck optimization problems

✍ Harold N Gabow; Robert E Tarjan 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 435 KB

On optimal algorithms for problems defin

On optimal algorithms for problems defined on groups

✍ Misako Yokoyama 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 459 KB

Optimal Parallel Algorithms for Quadtree

Optimal Parallel Algorithms for Quadtree Problems

✍ S. Kasif 📂 Article 📅 1994 🏛 Elsevier Science ⚖ 449 KB

In this paper we describe optimal processor-time parallel algorithms for set operations such as union, intersection, comparison on quadtrees. The algorithms presented in this paper run in \(O(\log\) \(N\) ) time using \(N / \log N\) processors on a shared memory model of computation that allows conc