{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T13:07:14Z","timestamp":1768914434443,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":55,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T00:00:00Z","timestamp":1497830400000},"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":[[2017,6,19]]},"DOI":"10.1145\/3055399.3055429","type":"proceedings-article","created":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T20:27:45Z","timestamp":1497558465000},"page":"1157-1170","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Towards optimal two-source extractors and Ramsey graphs"],"prefix":"10.1145","author":[{"given":"Gil","family":"Cohen","sequence":"first","affiliation":[{"name":"Princeton University, USA"}]}],"member":"320","published-online":{"date-parts":[[2017,6,19]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(72)90009-X"},{"issue":"3","key":"e_1_3_2_2_2_1","first-page":"289","article-title":"Simple constructions of almost k-wise independent random variables. Random Structures &","volume":"3","author":"Alon N.","year":"1992","journal-title":"Algorithms"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009824"},{"key":"e_1_3_2_2_4_1","volume-title":"Electronic Colloquium on Computational Complexity (ECCC), number 088","author":"Ben-Aroya A.","year":"2016"},{"key":"e_1_3_2_2_5_1","unstructured":"{Bar06} B. Barak. A simple explicit construction of an n \u02dc o(log n) -Ramsey graph. arXiv preprint math\/0601651 2006.  {Bar06} B. Barak. A simple explicit construction of an n \u02dc o(log n) -Ramsey graph. arXiv preprint math\/0601651 2006."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447141"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1734213.1734214"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1142\/S1793042105000108"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2012.176.3.3"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993661"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217015"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897547"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190050109"},{"key":"e_1_3_2_2_14_1","volume-title":"Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS)","author":"Chattopadhyay E.","year":"2016"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.57"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.28"},{"key":"e_1_3_2_2_17_1","volume-title":"LIPIcs-Leibniz International Proceedings in Informatics","volume":"50","author":"Cohen G.","year":"2016"},{"key":"e_1_3_2_2_18_1","volume-title":"Electronic Colloquium on Computational Complexity (ECCC), page 30","author":"Cohen G.","year":"2016"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897530"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/130908634"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.27"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897528"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.40"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/120868414"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.35"},{"key":"e_1_3_2_2_26_1","first-page":"110","volume-title":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","author":"Dodis Y."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-007-0223-z"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536496"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1947-08785-1"},{"key":"e_1_3_2_2_30_1","first-page":"463","article-title":"A combinatorial problem in geometry","volume":"2","author":"Erd\u00f6s P.","year":"1935","journal-title":"Compositio Mathematica"},{"key":"e_1_3_2_2_31_1","first-page":"297","article-title":"A constructive lower bound for some Ramsey numbers","volume":"3","author":"Frankl P.","year":"1977","journal-title":"Ars Combinatoria"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579457"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.37236\/1493"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01884295"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1538902.1538904"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2011.26"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214052"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.26"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.19"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.58"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"crossref","unstructured":"{Li16} X. Li. Improved non-malleable extractors non-malleable codes and independent source extractors 2016. Personal communication.  {Li16} X. Li. Improved non-malleable extractors non-malleable codes and independent source extractors 2016. Personal communication.","DOI":"10.1145\/3055399.3055486"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780630"},{"key":"e_1_3_2_2_43_1","unstructured":"{LWZ11} X. Li T. D. Wooley and D. Zuckerman. Privacy amplification and nonmalleable extractors via character sums. arXiv preprint arXiv:1102.5415 2011.  {LWZ11} X. Li T. D. Wooley and D. Zuckerman. Privacy amplification and nonmalleable extractors via character sums. arXiv preprint arXiv:1102.5415 2011."},{"key":"e_1_3_2_2_44_1","first-page":"301","article-title":"A constructive estimation of the Ramsey numbers","volume":"23","author":"Nagy Zs.","year":"1975","journal-title":"Mat. Lapok"},{"key":"e_1_3_2_2_45_1","first-page":"8810","article-title":"Constructing Ramsey graphs from small probability spaces","author":"Naor M.","year":"1992","journal-title":"IBM Research Report RJ"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1137\/0222053"},{"key":"e_1_3_2_2_47_1","first-page":"327","article-title":"Pseudorandom sets and explicit constructions of Ramsey graphs","volume":"13","author":"Pudl\u00e1k P.","year":"2004","journal-title":"Quad. Mat"},{"issue":"4","key":"e_1_3_2_2_48_1","first-page":"338","article-title":"On a problem of formal logic","volume":"30","author":"Ramsey F. P.","year":"1928","journal-title":"Proceedings of the London Mathematical Society"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060593"},{"key":"e_1_3_2_2_50_1","first-page":"201","volume-title":"40th Annual Symposium on Foundations of Computer Science (FOCS)","author":"Raz R."},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"crossref","unstructured":"{Sti09} H. Stichtenoth. Algebraic function fields and codes volume 254. Springer Science & Business Media 2009.   {Sti09} H. Stichtenoth. Algebraic function fields and codes volume 254. Springer Science & Business Media 2009.","DOI":"10.1007\/978-3-540-76878-4"},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237877"},{"key":"e_1_3_2_2_53_1","volume-title":"Hebrew University of Jerusalem","author":"Ta-Shma A.","year":"1996"},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2238656"},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2007.v003a006"}],"event":{"name":"STOC '17: Symposium on Theory of Computing","location":"Montreal Canada","acronym":"STOC '17","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055429","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3055399.3055429","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:23:27Z","timestamp":1750220607000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055429"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,19]]},"references-count":55,"alternative-id":["10.1145\/3055399.3055429","10.1145\/3055399"],"URL":"https:\/\/doi.org\/10.1145\/3055399.3055429","relation":{},"subject":[],"published":{"date-parts":[[2017,6,19]]},"assertion":[{"value":"2017-06-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}