activity
20172025
most citedEfficient (nonrandom) construction and decoding for non-adaptive group testing

10 citations · 30 across the 13 of their papers we have counts for

collaborators

13 papers

cs.IT2025

Matrix Completion in Group Testing: Bounds and Simulations

Trung-Khang Tran, Thach V. Bui

The goal of group testing is to identify a small number of defective items within a large population. In the non-adaptive setting, tests are designed in advance and represented by…

cs.IT2024

Efficient designs for threshold group testing without gap

Thach V. Bui, Yeow Meng Chee, Van Khu Vu

Given defective items in a population of items with , in threshold group testing without gap, the outcome of a test on a subset of items is positive if the subset…

cs.IT2023★ 3 cited

Concomitant Group Testing

Thach V. Bui, Jonathan Scarlett

In this paper, we introduce a variation of the group testing problem capturing the idea that a positive test requires a combination of multiple ``types'' of item. Specifically, we…

cs.IT2021

Improved algorithms for non-adaptive group testing with consecutive positives

Thach V. Bui, Mahdi Cheraghchi, An T. H. Nguyen +1

The goal of group testing is to efficiently identify a few specific items, called positives, in a large population of items via tests. A test is an action on a subset of items whic…

cs.IT2020★ 1 cited

Improved non-adaptive algorithms for threshold group testing with a gap

Thach V. Bui, Mahdi Cheraghchi, Isao Echizen

The basic goal of threshold group testing is to identify up to defective items among a population of items, where is usually much smaller than . The outcome of a tes…

cs.IT2019

Efficient and error-tolerant schemes for non-adaptive complex group testing and its application in complex disease genetics

Thach V. Bui, Minoru Kuribayashi, Mahdi Cheraghchi +1

The goal of combinatorial group testing is to efficiently identify up to defective items in a large population of items, where . Defective items satisfy certain pr…

cs.IT2019★ 2 cited

Improved encoding and decoding for non-adaptive threshold group testing

Thach V. Bui, Minoru Kuribayashi, Mahdi Cheraghchi +1

The goal of threshold group testing is to identify up to defective items among a population of items, where is usually much smaller than . A test is positive if it h…

cs.IT2018★ 6 cited

A framework for generalized group testing with inhibitors and its potential application in neuroscience

Thach V. Bui, Minoru Kuribayashi, Mahdi Cheraghchi +1

The main goal of group testing with inhibitors (GTI) is to efficiently identify a small number of defective items and inhibitor items in a large set of items. A test on a subset of…

cs.IT2018★ 2 cited

Sublinear decoding schemes for non-adaptive group testing with inhibitors

Thach V. Bui, Minoru Kuribayashi, Tetsuya Kojima +1

Identification of up to defective items and up to inhibitors in a set of items is the main task of non-adaptive group testing with inhibitors. To efficiently reduce the…

cs.IT2018★ 10 cited

Efficient (nonrandom) construction and decoding for non-adaptive group testing

Thach V. Bui, Minoru Kuribayashi, Tetsuya Kojima +2

The task of non-adaptive group testing is to identify up to defective items from items, where a test is positive if it contains at least one defective item, and negative ot…

cs.IT2018

Efficient Decoding Schemes for Noisy Non-Adaptive Group Testing when Noise Depends on Number of Items in Test

Thach V. Bui, Tetsuya Kojima, Minoru Kuribayashi +1

The goal of non-adaptive group testing is to identify at most defective items from items, in which a test of a subset of items is positive if it contains at least one d…

cs.IT2017★ 1 cited

Efficiently Decodable Non-Adaptive Threshold Group Testing

Thach V. Bui, Minoru Kuribayashi, Mahdi Cheraghchi +1

We consider non-adaptive threshold group testing for identification of up to defective items in a set of items, where a test is positive if it contains at least $2 \leq u \…

cs.IT2017★ 5 cited

Non-Adaptive Group Testing Framework based on Concatenation Code

Thach V. Bui, Minoru Kuribayashi, Isao Echizen

We consider an efficiently decodable non-adaptive group testing (NAGT) problem that meets theoretical bounds. The problem is to find a few specific items (at most ) satisfying c…