{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T21:06:17Z","timestamp":1762808777140,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,16]],"date-time":"2019-07-16T00:00:00Z","timestamp":1563235200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSERC","award":["Discovery Grant","Canada Graduate Scholarship"],"award-info":[{"award-number":["Discovery Grant","Canada Graduate Scholarship"]}]},{"name":"University of Liverpool","award":["Initiative Network Sciences and Technologies"],"award-info":[{"award-number":["Initiative Network Sciences and Technologies"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7,16]]},"DOI":"10.1145\/3293611.3331608","type":"proceedings-article","created":{"date-parts":[[2019,7,19]],"date-time":"2019-07-19T13:17:21Z","timestamp":1563542241000},"page":"4-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Symmetry Breaking in the Plane"],"prefix":"10.1145","author":[{"given":"Jurek","family":"Czyzowicz","sequence":"first","affiliation":[{"name":"Universit\u00e9 du Qu\u00e9bec en Outaouais, Gatineau, PQ, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leszek","family":"Gasieniec","sequence":"additional","affiliation":[{"name":"University of Liverpool, Liverpool, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryan","family":"Killick","sequence":"additional","affiliation":[{"name":"Carleton University, Ottawa, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evangelos","family":"Kranakis","sequence":"additional","affiliation":[{"name":"Carleton University, Ottawa, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,7,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012993249195"},{"key":"e_1_3_2_1_2_1","volume-title":"Institut f\u00fcr H\u00f6here Studien","author":"Alpern S.","year":"1976","unstructured":"S. Alpern . Hide and seek games, Seminar , Institut f\u00fcr H\u00f6here Studien , Wien , 26 July , 1976 . S. Alpern. Hide and seek games, Seminar, Institut f\u00fcr H\u00f6here Studien, Wien, 26 July, 1976."},{"key":"e_1_3_2_1_3_1","volume-title":"The theory of search games and rendezvous","author":"Alpern S.","year":"2002","unstructured":"S. Alpern and S. Gal . The theory of search games and rendezvous , volume 55 . Kluwer Academic Publishers , 2002 . S. Alpern and S. Gal. The theory of search games and rendezvous, volume 55. Kluwer Academic Publishers, 2002."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.49.1.107.11191"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-005-1223-5"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2018.01.003"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25258-2_22"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11672142_45"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1880999.1881054"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02124750"},{"key":"e_1_3_2_1_11_1","volume-title":"OPODIS Conference on Principles of Distributed Systems","author":"Czyzowicz J.","year":"2018","unstructured":"J. Czyzowicz , R. Killick , and E. Kranakis . Linear rendezvous with asymmetric clocks . In OPODIS Conference on Principles of Distributed Systems , 17-19 December 2018 , Hong Kong. LIPICS , 2018. J. Czyzowicz, R. Killick, and E. Kranakis. Linear rendezvous with asymmetric clocks. In OPODIS Conference on Principles of Distributed Systems, 17-19 December 2018, Hong Kong. LIPICS, 2018."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01325-7_30"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-011-0141-9"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2344422.2344427"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-015-9982-0"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/130931990"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.12.035"},{"key":"e_1_3_2_1_18_1","volume-title":"Inequalities on the Lambert W function and hyperpower function. JIPAM. Journal of Inequalities in Pure & Applied Mathematics {electronic only}, 9, 01","author":"Hoorfar A.","year":"2008","unstructured":"A. Hoorfar and M. Hassani . Inequalities on the Lambert W function and hyperpower function. JIPAM. Journal of Inequalities in Pure & Applied Mathematics {electronic only}, 9, 01 2008 . A. Hoorfar and M. Hassani. Inequalities on the Lambert W function and hyperpower function. JIPAM. Journal of Inequalities in Pure & Applied Mathematics {electronic only}, 9, 01 2008."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/2393794.2393820"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/100797916"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1007\/978-3-540-72951-8_22","volume-title":"International Colloquium on Structural Information and Communication Complexity","author":"Katayama Y.","year":"2007","unstructured":"Y. Katayama , Y. Tomida , H. Imazu , N. Inuzuka , and K. Wada . Dynamic compass models and gathering algorithms for autonomous mobile robots . In International Colloquium on Structural Information and Communication Complexity , pages 274 -- 288 . Springer , 2007 . Y. Katayama, Y. Tomida, H. Imazu, N. Inuzuka, and K. Wada. Dynamic compass models and gathering algorithms for autonomous mobile robots. In International Colloquium on Structural Information and Communication Complexity, pages 274--288. Springer, 2007."},{"key":"e_1_3_2_1_22_1","volume-title":"Proceedings of Moving and Computing","author":"King P.","year":"2017","unstructured":"P. King and F. M. auf der Heide. Continuous protocols for swarm robotics . In Proceedings of Moving and Computing , 5-9 June , 2017 . La Maddalena, Italy. Springer , 2017. P. King and F. M. auf der Heide. Continuous protocols for swarm robotics. In Proceedings of Moving and Computing, 5-9 June, 2017. La Maddalena, Italy. Springer, 2017."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/1855017"},{"key":"e_1_3_2_1_24_1","first-page":"182","volume-title":"International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics","author":"Li S.","year":"2017","unstructured":"S. Li , C. Markarian , F. M. auf der Heide, and P. Podlipyan. A continuous strategy for collisionless gathering . In International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics , pages 182 -- 197 . Springer , 2017 . S. Li, C. Markarian, F. M. auf der Heide, and P. Podlipyan. A continuous strategy for collisionless gathering. In International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, pages 182--197. Springer, 2017."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2018.04.006"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/978-3-030-11072-7_17","volume-title":"Distributed Computing by Mobile Entities","author":"Pelc A.","year":"2019","unstructured":"A. Pelc . Deterministic Rendezvous Algorithms . In P. Flocchini, G. Prencipe, and N. Santoro, editors, Distributed Computing by Mobile Entities , pages 423 -- 454 . Springer , 2019 . A. Pelc. Deterministic Rendezvous Algorithms . In P. Flocchini, G. Prencipe, and N. Santoro, editors, Distributed Computing by Mobile Entities, pages 423--454. Springer, 2019."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2601068"}],"event":{"name":"PODC '19: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Toronto ON Canada","acronym":"PODC '19"},"container-title":["Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3293611.3331608","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3293611.3331608","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:02Z","timestamp":1750208522000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3293611.3331608"}},"subtitle":["Rendezvous by Robots with Unknown Attributes"],"short-title":[],"issued":{"date-parts":[[2019,7,16]]},"references-count":27,"alternative-id":["10.1145\/3293611.3331608","10.1145\/3293611"],"URL":"https:\/\/doi.org\/10.1145\/3293611.3331608","relation":{},"subject":[],"published":{"date-parts":[[2019,7,16]]},"assertion":[{"value":"2019-07-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}