{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:18:11Z","timestamp":1750306691610,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,6,21]],"date-time":"2014-06-21T00:00:00Z","timestamp":1403308800000},"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":[[2014,6,21]]},"DOI":"10.1145\/2612669.2612674","type":"proceedings-article","created":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T14:23:03Z","timestamp":1404224583000},"page":"319-330","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Parallel peeling algorithms"],"prefix":"10.1145","author":[{"given":"Jiayang","family":"Jiang","sequence":"first","affiliation":[{"name":"Harvard University, Cambridge, MA, USA"}]},{"given":"Michael","family":"Mitzenmacher","sequence":"additional","affiliation":[{"name":"Harvard University, Cambridge , MA, USA"}]},{"given":"Justin","family":"Thaler","sequence":"additional","affiliation":[{"name":"Simons Institute for the Theory of Computing, Berkeley, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2014,6,21]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"The solution space geometry of random linear equations. Random Structures and Algorithms (to appear)","author":"Achlioptas D.","year":"2013","unstructured":"D. Achlioptas and M. Molloy . The solution space geometry of random linear equations. Random Structures and Algorithms (to appear) , 2013 . D. Achlioptas and M. Molloy. The solution space geometry of random linear equations. Random Structures and Algorithms (to appear), 2013."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795288490"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/313559.313794"},{"key":"e_1_3_2_1_4_1","volume-title":"The Bloomier filter: an efficient data structure for static support lookup tables.In Proc. of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms,pp. 30--39","author":"Chazelle B.","year":"2004","unstructured":"B. Chazelle , J. Kilian , R. Rubinfeld , and A. Tal . The Bloomier filter: an efficient data structure for static support lookup tables.In Proc. of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms,pp. 30--39 , 2004 . B. Chazelle, J. Kilian, R. Rubinfeld, and A. Tal.The Bloomier filter: an efficient data structure for static support lookup tables.In Proc. of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms,pp. 30--39, 2004."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2006.10129115"},{"key":"e_1_3_2_1_6_1","first-page":"213","volume-title":"Proc. of ICALP","author":"Dietzfelbinger M.","year":"2010","unstructured":"M. Dietzfelbinger , A. Goerdt , M. Mitzenmacher , A. Montanari , R. Pagh , and M. Rink . Tight thresholds for cuckoo hashing viaXORSAT . In Proc. of ICALP , pp. 213 -- 225 , 2010 . M. Dietzfelbinger, A. Goerdt, M. Mitzenmacher, A. Montanari,R. Pagh, and M. Rink. Tight thresholds for cuckoo hashing viaXORSAT. In Proc. of ICALP, pp. 213--225, 2010."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043164.2018462"},{"key":"e_1_3_2_1_8_1","volume-title":"a short proof.pharXiv:1402.7326","author":"Gao P.","year":"2014","unstructured":"P. Gao . Analysis of the parallel peeling algorithm : a short proof.pharXiv:1402.7326 , 2014 . P. Gao.Analysis of the parallel peeling algorithm: a short proof.pharXiv:1402.7326, 2014."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120248"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2612669.2612674"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01940878"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/080728743"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1960.10.1181"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.963420"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and computing: Randomized algorithms and probabilistic analysis","author":"Mitzenmacher M.","year":"2005","unstructured":"M. Mitzenmacher and E. Upfal . Probability and computing: Randomized algorithms and probabilistic analysis , 2005 , Cambridge University Press . M. Mitzenmacher and E. Upfal. Probability and computing: Randomized algorithms and probabilistic analysis, 2005, Cambridge University Press."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284236"},{"key":"e_1_3_2_1_18_1","first-page":"326","volume-title":"Proc. of the 37th Annual Allerton Conference on Communication Control and Computing","author":"Mitzenmacher M.","year":"1999","unstructured":"M. Mitzenmacher and B. V\u00f6cking . The asymptotics of selecting the shortest of two, improved . Proc. of the 37th Annual Allerton Conference on Communication Control and Computing ,pp. 326 -- 327 , 1999 . M. Mitzenmacher and B. V\u00f6cking.The asymptotics of selecting the shortest of two, improved. Proc. of the 37th Annual Allerton Conference on Communication Control and Computing,pp. 326--327, 1999."},{"key":"e_1_3_2_1_19_1","first-page":"672","volume-title":"IntextitProc. of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Molloy M.","year":"2004","unstructured":"M. Molloy . The pure literal rule threshold and cores in randomhypergraphs . IntextitProc. of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms , pp. 672 -- 681 , 2004 . M. Molloy. The pure literal rule threshold and cores in randomhypergraphs. IntextitProc. of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 672--681, 2004."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.002"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/792538.792546"},{"key":"e_1_3_2_1_22_1","volume-title":"Techischen Universitat M\u00fcnchen","author":"Voll U.","year":"2001","unstructured":"U. Voll . Threshold Phenomena in Branching Trees and Sparse Random Graphs .Dissertation. Techischen Universitat M\u00fcnchen . 2001 . U. Voll.Threshold Phenomena in Branching Trees and Sparse Random Graphs.Dissertation. Techischen Universitat M\u00fcnchen. 2001."}],"event":{"name":"SPAA '14: 26th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Prague Czech Republic","acronym":"SPAA '14"},"container-title":["Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2612669.2612674","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2612669.2612674","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:34Z","timestamp":1750230094000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2612669.2612674"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,21]]},"references-count":22,"alternative-id":["10.1145\/2612669.2612674","10.1145\/2612669"],"URL":"https:\/\/doi.org\/10.1145\/2612669.2612674","relation":{},"subject":[],"published":{"date-parts":[[2014,6,21]]},"assertion":[{"value":"2014-06-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}