{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T18:02:46Z","timestamp":1791309766212,"version":"4.3.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642108761","type":"print"},{"value":"9783642108778","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10877-8_5","type":"book-chapter","created":{"date-parts":[[2009,12,2]],"date-time":"2009-12-02T02:11:04Z","timestamp":1259719864000},"page":"33-47","source":"Crossref","is-referenced-by-count":11,"title":["Not All Fair Probabilistic Schedulers Are Equivalent"],"prefix":"10.1007","author":[{"given":"Ioannis","family":"Chatzigiannakis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shlomi","family":"Dolev","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S\u00e1ndor P.","family":"Fekete","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Othon","family":"Michail","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paul G.","family":"Spirakis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Angluin, D., Aspnes, J., Chan, M., Fischer, M.J., Jiang, H., Peralta, R.: Stably computable properties of network graphs. In: Proc. Distributed Computing in Sensor Systems: 1st IEEE International Conference, pp. 63\u201374 (2005)","DOI":"10.1007\/11502593_8"},{"key":"5_CR2","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1145\/1011767.1011810","volume-title":"23rd Annual ACM Symposium on Principles of Distributed Computing (PODC)","author":"D. Angluin","year":"2004","unstructured":"Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. In: 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 290\u2013299. ACM, New York (2004)"},{"issue":"4","key":"5_CR3","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00446-005-0138-3","volume":"18","author":"D. Angluin","year":"2006","unstructured":"Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distributed Computing\u00a018(4), 235\u2013253 (2006)","journal-title":"Distributed Computing"},{"issue":"3","key":"5_CR4","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s00446-008-0067-z","volume":"21","author":"D. Angluin","year":"2008","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D.: Fast computation by population protocols with a leader. Distributed Computing\u00a021(3), 183\u2013199 (2008)","journal-title":"Distributed Computing"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D.: Stably computable predicates are semilinear. In: Proc. 25th Annual ACM Symposium on Principles of Distributed Computing, pp. 292\u2013299 (2006)","DOI":"10.1145\/1146381.1146425"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-540-75142-7_5","volume-title":"Distributed Computing","author":"D. Angluin","year":"2007","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D.: A simple population protocol for fast robust approximate majority. In: Pelc, A. (ed.) DISC 2007. LNCS, vol.\u00a04731, pp. 20\u201332. Springer, Heidelberg (2007)"},{"key":"5_CR7","first-page":"98","volume":"93","author":"J. Aspnes","year":"2007","unstructured":"Aspnes, J., Ruppert, E.: An introduction to population protocols. Bulletin of the European Association for Theoretical Computer Science\u00a093, 98\u2013117 (2007); Columns: Distributed Computing. Mavronicolas, M. (ed.)","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/978-3-540-87779-0_35","volume-title":"Distributed Computing","author":"I. Chatzigiannakis","year":"2008","unstructured":"Chatzigiannakis, I., Spirakis, P.G.: The dynamics of probabilistic population protocols. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol.\u00a05218, pp. 498\u2013499. Springer, Heidelberg (2008)"},{"key":"#cr-split#-5_CR9.1","doi-asserted-by":"crossref","unstructured":"Chatzigiannakis, I., Michail, O., Spirakis, P.G.: Decidable Graph Languages by Mediated Population Protocols. In: 23nd International Symposium on Distributed Computing (DISC), Elche, Spain (September 2009);","DOI":"10.1007\/978-3-642-04355-0_24"},{"key":"#cr-split#-5_CR9.2","unstructured":"Also FRONTS Technical Report FRONTS-TR-2009-16, http:\/\/fronts.cti.gr\/aigaion\/?TR=80"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Chatzigiannakis, I., Michail, O., Spirakis, P.G.: Experimental verification and performance study of extremely large sized population protocols. FRONTS Technical Report FRONTS-TR-2009-3 (January 2009), http:\/\/fronts.cti.gr\/aigaion\/?TR=61","DOI":"10.1007\/978-3-642-03816-7_6"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Chatzigiannakis, I., Michail, O., Spirakis, P.G.: Mediated Population Protocols. In: 36th International Colloquium on Automata, Languages and Programming (ICALP), Rhodes, Greece, pp. 363\u2013374 (2009)","DOI":"10.1007\/978-3-642-02930-1_30"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Chatzigiannakis, I., Michail, O., Spirakis, P.G.: Recent Advances in Population Protocols. In: 34th International Symposium on Mathematical Foundations of Computer Science (MFCS), Novy Smokovec, High Tatras, Slovakia, August 24-28 (2009)","DOI":"10.1007\/978-3-642-03816-7_6"},{"key":"5_CR13","volume-title":"An Introduction to Probability Theory and Its Applications","author":"W. Feller","year":"1968","unstructured":"Feller, W.: An Introduction to Probability Theory and Its Applications, 3rd edn., vol.\u00a01. Wiley, Chichester (1968)","edition":"3"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Ruppert, E.: Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures. In: 36th International Colloquium on Automata, Languages and Programming (ICALP), Rhodes, Greece, pp. 484\u2013495 (2009)","DOI":"10.1007\/978-3-642-02930-1_40"},{"key":"5_CR15","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1017\/S0370164600020265","volume":"60","author":"W.H. McCrea","year":"1940","unstructured":"McCrea, W.H., Whipple, F.J.W.: Random Paths in Two and Three Dimensions. Proc. Roy. Soc. Edinburgh\u00a060, 281\u2013298 (1940)","journal-title":"Proc. Roy. Soc. Edinburgh"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/BF00265555","volume":"19","author":"J.P. Queille","year":"1983","unstructured":"Queille, J.P., Sifakis, J.: Fairness and Related Properties in Transition Systems - A temporal Logic to Deal with Fairness. Acta Informatica\u00a019, 195\u2013220 (1983)","journal-title":"Acta Informatica"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10877-8_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,15]],"date-time":"2021-10-15T01:41:27Z","timestamp":1634262087000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10877-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642108761","9783642108778"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10877-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}