Almost optimal explicit selectors

Bogdan S. Chlebus, Dariusz R. Kowalski

Research output: Contribution to journalConference article

Abstract

We understand selection by intersection as distinguishing a single element of a set by the uniqueness of its occurrence in some other set. More precisely, given two sets A and B, if A ∩ B = {z}, then element z ∈ A is selected by set B. Selectors are such families S of sets B of some domain that allow to select many elements from sufficiently small subsets A of the domain. Selectors are used in communication protocols for the multiple-access channel, in implementations of distributed-computing primitives in radio networks, and in algorithms for group testing. We give new explicit (n, k, r)-selectors of size script O sign(min [n, k2/k-r+1 polylog n]), for any parameters r ≤ k ≤ n. We establish a lower bound Ω(min [n, k2/k-r+1 · log(n/k)/log(k/(k-r+1))]) on the length of (n, k, r)-selectors, which demonstrates that our construction is within a polylog n factor close to optimal. The new selectors are applied to develop explicit implementations of selection resolution on the multiple-access channel, gossiping in radio networks and an algorithm for group testing with inhibitors.

Original languageEnglish (US)
Pages (from-to)270-280
Number of pages11
JournalLecture Notes in Computer Science
Volume3623
StatePublished - Oct 24 2005
Externally publishedYes
Event15th International Symposium on Fundamentals of Computation Theory, FCT 2005 - Lubeck, Germany
Duration: Aug 17 2005Aug 20 2005

Fingerprint

Selector
Testing
Distributed computer systems
Group Testing
Multiple Access Channel
Radio Networks
Network protocols
Gossiping
Communication Protocol
Distributed Computing
Inhibitor
Uniqueness
Intersection
Lower bound
Subset
Demonstrate

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Chlebus, B. S., & Kowalski, D. R. (2005). Almost optimal explicit selectors. Lecture Notes in Computer Science, 3623, 270-280.

Almost optimal explicit selectors. / Chlebus, Bogdan S.; Kowalski, Dariusz R.

In: Lecture Notes in Computer Science, Vol. 3623, 24.10.2005, p. 270-280.

Research output: Contribution to journalConference article

Chlebus, BS & Kowalski, DR 2005, 'Almost optimal explicit selectors', Lecture Notes in Computer Science, vol. 3623, pp. 270-280.
Chlebus BS, Kowalski DR. Almost optimal explicit selectors. Lecture Notes in Computer Science. 2005 Oct 24;3623:270-280.
Chlebus, Bogdan S. ; Kowalski, Dariusz R. / Almost optimal explicit selectors. In: Lecture Notes in Computer Science. 2005 ; Vol. 3623. pp. 270-280.
@article{089afeba1d96447cb96d86284b951495,
title = "Almost optimal explicit selectors",
abstract = "We understand selection by intersection as distinguishing a single element of a set by the uniqueness of its occurrence in some other set. More precisely, given two sets A and B, if A ∩ B = {z}, then element z ∈ A is selected by set B. Selectors are such families S of sets B of some domain that allow to select many elements from sufficiently small subsets A of the domain. Selectors are used in communication protocols for the multiple-access channel, in implementations of distributed-computing primitives in radio networks, and in algorithms for group testing. We give new explicit (n, k, r)-selectors of size script O sign(min [n, k2/k-r+1 polylog n]), for any parameters r ≤ k ≤ n. We establish a lower bound Ω(min [n, k2/k-r+1 · log(n/k)/log(k/(k-r+1))]) on the length of (n, k, r)-selectors, which demonstrates that our construction is within a polylog n factor close to optimal. The new selectors are applied to develop explicit implementations of selection resolution on the multiple-access channel, gossiping in radio networks and an algorithm for group testing with inhibitors.",
author = "Chlebus, {Bogdan S.} and Kowalski, {Dariusz R.}",
year = "2005",
month = "10",
day = "24",
language = "English (US)",
volume = "3623",
pages = "270--280",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Almost optimal explicit selectors

AU - Chlebus, Bogdan S.

AU - Kowalski, Dariusz R.

PY - 2005/10/24

Y1 - 2005/10/24

N2 - We understand selection by intersection as distinguishing a single element of a set by the uniqueness of its occurrence in some other set. More precisely, given two sets A and B, if A ∩ B = {z}, then element z ∈ A is selected by set B. Selectors are such families S of sets B of some domain that allow to select many elements from sufficiently small subsets A of the domain. Selectors are used in communication protocols for the multiple-access channel, in implementations of distributed-computing primitives in radio networks, and in algorithms for group testing. We give new explicit (n, k, r)-selectors of size script O sign(min [n, k2/k-r+1 polylog n]), for any parameters r ≤ k ≤ n. We establish a lower bound Ω(min [n, k2/k-r+1 · log(n/k)/log(k/(k-r+1))]) on the length of (n, k, r)-selectors, which demonstrates that our construction is within a polylog n factor close to optimal. The new selectors are applied to develop explicit implementations of selection resolution on the multiple-access channel, gossiping in radio networks and an algorithm for group testing with inhibitors.

AB - We understand selection by intersection as distinguishing a single element of a set by the uniqueness of its occurrence in some other set. More precisely, given two sets A and B, if A ∩ B = {z}, then element z ∈ A is selected by set B. Selectors are such families S of sets B of some domain that allow to select many elements from sufficiently small subsets A of the domain. Selectors are used in communication protocols for the multiple-access channel, in implementations of distributed-computing primitives in radio networks, and in algorithms for group testing. We give new explicit (n, k, r)-selectors of size script O sign(min [n, k2/k-r+1 polylog n]), for any parameters r ≤ k ≤ n. We establish a lower bound Ω(min [n, k2/k-r+1 · log(n/k)/log(k/(k-r+1))]) on the length of (n, k, r)-selectors, which demonstrates that our construction is within a polylog n factor close to optimal. The new selectors are applied to develop explicit implementations of selection resolution on the multiple-access channel, gossiping in radio networks and an algorithm for group testing with inhibitors.

UR - http://www.scopus.com/inward/record.url?scp=26844489396&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=26844489396&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:26844489396

VL - 3623

SP - 270

EP - 280

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -