{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T17:34:58Z","timestamp":1648748098851},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,10,4]],"date-time":"2014-10-04T00:00:00Z","timestamp":1412380800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1007\/s00224-014-9577-1","type":"journal-article","created":{"date-parts":[[2014,10,3]],"date-time":"2014-10-03T03:30:08Z","timestamp":1412307008000},"page":"593-611","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards Optimal Degree Distributions for Left-Perfect Matchings in Random Bipartite Graphs"],"prefix":"10.1007","volume":"56","author":[{"given":"Martin","family":"Dietzfelbinger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Rink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,10,4]]},"reference":[{"key":"9577_CR1","unstructured":"Dietzfelbinger, M., Goerdt, A., Mitzenmacher, M., Montanari, A., Pagh, R., Rink, M.: Tight Thresholds for Cuckoo Hashing via XORSAT (2009). arXiv: CoRRabs\/0912.0287"},{"key":"9577_CR2","doi-asserted-by":"crossref","unstructured":"Dietzfelbinger, M., Goerdt, A., Mitzenmacher, M., Montanari, A., Pagh, R., Rink, M.: Tight Thresholds for Cuckoo Hashing via XORSAT. In: Proceedings 37th ICALP (1), LNCS, vol. 6198, pp 213\u2013225. Springer (2010)","DOI":"10.1007\/978-3-642-14165-2_19"},{"key":"9577_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511581274","volume-title":"Concentration of Measure for the Analysis of Randomized Algorithms, 1st edn. Cambridge University Press, New York","author":"DP Dubhashi","year":"2009","unstructured":"Dubhashi, D.P., Panconesi, A.: Concentration of Measure for the Analysis of Randomized Algorithms, 1st edn. Cambridge University Press, New York. NY, USA (2009)"},{"issue":"2","key":"9577_CR4","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s00224-004-1195-x","volume":"38","author":"D Fotakis","year":"2005","unstructured":"Fotakis, D., Pagh, R., Sanders, P., Spirakis, P.G.: Space Efficient Hash Tables with Worst Case Constant Access Time. Theory. Comput. Syst. 38(2), 229\u2013248 (2005)","journal-title":"Theory. Comput. Syst."},{"issue":"3","key":"9577_CR5","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1002\/rsa.20426","volume":"41","author":"N Fountoulakis","year":"2012","unstructured":"Fountoulakis, N., Panagiotou, K.: Sharp Load Thresholds for Cuckoo Hashing. Random. Struct. Algorithms 41(3), 306\u2013333 (2012)","journal-title":"Random. Struct. Algorithms"},{"issue":"3","key":"9577_CR6","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1002\/rsa.20427","volume":"41","author":"AM Frieze","year":"2012","unstructured":"Frieze, A.M., Melsted, P.: Maximum Matchings in Random Bipartite Graphs and the Space Utilization of Cuckoo Hash Tables. Random. Struct. Algorithms 41(3), 334\u2013364 (2012)","journal-title":"Random. Struct. Algorithms"},{"issue":"2","key":"9577_CR7","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1109\/18.910575","volume":"47","author":"M Luby","year":"2001","unstructured":"Luby, M., Mitzenmacher, M., Shokrollahi, M.A., Spielman, D.A.: Efficient erasure correcting codes. IEEE Trans. Info. Theory 47(2), 569\u2013584 (2001)","journal-title":"IEEE Trans. Info. Theory"},{"key":"9577_CR8","doi-asserted-by":"crossref","unstructured":"Rink, M.: Mixed Hypergraphs for Linear-Time Construction of Denser Hashing-Based Data Structures. In: Proceedings 39th SOFSEM, LNCS, vol. 7741, pp 356\u2013368. Springer (2013)","DOI":"10.1007\/978-3-642-35843-2_31"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-014-9577-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-014-9577-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-014-9577-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,15]],"date-time":"2019-08-15T16:03:16Z","timestamp":1565884996000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-014-9577-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,4]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,5]]}},"alternative-id":["9577"],"URL":"https:\/\/doi.org\/10.1007\/s00224-014-9577-1","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,4]]}}}