{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:51Z","timestamp":1725490251539},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540742074"},{"type":"electronic","value":"9783540742081"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74208-1_30","type":"book-chapter","created":{"date-parts":[[2007,8,27]],"date-time":"2007-08-27T10:52:26Z","timestamp":1188211946000},"page":"409-421","source":"Crossref","is-referenced-by-count":4,"title":["Random Subsets of the Interval and P2P Protocols"],"prefix":"10.1007","author":[{"given":"Jacek","family":"Cicho\u0144","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Klonowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u0141ukasz","family":"Krzywiecki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bart\u0142omiej","family":"R\u00f3\u017ca\u0144ski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawe\u0142","family":"Zieli\u0144ski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","unstructured":"Cartan, H.: Elementary Theory of Analytic Functions of One or Several Complex Variables. Herman, Paris (1973)"},{"issue":"5","key":"30_CR2","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1214\/aop\/1176994313","volume":"9","author":"L. Devroye","year":"1981","unstructured":"Devroye, L.: Laws of the iterated logarithm for order statistics of uniform spacings. The Annals of Probability\u00a09(5), 860\u2013867 (1981)","journal-title":"The Annals of Probability"},{"key":"30_CR3","volume-title":"An Introduction to Probability Theory and Its Applications","author":"W. Feller","year":"1965","unstructured":"Feller, W.: An Introduction to Probability Theory and Its Applications, vol.\u00a0II. John Wiley and Sons Inc., New York (1965)"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF01934993","volume":"25","author":"P. Flajolet","year":"1985","unstructured":"Flajolet, P.: Approximate counting: A detailed analysis. BIT\u00a025, 113\u2013134 (1985)","journal-title":"BIT"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"King, V., Saia, J.: Choosing a random peer. In: Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing, pp. 125\u2013130 (2004)","DOI":"10.1145\/1011767.1011786"},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1051\/ita\/1991250100431","volume":"25","author":"P. Kirschenhofer","year":"1991","unstructured":"Kirschenhofer, P., Prodinger, H.: Approximate counting: an alternative approach. Informatique Theorique et Applications\u00a025, 43\u201348 (1991)","journal-title":"Informatique Theorique et Applications"},{"key":"30_CR7","volume-title":"Sorting and Searching. The art of computer programming","author":"D.E. Knuth","year":"1997","unstructured":"Knuth, D.E.: Sorting and Searching. The art of computer programming, 3rd edn. Addison-Wesley, Reading, Massachusetts (1997)","edition":"3"},{"key":"30_CR8","doi-asserted-by":"publisher","first-page":"97","DOI":"10.4064\/am31-1-8","volume":"31","author":"B. Kopoci\u0144ski","year":"2004","unstructured":"Kopoci\u0144ski, B.: A random split of the interval [0,1]. Aplicationes Mathematicae\u00a031, 97\u2013106 (2004)","journal-title":"Aplicationes Mathematicae"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Liben-Nowell, D., Balakrishnan, H., Karger, D.: Analysis of the evolution of peer-to-peer systems. In: 21st ACM Symposium on Principles of Distributed Computing (PODC), Monterey, CA (July 2002)","DOI":"10.1145\/571825.571863"},{"key":"30_CR10","first-page":"161","volume":"21","author":"R. Morris","year":"1978","unstructured":"Morris, R.: Counting large numbers of events in small registers. Communications of The ACM\u00a021, 161\u2013172 (1978)","journal-title":"Communications of The ACM"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: Proceedings of the ACM SIGCOMM 2001 Conference, San Diego, California, USA (August 2001)","DOI":"10.1145\/383059.383072"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proceedings of the ACM SIGCOMM 2001 Conference, San Diego, California, USA (August 2001)","DOI":"10.1145\/383059.383071"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74208-1_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T22:04:33Z","timestamp":1550873073000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74208-1_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540742074","9783540742081"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74208-1_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}