{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T09:46:46Z","timestamp":1751881606600,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648277"},{"type":"electronic","value":"9783540685326"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055768","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T17:36:31Z","timestamp":1155836191000},"page":"194-202","source":"Crossref","is-referenced-by-count":1,"title":["Locally explicit construction of r\u0151dl's asymptotically good packings"],"prefix":"10.1007","author":[{"given":"Nikolai N.","family":"Kuzjurin","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"15_CR1","unstructured":"A.V. Aho, J.E. Hopcroft and J.D. Ullman, The design and analysis of computer algorithms, Addison-Wesley, 1976."},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1109\/18.119713","volume":"38","author":"N. Alon","year":"1992","unstructured":"N. Alon, J. Bruck, 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\u2013516.","journal-title":"IEEE Transactions on Information Theory"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"N. Alon, J.H. Kim and J.H. Spencer, Nearly perfect matchings in regular simple hypergraphs, Preprint, 1996.","DOI":"10.1007\/BF02773639"},{"key":"15_CR4","volume-title":"The probabilistic method","author":"N. Alon","year":"1992","unstructured":"N. Alon and J.H. Spencer, The probabilistic method. John Wiley and Sons, New York, 1992."},{"key":"15_CR5","volume-title":"Probabilistic methods in combinatorics","author":"P. Erd\u00f6s","year":"1974","unstructured":"P. Erd\u00f6s and J. Spencer, Probabilistic methods in combinatorics, Akademic Press. New York, 1974."},{"key":"15_CR6","doi-asserted-by":"crossref","first-page":"10","DOI":"10.5486\/PMD.1963.10.1-4.02","volume":"10","author":"P. Erd\u00f6s","year":"1963","unstructured":"P. Erd\u00f6s and H. Hanani, On a limit theorem in combinatorial analysis. Publ. Math. Debrecen. 10 (1963) 10\u201313.","journal-title":"Publ. Math. Debrecen."},{"key":"15_CR7","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0195-6698(85)80045-7","volume":"6","author":"P. Frankl","year":"1985","unstructured":"P. Frankl and V. R\u00f6dl, Near perfect coverings in graphs and hypergraphs, Europ. J. Combinatorics, 6 (1985), 317\u2013326.","journal-title":"Europ. J. Combinatorics"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1006\/jcta.1996.0077","volume":"A 75","author":"D.M. Gordon","year":"1996","unstructured":"D.M. Gordon, O. Patashnik, G, Kuperberg and J.H. Spencer, Asymptotically optimal covering designs, J. Comb. Theory A 75 (1996) 270\u2013280.","journal-title":"J. Comb. Theory"},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/S0020-0190(96)00181-0","volume":"60","author":"D.A. Grable","year":"1997","unstructured":"D.A. Grable, Nearly-perfect hypergraph packing is in NC, Information Process. Letters, 60 (1997) 295\u2013299.","journal-title":"Information Process. Letters"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF01637280","volume":"98","author":"H. Iwaniec","year":"1984","unstructured":"H. Iwaniec and J. Pintz, Primes in short intervals, Monatsch. Math. 98 (1984) 115\u2013143.","journal-title":"Monatsch. Math."},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1002\/(SICI)1098-2418(199603)8:2<149::AID-RSA5>3.0.CO;2-Y","volume":"8","author":"J. Kahn","year":"1996","unstructured":"J. Kahn, A linear programming perspective on the Frankl-R\u00f6dl-Pippenger theorem, Random Structures and Algorithms, 8 (1996) 149\u2013157.","journal-title":"Random Structures and Algorithms"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"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\u2013942.","DOI":"10.1016\/B978-0-444-88071-0.50022-9"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0195-6698(95)90087-X","volume":"16","author":"N.N. Kuzjurin","year":"1995","unstructured":"N.N. Kuzjurin, On the difference between asymptotically good packings and coverings. \u2014 European J. Comb. 16 (1995) 35\u201340.","journal-title":"European J. Comb."},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, 1995.","DOI":"10.1017\/CBO9780511814075"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"M. Naor, L.J. Shulman and A. Srinivasan, Splitters and near-optimal derandomization, Proc. 36th Ann. IEEE FOCS, 1995, 182\u2013191.","DOI":"10.1109\/SFCS.1995.492475"},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/0097-3165(89)90074-5","volume":"A51","author":"N. Pippenger","year":"1989","unstructured":"N. Pippenger and J. Spencer, Asymptotic behavior of the chromatic index for hypergraphs. J. Comb. Theory. Ser. A51 (1989) 24\u201342.","journal-title":"J. Comb. Theory. Ser."},{"key":"15_CR17","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0195-6698(85)80023-8","volume":"5","author":"V. R\u00f6dl","year":"1985","unstructured":"V. R\u00f6dl, On a packing and covering problem. Europ. J. Combinatorics. 5 (1985) 69\u201378.","journal-title":"Europ. J. Combinatorics"},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1002\/(SICI)1098-2418(199605)8:3<161::AID-RSA1>3.0.CO;2-W","volume":"8","author":"V. R\u00f6dl","year":"1996","unstructured":"V. R\u00f6dl and L. Thoma, Asymptotic packing and the random greedy algorithm, Random Structures Algorithms 8 (1996) 161\u2013177.","journal-title":"Random Structures Algorithms"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"M. Saks, A. Srinivasan and S. Zhou, Explicit dispersers with polylog degree, Proc. Annu. 27th ACM STOC-95, 1995, 479\u2013488.","DOI":"10.1145\/225058.225188"},{"key":"15_CR20","series-title":"London Math. Soc., Lect. Notes Ser.","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1017\/CBO9780511525988.024","volume-title":"Finite Fields and Applications","author":"I. Sparlinski","year":"1996","unstructured":"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\u2013332."},{"key":"15_CR21","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF01200150","volume":"4","author":"I. Sparlinski","year":"1993","unstructured":"I. Sparlinski, Finding irreducible and primitive polynomials, Appl. Algebra in Engin., Commun. and Computing, 4 (1993) 263\u2013268.","journal-title":"Appl. Algebra in Engin., Commun. and Computing"},{"key":"15_CR22","volume-title":"Ten Lectures on the Probabilistic Method","author":"J.H. Spencer","year":"1987","unstructured":"J.H. Spencer, Ten Lectures on the Probabilistic Method, SIAM, Philadelphia, 1987."},{"key":"15_CR23","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1002\/rsa.3240070206","volume":"7","author":"J. Spencer","year":"1995","unstructured":"J. Spencer, Asymptotic packing via a branching process, Random Structures Algorithms 7 (1995) 167\u2013172.","journal-title":"Random Structures Algorithms"},{"key":"15_CR24","doi-asserted-by":"crossref","first-page":"575","DOI":"10.2140\/pjm.1985.118.575","volume":"118","author":"J. Spencer","year":"1985","unstructured":"J. Spencer, Asymptotically good coverings. Pacific J. Math. 118 (1985) 575\u2013586.","journal-title":"Pacific J. Math."},{"key":"15_CR25","first-page":"3","volume":"12","author":"V.A. Zinoviev","year":"1983","unstructured":"V.A. Zinoviev, Cascade equal-weight codes and maximal packings, Problems of Control and Information Theory 12 (1983) 3\u201310.","journal-title":"Problems of Control and Information Theory"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1998"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055768","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T13:52:33Z","timestamp":1736517153000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055768"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648277","9783540685326"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/bfb0055768","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}