{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:14:55Z","timestamp":1750306495382,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,11,24]],"date-time":"2015-11-24T00:00:00Z","timestamp":1448323200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,11,24]]},"DOI":"10.1145\/2814576.2814804","type":"proceedings-article","created":{"date-parts":[[2015,11,30]],"date-time":"2015-11-30T19:03:51Z","timestamp":1448910231000},"page":"100-111","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["EpTO"],"prefix":"10.1145","author":[{"given":"Miguel","family":"Matos","sequence":"first","affiliation":[{"name":"HASLab -- INESC TEC & University of Minho, Portugal"}]},{"given":"Hugues","family":"Mercier","sequence":"additional","affiliation":[{"name":"Institute of Computer Science, University of Neuch\u00e2tel, Switzerland"}]},{"given":"Pascal","family":"Felber","sequence":"additional","affiliation":[{"name":"Institute of Computer Science, University of Neuch\u00e2tel, Switzerland"}]},{"given":"Rui","family":"Oliveira","sequence":"additional","affiliation":[{"name":"HASLab -- INESC TEC & University of Minho, Portugal"}]},{"given":"Jos\u00e9","family":"Pereira","sequence":"additional","affiliation":[{"name":"HASLab -- INESC TEC & University of Minho, Portugal"}]}],"member":"320","published-online":{"date-parts":[[2015,11,24]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"R.\n      Baldoni R.\n      Guerraoui R. R.\n      Levy V.\n      Qu\u00e9ma and \n      S. T.\n      Piergiovanni\n  . \n  Unconscious eventual consistency with gossips\n  . In A. K. Datta and M. Gradinariu editors Stabilization Safety and Security of Distributed Systems 8th International Symposium SSS \n  2006 Dallas TX USA November 17-19 2006 Proceedings volume \n  4280\n   of \n  Lecture Notes in Computer Science pages \n  65\n  --\n  81\n  . \n  Springer 2006.   R. Baldoni R. Guerraoui R. R. Levy V. Qu\u00e9ma and S. T. Piergiovanni. Unconscious eventual consistency with gossips. In A. K. Datta and M. Gradinariu editors Stabilization Safety and Security of Distributed Systems 8th International Symposium SSS 2006 Dallas TX USA November 17-19 2006 Proceedings volume 4280 of Lecture Notes in Computer Science pages 65--81. Springer 2006.","key":"e_1_3_2_1_1_1","DOI":"10.1007\/978-3-540-49823-0_5"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/312203.312207"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/343477.343502"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1109\/DSN.2007.40"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1145\/234533.234549"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1145\/226643.226647"},{"key":"e_1_3_2_1_7_1","first-page":"552","volume-title":"Concurrency Theory","author":"Charron-Bost B.","year":"2000","unstructured":"B. Charron-Bost , S. Toueg , and A. Basu . Revisiting safety and liveness in the context of failures . In Concurrency Theory , pages 552 -- 565 . Springer-Verlag , Aug. 2000 . B. Charron-Bost, S. Toueg, and A. Basu. Revisiting safety and liveness in the context of failures. In Concurrency Theory, pages 552--565. Springer-Verlag, Aug. 2000."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1145\/2491245"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1145\/1041680.1041682"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/41840.41841"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/945506.945507"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.5555\/829526.831138"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1145\/564585.564601"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.5555\/1032662.1034350"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1145\/1275517.1275520"},{"key":"e_1_3_2_1_18_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/978-3-540-24768-5_25","volume-title":"Computational Science and Its Applications - ICCSA","author":"Kim C.","year":"2004","unstructured":"C. Kim , J. Ahn , and C. Hwang . Gossip based causal order broadcast algorithm . In A. Lagan\u00e1, M. L. Gavrilova, V. Kumar, Y. Mun, C. J. K. Tan, and O. Gervasi, editors, Computational Science and Its Applications - ICCSA 2004 , International Conference, Assisi, Italy , May 14-17, 2004, Proceedings, Part IV, volume 3046 of Lecture Notes in Computer Science , pages 233 -- 242 . Springer , 2004. C. Kim, J. Ahn, and C. Hwang. Gossip based causal order broadcast algorithm. In A. Lagan\u00e1, M. L. Gavrilova, V. Kumar, Y. Mun, C. J. K. Tan, and O. Gervasi, editors, Computational Science and Its Applications - ICCSA 2004, International Conference, Assisi, Italy, May 14-17, 2004, Proceedings, Part IV, volume 3046 of Lecture Notes in Computer Science, pages 233--242. Springer, 2004."},{"key":"e_1_3_2_1_19_1","first-page":"109","volume-title":"Studia Informatica Universalis","author":"Koldehofe B.","year":"2002","unstructured":"B. Koldehofe . Simple gossiping with balls and bins . In Studia Informatica Universalis , pages 109 -- 118 , 2002 . B. Koldehofe. Simple gossiping with balls and bins. In Studia Informatica Universalis, pages 109--118, 2002."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1145\/359545.359563"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.5555\/2022090.2022111"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1109\/SRDS.2014.34"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1016\/S0304-3975(01)00397-8"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1145\/1057977.1057980"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.5555\/829526.831136"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1145\/1177080.1177105"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1145\/1435417.1435432"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.1007\/s10922-005-4441-x"}],"event":{"sponsor":["ACM Association for Computing Machinery","USENIX Assoc USENIX Assoc","IFIP International Federation for Information Processing"],"acronym":"Middleware '15","name":"Middleware '15: 16th International Middleware Conference","location":"Vancouver BC Canada"},"container-title":["Proceedings of the 16th Annual Middleware Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2814576.2814804","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2814576.2814804","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:48:42Z","timestamp":1750225722000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2814576.2814804"}},"subtitle":["An Epidemic Total Order Algorithm for Large-Scale Distributed Systems"],"short-title":[],"issued":{"date-parts":[[2015,11,24]]},"references-count":26,"alternative-id":["10.1145\/2814576.2814804","10.1145\/2814576"],"URL":"https:\/\/doi.org\/10.1145\/2814576.2814804","relation":{},"subject":[],"published":{"date-parts":[[2015,11,24]]},"assertion":[{"value":"2015-11-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}