{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:09Z","timestamp":1725663729929},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540557197"},{"type":"electronic","value":"9783540472780"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55719-9_83","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T05:34:42Z","timestamp":1330234482000},"page":"308-317","source":"Crossref","is-referenced-by-count":7,"title":["Near-perfect token distribution"],"prefix":"10.1007","author":[{"given":"Andrei Z.","family":"Broder","sequence":"first","affiliation":[]},{"given":"Alan M.","family":"Frieze","sequence":"additional","affiliation":[]},{"given":"E.","family":"Shamir","sequence":"additional","affiliation":[]},{"given":"E.","family":"Upfal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1016\/0097-3165(78)90059-6","volume":"24","author":"E. A. Bender","year":"1978","unstructured":"Bender, E. A. and Canfield, E. R.: The asymptotic number of labeled graphs with given degree sequences. Journal of Combinatorial Theory B, 24 (1978) 296\u2013307","journal-title":"Journal of Combinatorial Theory B"},{"key":"25_CR2","unstructured":"Bollob\u00e1s, B.: Random graphs, Academic Press, (1985)"},{"key":"25_CR3","unstructured":"Pippenger, N.: On networks of noisy gates. 26th Annual Symposium on Foundations of Computer Science (1985) 30\u201338"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1137\/0218015","volume":"18","author":"D. Peleg","year":"1989","unstructured":"Peleg, D. and Upfal, E.: The token redistribution problem. SIAM Journal of Computing, 18 (1989) 229\u2013243","journal-title":"SIAM Journal of Computing"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0304-3975(87)90069-7","volume":"53","author":"D. Peleg","year":"1987","unstructured":"Peleg, D. and Upfal, E.: The Generalized Packet Routing Problem. Theoretical Computer Science, 53 (1987) 281\u2013293","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55719-9_83.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:34:46Z","timestamp":1619559286000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55719-9_83"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540557197","9783540472780"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-55719-9_83","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}