{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T03:01:18Z","timestamp":1729652478418,"version":"3.28.0"},"reference-count":23,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ccc.2004.1313772","type":"proceedings-article","created":{"date-parts":[[2004,11,13]],"date-time":"2004-11-13T00:14:14Z","timestamp":1100304854000},"page":"15-28","source":"Crossref","is-referenced-by-count":1,"title":["Language compression and pseudorandom generators"],"prefix":"10.1109","author":[{"given":"H.","family":"Burhman","sequence":"first","affiliation":[]},{"given":"T.","family":"Lee","sequence":"additional","affiliation":[]},{"given":"D.","family":"van Melkeback","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.1999.766253"},{"key":"22","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1145\/301250.301289","article-title":"Construction of extractors using pseudo-random generators","author":"trevisan","year":"1999","journal-title":"Proceedings of the 31st ACM Symposium on the Theory of Computing"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808762"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509997"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1997.0439"},{"key":"15","first-page":"67","article-title":"Recent developments in explicit construction of extractors","volume":"77","author":"shaltiel","year":"2002","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959941"},{"journal-title":"Computational Complexity","year":"1994","author":"papadimitriou","key":"13"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301292"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2606-0"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80043-1"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959940"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979834388X"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380790"},{"key":"2","volume":"11","author":"balca?zar","year":"1995","journal-title":"Structural Complexity I Volume 11 of EATCS Monographs on Theoretical Computer Science"},{"journal-title":"The Complexity Zoo","year":"0","author":"aaronson","key":"1"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28629-5_35"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/321356.321362"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"5","first-page":"7","article-title":"Bounds on the length of disjunctive codes","volume":"18","author":"dyachkov","year":"1982","journal-title":"Problemy Peredachi Informatsii"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2000.856742"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.1999.766261"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700389652"}],"event":{"name":"Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004.","location":"Amherst, MA, USA"},"container-title":["Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9188\/29139\/01313772.pdf?arnumber=1313772","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,30]],"date-time":"2023-04-30T05:55:15Z","timestamp":1682834115000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1313772\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/ccc.2004.1313772","relation":{},"subject":[]}}