{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:53:08Z","timestamp":1740099188750,"version":"3.37.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030021481"},{"type":"electronic","value":"9783030021498"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-02149-8_18","type":"book-chapter","created":{"date-parts":[[2018,10,5]],"date-time":"2018-10-05T17:25:34Z","timestamp":1538760334000},"page":"298-313","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Coalgebraic Tools for Randomness-Conserving Protocols"],"prefix":"10.1007","author":[{"given":"Dexter","family":"Kozen","sequence":"first","affiliation":[]},{"given":"Matvey","family":"Soloviev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,6]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","DOI":"10.1002\/9781118033265","volume-title":"Foundations of Coding","author":"J Adamek","year":"1991","unstructured":"Adamek, J.: Foundations of Coding. Wiley, Hoboken (1991)"},{"issue":"2","key":"18_CR2","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF02579167","volume":"6","author":"M Blum","year":"1986","unstructured":"Blum, M.: Independent unbiased coin flips from a correlated biased source: a finite state Markov chain. Combinatorica 6(2), 97\u2013108 (1986)","journal-title":"Combinatorica"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"B\u00f6cherer, G., Ali Amjad, R.: Informational divergence and entropy rate on rooted trees with probabilities. In: Proceedings of the IEEE International Symposium on Information Theory (June 2014)","DOI":"10.1109\/ISIT.2014.6874818"},{"key":"18_CR4","volume-title":"A Course in Probability Theory","author":"KL Chung","year":"1974","unstructured":"Chung, K.L.: A Course in Probability Theory, 2nd edn. Academic Press, Cambridge (1974)","edition":"2"},{"key":"18_CR5","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"TM Cover","year":"1991","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley-Interscience, Hoboken (1991)"},{"key":"18_CR6","series-title":"Studies in Informatics","doi-asserted-by":"publisher","DOI":"10.1201\/9781584889427","volume-title":"Stochastic Relations: Foundations for Markov Transition Systems","author":"E-E Doberkat","year":"2007","unstructured":"Doberkat, E.-E.: Stochastic Relations: Foundations for Markov Transition Systems. Studies in Informatics. Chapman Hall, London (2007)"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-540-27821-4_30","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"Y Dodis","year":"2004","unstructured":"Dodis, Y., Elbaz, A., Oliveira, R., Raz, R.: Improved randomness extraction from two independent sources. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) APPROX\/RANDOM -2004. LNCS, vol. 3122, pp. 334\u2013344. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27821-4_30"},{"issue":"3","key":"18_CR8","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1214\/aoms\/1177692552","volume":"43","author":"P Elias","year":"1992","unstructured":"Elias, P.: The efficient construction of an unbiased random sequence. Ann. Math. Stat. 43(3), 865\u2013870 (1992)","journal-title":"Ann. Math. Stat."},{"key":"18_CR9","volume-title":"An Introduction to Probability Theory and Its Applications","author":"W Feller","year":"1971","unstructured":"Feller, W.: An Introduction to Probability Theory and Its Applications, vol. 1, 2nd edn. Wiley, Hoboken (1971)","edition":"2"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Hirschler, T., Woess, W.: Comparing entropy rates on finite and infinite rooted trees with length functions. IEEE Trans. Inf. Theory (2017)","DOI":"10.1109\/TIT.2017.2787712"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Kozen, D., Soloviev, M.: Coalgebraic tools for randomness-conserving protocols. Technical report, Cornell, July 2018. https:\/\/arxiv.org\/abs\/1807.02735","DOI":"10.1007\/978-3-030-02149-8_18"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1006\/jcss.1997.1546","volume":"58","author":"N Nisan","year":"1999","unstructured":"Nisan, N., Ta-shma, A.: Extracting randomness: a survey and new constructions. J. Comput. Syst. Sci. 58, 148\u2013173 (1999)","journal-title":"J. Comput. Syst. Sci."},{"key":"18_CR13","unstructured":"Pae, S., Loui, M.C.: Optimal random number generation from a biased coin. In: Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms, Vancouver, Canada, pp. 1079\u20131088, January 2005"},{"issue":"11","key":"18_CR14","doi-asserted-by":"publisher","first-page":"4965","DOI":"10.1109\/TIT.2006.883555","volume":"52","author":"S Pae","year":"2006","unstructured":"Pae, S., Loui, M.C.: Randomizing functions: Simulation of discrete probability distribution using a source of unknown distribution. Trans. Inf. Theory 52(11), 4965\u20134976 (2006)","journal-title":"Trans. Inf. Theory"},{"key":"18_CR15","doi-asserted-by":"publisher","DOI":"10.1142\/p595","volume-title":"Labelled Markov Processes","author":"P Panangaden","year":"2009","unstructured":"Panangaden, P.: Labelled Markov Processes. Imperial College Press, London (2009)"},{"issue":"1","key":"18_CR16","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1214\/aos\/1176348543","volume":"20","author":"Y Peres","year":"1992","unstructured":"Peres, Y.: Iterating von Neumann\u2019s procedure for extracting random bits. Ann. Stat. 20(1), 590\u2013597 (1992)","journal-title":"Ann. Stat."},{"issue":"6","key":"18_CR17","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/s00493-005-0043-1","volume":"25","author":"Y Peres","year":"2005","unstructured":"Peres, Y., Mossel, E., Hillar, C.: New coins from old: computing with unknown bias. Combinatorica 25(6), 707\u2013724 (2005)","journal-title":"Combinatorica"},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1137\/S009753979630091X","volume":"28","author":"A Srinivasan","year":"1999","unstructured":"Srinivasan, A., Zuckerman, D.: Computing with very weak random sources. SIAM J. Comput. 28, 264\u2013275 (1999)","journal-title":"SIAM J. Comput."},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Ta-shma, A.: On extracting randomness from weak random sources. In: Proceedings of the 28th ACM Symposium Theory of Computing, pp. 276\u2013285 (1996)","DOI":"10.1145\/237814.237877"}],"container-title":["Lecture Notes in Computer Science","Relational and Algebraic Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-02149-8_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,25]],"date-time":"2019-10-25T11:07:48Z","timestamp":1572001668000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-02149-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030021481","9783030021498"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-02149-8_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"RAMiCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Relational and Algebraic Methods in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Groningen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ramics2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ramics-conference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"30","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"70% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"4.06","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"4.17","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"1 full invited talk","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}