Locally explicit construction of Rödl's asymptotically good packings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1450 LNCS, Issue , 1998, Pages 194-202

  Kuzjurin, Nikolai N ^a  

^a INSTITUTE FOR SYSTEM PROGRAMMING   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; ALGORITHMS;

BIT COMPLEXITY; EXPLICIT CONSTRUCTIONS;

COMPUTATIONAL COMPLEXITY;

EID: 84896693095     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055768     Document Type: Conference Paper

References (25)

1. A.V. Aho, J.E. Hopcroft and J.D. Ullman, The design and analysis of computer algorithms, Addison-Wesley, 1976.
2. N. Alon, J. Brück, J. Naor, M. Naor and R. Roth, Construction of asymptotically good, low-rate error-correcting codes through pseudorandom graphs, IEEE Transactions on Information Theory, 38 (1992) 509-516.
3. N. Alon, J.H. Kim and J.H. Spencer, Nearly perfect matchings in regular simple hypergraphs, Preprint, 1996.
4. N. Alon and J.H. Spencer, The probabilistic method. John Wiley and Sons, New York, 1992.
5. P. Erdös and J. Spencer, Probabilistic methods in combinatorics, Akademie Press. New York, 1974.
6. P. Erdös and H. Hanani, On a limit theorem in combinatorial analysis. Publ. Math. Debrecen. 10 (1963) 10-13.
7. P. Frankl and V. Rödl, Near perfect coverings in graphs and hypergraphs, Europ. J. Combinatorics, 6 (1985), 317-326.
8. D.M. Gordon, O. Patashnik, G, Kuperberg and J.H. Spencer, Asymptotically optimal covering designs, J. Comb. Theory A 75 (1996) 270-280.
9. D.A. Grable, Nearly-perfect hypergraph packing is in NC, Information Process. Letters, 60 (1997) 295-299.
10. H. Iwaniec and J. Pintz, Primes in short intervals, Monatsch. Math. 98 (1984) 115-143.
11. J. Kahn, A linear programming perspective on the Frankl-Rödl- Pippenger theorem, Random Structures and Algorithms, 8 (1996) 149-157.
12. R.M. Karp and V. Ramachandran, Parallel algorithms for shared-memory machines, In Handbook of Theoretical Computer Science (ed. J. van Leeuwen), Elsevier, 1990, 869-942.
13. N.N. Kuzjurin, On the difference between asymptotically good packings and coverings. - European J. Comb. 16 (1995) 35-40.
14. R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, 1995.
15. M. Naor, L.J. Shulman and A. Srinivasan, Splitters and near-optimal derandomization, Proc. 36th Ann. IEEE FOCS, 1995, 182-191.
16. N. Pippenger and J. Spencer, Asymptotic behavior of the chromatic index for hypergraphs. J. Comb. Theory. Ser. A51 (1989) 24-42.
17. V. Rödl, On a packing and covering problem. Europ. J. Combinatorics. 5 (1985) 69-78.
18. V. Rödl and L. Thoma, Asymptotic packing and the random greedy algorithm, Random Structures Algorithms 8 (1996) 161-177.
19. M. Saks, A. Srinivasan and S. Zhou, Explicit dispersers with polylog degree, Proc. Annu. 27th ACM STOC-95, 1995, 479-488.
20. I. Sparlinski, Approximate constructions in finite fields, In Finite Fields and Applications, London Math. Soc, Lect. Notes Ser., v. 233, Cambridge Univ. Press, Cambridge, 1996, 313-332.
21. I. Sparlinski, Finding irreducible and primitive polynomials, Appl. Algebra in En-gin., Commun, and Computing, 4 (1993) 263-268.
22. J.H. Spencer, Ten Lectures on the Probabilistic Method, SIAM, Philadelphia, 1987.
23. J. Spencer, Asymptotic packing via a branching process, Random Structures Algorithms 7 (1995) 167-172.
24. J. Spencer, Asymptotically good coverings. Pacific J. Math. 118 (1985) 575-586.
25. V.A. Zinoviev, Cascade equal-weight codes and maximal packings, Problems of Control and Information Theory 12 (1983) 3-10.