Almost optimal explicit selectors

Lecture Notes in Computer Science

Volumn 3623, Issue , 2005, Pages 270-280

  Chlebus, Bogdan S ^a   Kowalski, Dariusz R ^b,c  

^a UNIVERSITY OF COLORADO   (United States)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

^c UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; NETWORK PROTOCOLS; RADIO COMMUNICATION; SET THEORY;

GROUP TESTING; MULTIPLE-ACCESS CHANNELS; RADIO NETWORKS;

COMPUTER SCIENCE;

EID: 26844489396     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11537311_24     Document Type: Conference Paper

References (28)

1. R. Bar-Yehuda, O. Goldreich, and A. Itai, On the time complexity of broadcast in radio networks: an exponential gap between determinism and randomization, Journal of Computer and System Sciences, 45 (1992) 104-126.
2. S. Chaudhuri, and J. Radhakrishnan, Deterministic restrictions in circuit complexity, in Proc., 28th ACM Symposium on Theory of Computing (STOC), 1996, pp. 30-36.
3. B.S. Chlebus, Randomized communication in radio networks, in"Handbook of Randomized Computing," P.M. Pardalos, S. Rajasekaran, J. Reif, and J.D.P. Rolim (Eds.), Kluwer Academic Publishers, 2001, Vol. I, pp. 401-456.
4. B.S. Chlebus, L. Ga̧sieniec, A. Gibbons, A. Pelc, and W. Rytter, Deterministic broadcasting in unknown radio networks, Distributed Computing, 15 (2002) 27-38.
5. B.S. Chlebus, and D.R. Kowalski, A better wake-up in radio networks, in Proc., 23rd ACM Symposium on Principles of Distributed Computing (PODC), 2004, pp. 266-274.
6. M. Chrobak, L. Ga̧sieniec, and D.R. Kowalski, The wake-up problem in multihop radio networks, in Proc., 15th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2004, pp. 985-993.
7. M. Chrobak, L. Ga̧sieniec, and W. Rytter, Fast broadcasting and gossiping in radio networks, Journal of Algorithms, 43 (2002) 177-189.
8. W. Chu, C.J. Colbourn, and V.R. Syrotiuk, Slot synchronized topology-transparent scheduling for sensor networks, Computer Communications, to appear.
9. W. Chu, C.J. Colbourn, and V.R. Syrotiuk, Topology transparent scheduling, synchronization, and maximum delay, in Proc., 18th International Parallel and Distributed Processing Symposium (IPDPS), 2004, pp. 223-228.
10. A.E.F. dementi, P. Crescenzi, A. Monti, P. Penna, and R. Silvestri, On computing ad-hoc selective families, in Proc., 5th International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-APPROX), 2001, LNCS 2129, pp. 211-222.
11. A.E.F. Clementi, A. Monti, and R. Silvestri, Distributed broadcast in radio networks of unknown topology, Theoretical Computer Science, 302 (2003) 337-364.
12. A. Czumaj, and W. Rytter, Broadcasting algorithms in radio networks with unknown topology, in Proc., 44th IEEE Symposium on Foundations of Computer Science (FOCS), 2003, pp. 492-501.
13. A. De Bonis, L. Ga̧sieniec, and U. Vaccaro, Generalized framework for selectors with applications in optimal group testing, in Proc., 30th International Colloquium on Automata, Languages and Programming (ICALP), 2003, LNCS 2719, pp. 81-96.
14. A. De Bonis, and U. Vaccaro, Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels, Theoretical Computer Science, 306 (2003) 223-243.
15. A. De Bonis, and U. Vaccaro, Improved algorithms for group testing with inhibitors, Information Processing Letters, 67 (1998) 57-64.
16. D.Z. Du, and F.K. Hwang,"Combinatorial Group Testing and its Applications," World Scientific, 2000.
17. A.G. Dyachkov, and V.V. Rykov, A survey of superimposed code theory, Problems of Control and Information Theory, 12 (1983) 229-244.
18. A.G. Dyachkov, and V.V. Rykov, Bounds on the length of disjunctive codes, Problemy Peredachi Informatsii, 18 (1982) 7-13.
19. Z. Füredi, On r-cover free families, Journal of Combinatorial Theory (A), 73 (1996) 172-173.
20. L. Ga̧sieniec, A. Pelc, and D. Peleg, The wakeup problem in synchronous broadcast systems, SIAM Journal on Discrete Mathematics, 14 (2001) 207-222.
21. L. Ga̧sieniec, T. Radzik, and Q. Xin, Faster deterministic gossiping in directed ad-hoc radio networks, in Proc., 9th Scandinavian Workshop on Algorithm Theory (SWAT), 2004, LNCS 3111, pp. 397-407.
22. P. Indyk, Explicit constructions of selectors and related combinatorial structures, with applications, in Proc., 13th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2002, pp. 697-704.
23. S. Jukna,"Extremal Combinatorics," Springer-Verlag, 2001.
24. W.H. Kautz, and R.R.C. Singleton, Nonrandom binary superimposed codes, IEEE Transactions on Information Theory, 10 (1964) 363-377.
25. J. Komlós, and A.G. Greenberg, An asymptotically nonadaptive algorithm for conflict resolution in multiple-access channels, IEEE Transactions on Information Theory, 31 (1985) 303-306.
26. D.R. Kowalski, and A. Pelc, Time of deterministic broadcasting in radio networks with local knowledge, SIAM Journal on Computing, 33 (2004) 870-891.
27. E. Kushilevitz and Y. Mansour, An Ω(D log(N/D)) lower bound for broadcast in radio networks, SIAM Journal on Computing, 27 (1998) 702-712.
28. A. Ta-Shma, C. Umans, and D. Zucker man, Loss-less condensers, unbalanced expanders, and extractors, in Proc., 33rd ACM Symposium on Theory of Computing (STOC), 2001, pp. 143-152.