{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:39:48Z","timestamp":1750307988265,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,5,21]],"date-time":"2006-05-21T00:00:00Z","timestamp":1148169600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,5,21]]},"DOI":"10.1145\/1132516.1132611","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"671-680","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":41,"title":["2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction"],"prefix":"10.1145","author":[{"given":"Boaz","family":"Barak","sequence":"first","affiliation":[{"name":"Princeton University, Princeton, NJ"}]},{"given":"Anup","family":"Rao","sequence":"additional","affiliation":[{"name":"University of Texas at Austin, Austin, TX"}]},{"given":"Ronen","family":"Shaltiel","sequence":"additional","affiliation":[{"name":"University of Haifa, Haifa, Israel"}]},{"given":"Avi","family":"Wigderson","sequence":"additional","affiliation":[{"name":"Institute for Advanced Study, Princeton, NJ"}]}],"member":"320","published-online":{"date-parts":[[2006,5,21]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"18","article-title":"The shannon capacity of a union","author":"Alon N.","year":"1998","unstructured":"N. Alon . The shannon capacity of a union . Combinatorica , 18 , 1998 . N. Alon. The shannon capacity of a union. Combinatorica, 18, 1998.","journal-title":"Combinatorica"},{"key":"e_1_3_2_1_2_1","volume-title":"Arxiv","author":"Barak B.","year":"2006","unstructured":"B. Barak . A simple explicit construction of an nTildeo(log n)-ramsey graph. Technical report , Arxiv , 2006 . http:\/\/arxiv.org\/abs\/math.CO\/0601651. B. Barak. A simple explicit construction of an nTildeo(log n)-ramsey graph. Technical report, Arxiv, 2006. http:\/\/arxiv.org\/abs\/math.CO\/0601651."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.29"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060592"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1142\/S1793042105000108"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00039-004-0451-1"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.510003"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217015"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579457"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2006.14"},{"key":"e_1_3_2_1_11_1","first-page":"7","article-title":"Low rank co-diagonal matrices and ramsey graphs","author":"Grolmusz V.","year":"2000","unstructured":"V. Grolmusz . Low rank co-diagonal matrices and ramsey graphs . Electr. J. Comb , 7 , 2000 . V. Grolmusz. Low rank co-diagonal matrices and ramsey graphs. Electr. J. Comb, 7, 2000.","journal-title":"Electr. J. Comb"},{"key":"e_1_3_2_1_12_1","volume-title":"Better extractors for better codes? Electronic Colloquium on Computational Complexity (ECCC), (080)","author":"Guruswami V.","year":"2003","unstructured":"V. Guruswami . Better extractors for better codes? Electronic Colloquium on Computational Complexity (ECCC), (080) , 2003 . V. Guruswami. Better extractors for better codes? Electronic Colloquium on Computational Complexity (ECCC), (080), 2003."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780630"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1998.1577"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167162"},{"key":"e_1_3_2_1_16_1","volume-title":"Pseudorandom sets and explicit constructions of ramsey graphs. Submitted for publication","author":"Pudlak P.","year":"2004","unstructured":"P. Pudlak and V. Rodl . Pseudorandom sets and explicit constructions of ramsey graphs. Submitted for publication , 2004 . P. Pudlak and V. Rodl. Pseudorandom sets and explicit constructions of ramsey graphs. Submitted for publication, 2004."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132589"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060593"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796581"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(86)90044-9"},{"key":"e_1_3_2_1_21_1","first-page":"67","article-title":"Recent developments in explicit constructions of extractors","volume":"77","author":"Shaltiel R.","year":"2002","unstructured":"R. Shaltiel . Recent developments in explicit constructions of extractors . Bulletin of the European Association for Theoretical Computer Science , 77 : 67 -- 95 , 2002 . R. Shaltiel. Recent developments in explicit constructions of extractors. Bulletin of the European Association for Theoretical Computer Science, 77:67--95, 2002.","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838377"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22186"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004930050049"}],"event":{"name":"STOC06: Symposium on Theory of Computing","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Seattle WA USA","acronym":"STOC06"},"container-title":["Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1132516.1132611","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1132516.1132611","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:06:13Z","timestamp":1750259173000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1132516.1132611"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,5,21]]},"references-count":24,"alternative-id":["10.1145\/1132516.1132611","10.1145\/1132516"],"URL":"https:\/\/doi.org\/10.1145\/1132516.1132611","relation":{},"subject":[],"published":{"date-parts":[[2006,5,21]]},"assertion":[{"value":"2006-05-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}