{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:13:27Z","timestamp":1763468007412},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540275800"},{"type":"electronic","value":"9783540316916"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11523468_57","type":"book-chapter","created":{"date-parts":[[2010,7,18]],"date-time":"2010-07-18T14:58:59Z","timestamp":1279465139000},"page":"702-716","source":"Crossref","is-referenced-by-count":10,"title":["Optimal Cover Time for a Graph-Based Coupon Collector Process"],"prefix":"10.1007","author":[{"given":"Nedialko B.","family":"Dimitrov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. Greg","family":"Plaxton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"57_CR1","doi-asserted-by":"crossref","unstructured":"Adler, M., Halperin, E., Karp, R., Vazirani, V.: A stochastic process on the hypercube with applications to peer-to-peer networks. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pp. 575\u2013584 (2003)","DOI":"10.1145\/780542.780626"},{"key":"57_CR2","unstructured":"Alon, N.: Problems and results in extremal combinatorics, II. (2004) (manuscript)"},{"key":"57_CR3","volume-title":"The Probabilistic Method","author":"N. Alon","year":"1991","unstructured":"Alon, N., Spencer, J.H.: The Probabilistic Method. Wiley, New York (1991)"},{"key":"57_CR4","doi-asserted-by":"crossref","unstructured":"Dimitrov, N.B., Plaxton, C.G.: Optimal cover time for a graph-based coupon collector process. Technical Report TR\u201305\u201301, Department of Computer Science, University of Texas at Austin (January 2005)","DOI":"10.1007\/11523468_57"},{"key":"57_CR5","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/978-3-662-04650-0","volume-title":"Extremal Combinatorics","author":"S. Jukna","year":"2001","unstructured":"Jukna, S.: Extremal Combinatorics, pp. 224\u2013225. Springer, Heidelberg (2001)"},{"key":"57_CR6","first-page":"547","volume-title":"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, and Hypercubes","author":"F.T. Leighton","year":"1991","unstructured":"Leighton, F.T.: Introduction to Parallel Algorithms and Architectures: Arrays, Trees, and Hypercubes, pp. 547\u2013556. Morgan-Kaufmann, San Mateo (1991)"},{"key":"57_CR7","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"key":"57_CR8","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0022-0000(91)90005-P","volume":"42","author":"A.G. Ranade","year":"1991","unstructured":"Ranade, A.G.: How to emulate shared memory. Journal of Computer and System Sciences\u00a042, 307\u2013326 (1991)","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11523468_57.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:06:12Z","timestamp":1605625572000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11523468_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540275800","9783540316916"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/11523468_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}