Explicit constructions of selectors and related combinatorial structures, with applications

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 697-704

  Indyk, Piotr ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037962389     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. [ABRVVOO] M. Alekhnovich, E. Ben-Sasson, A. Razborov and A. Wigderson, "Pseudorandom Generators in Prepositional Proof Complexity", FOCS'00.
2. [ASOO] N. Alon, J. Spencer, "Probabilistic method", 2nd edition, 2000.
3. [BGI87] R. Bar-Yehuda, O. Goldreich and A. Itai, "On the Time-Complexity of Broadcast in Radio Networks: An Exponential Gap Between Determinism and Randomization", PODC'87, p. 98-108.
4. [CMS01] A. E. F. Clementi, A. Monti and R. Silvestri, "Selective Families, Superimposed Codes, and Broadcasting on Unknown Radio Networks", SODA '01
5. [CGOR00] , B.Chlebus, L.Gasieniec, A.Ostlin and M.Robson, "Deterministic Radio Broadcasting", ICALP'00.
6. [CGGPR00] , B.Chlebus, L.Gasieniec, A.Gibbons, A.Pelc and W.Rytter, "Deterministic broadcasting in unknown radio networks", SODA'00.
7. [CGROO] M. Chrobak, L.Gasieniec, W. Rytter, "Fast Broadcasting and Gossiping in Radio Networks", FOCS'00.
8. [DH00] D.Z. Du and F. K. Hwang, "Combinatorial group testing and its applications", World Scientific, 2000.
9. [DP01] G. De Marco and A. Pelc, "Fast distributed coloring with 0(A) colors", SODA'01.
10. [GPPOO] L. Gasieniec, A.Pelc, D.Peleg, "The Wakeup Problem in Synchronous Broadcast Systems", PODC'00.
11. "Interpolation of Symmetric Functions and a New Type of Combinatorial Design" , STOC99.
12. [Lin92] N. Linial, "Locality in distributed graph algorithms'', SICOMP 21 (1992), pp. 193-201.
13. [NSS95] M. Naor, L. J. Schulman and A. Srinivasan, "Splitters and Near-Optimal Derandomization", FOCS'95, p. 182-191.
14. [PS92] A. Panconesi and A. Srinivasan, "Improved distributed algorithms for coloring and network decomposition problems", STOC'92.
15. [PS96] A. Panconesi and A. Srinivasan, "On the complexity of distributed network decomposition", Journal of Algorithms 20 (1996), pp. 356-374.
16. [RR99] R. Raz and O. Reingold, "On Recycling the Randomness of States in Space Bounded Computation", STOC99.
17. [TUZ01] A. Ta-Shma, C. Umans and D. Zuckerman, "Lossless Condensers, Unbalanced Expanders, and Extractors", STOC'01.
18. [RRV99] R. Raz, O. Reingold and S. Vadhan, "Extracting all the Randomness and Reducing the Error in Tre-visan's Extractors", STOC'99.
19. [RVW00] O. Reingold, S. Vadhan and A. Wigderson, "Entropy Waves, The Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors", FOCS'00.
20. [TaS96] A. Ta-Shma, "On Extracting Randomness From Weak Random Source", STOC'96.