{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T17:04:22Z","timestamp":1761930262800,"version":"build-2065373602"},"reference-count":44,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ccc.2002.1004352","type":"proceedings-article","created":{"date-parts":[[2003,6,25]],"date-time":"2003-06-25T20:30:39Z","timestamp":1056573039000},"page":"165-174","source":"Crossref","is-referenced-by-count":8,"title":["Streaming computation of combinatorial objects"],"prefix":"10.1109","author":[{"given":"Z.","family":"Bar-Yossef","sequence":"first","affiliation":[]},{"given":"O.","family":"Reingold","sequence":"additional","affiliation":[]},{"given":"R.","family":"Shaltiel","sequence":"additional","affiliation":[]},{"given":"L.","family":"Trevisan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1090\/dimacs\/050\/05","article-title":"Computing on data streams","volume":"50","author":"henzinger","year":"1999","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90035-9"},{"key":"17","first-page":"3","article-title":"On the distribution of the number of roots of polynomials and logspace explicit extractors","author":"hartman","year":"2000","journal-title":"Proceedings of the ICALP 2000 Satellite Workshops"},{"year":"2001","author":"sivakumar","key":"36"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793244708"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959941"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-48413-4_14"},{"key":"34","first-page":"74","article-title":"On fast and provably secure message authentication based on universal hashing","volume":"1109","author":"shoup","year":"1996","journal-title":"Lecture Notes in Computer Science"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959942"},{"key":"39","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276736"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22670-0_8"},{"key":"14","first-page":"574","article-title":"Tiny families of functions with random properties","author":"goldreich","year":"1994","journal-title":"Proc Annu ACM Symp Theory Comput (STOC)"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979630091X"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(81)90040-4"},{"key":"38","first-page":"276","article-title":"On extracting randomness from weak random sources","author":"ta-shma","year":"1996","journal-title":"Proceedings of the 28th Annual ACM Symposium on Theory of Computing"},{"key":"12","article-title":"A sample of samplers - A computational perspective on sampling (survey)","author":"goldreich","year":"1997","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63486"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335306"},{"key":"43","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892063"},{"key":"42","first-page":"141","article-title":"Construction of extractors using pseudorandom generators","author":"trevisan","year":"1999","journal-title":"Proc 29th Annu ACM Symp Theory Comput (STOC '97)"},{"key":"41","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959940"},{"key":"40","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380800"},{"key":"44","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199712)11:4<345::AID-RSA4>3.0.CO;2-Z"},{"year":"2001","author":"ip","key":"22"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579322"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90257-T"},{"key":"25","first-page":"71","article-title":"Explicit construction of concentrators","volume":"9","author":"margulis","year":"1973","journal-title":"Problemy Peredac?i Informacii"},{"key":"26","first-page":"556","article-title":"Error correcting codes, perfect hashing circuits, and deterministic dynamic dictionaries","author":"miltersen","year":"1998","journal-title":"Proc 12th Symp Discrete Algorithms (SODA)"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1007\/BF01305237"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1996.0004"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301294"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/273865.273933"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1545"},{"key":"10","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1109\/SFFCS.1999.814623","article-title":"An approximate L1-difference algorithm for massive data streams","author":"feigenbaum","year":"1999","journal-title":"Proceedings of the 40th IEEE Annual Symposium on Foundations of Computer Science (FOES)"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28410"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301292"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90044-8"},{"key":"6","first-page":"100","article-title":"One-sided versus two-sided randomness","author":"buhrman","year":"1999","journal-title":"Proc Symp Theoretical Aspects of Computer Science (STACS)"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1145\/273865.273915"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539791196883"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892008"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.1999.766276"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1137\/0217015"}],"event":{"name":"17th IEEE Annual Conference on Computational Complexity","acronym":"CCC-02","location":"Montreal, Que., Canada"},"container-title":["Proceedings 17th IEEE Annual Conference on Computational Complexity"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/7872\/21680\/01004352.pdf?arnumber=1004352","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,23]],"date-time":"2020-03-23T21:31:10Z","timestamp":1584999070000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1004352\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":44,"URL":"https:\/\/doi.org\/10.1109\/ccc.2002.1004352","relation":{},"subject":[]}}