{"status":"public","title":"Brief announcement: Sinkless orientation is hard also in the supported LOCAL model","quality_controlled":"1","alternative_title":["LIPIcs"],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_created":"2021-11-07T23:01:24Z","oa_version":"Published Version","oa":1,"scopus_import":"1","publisher":"Schloss Dagstuhl - Leibniz Zentrum für Informatik","publication_status":"published","date_published":"2021-10-04T00:00:00Z","abstract":[{"text":"We show that any algorithm that solves the sinkless orientation problem in the supported LOCAL model requires Ω(log n) rounds, and this is tight. The supported LOCAL is at least as strong as the usual LOCAL model, and as a corollary this also gives a new, short and elementary proof that shows that the round complexity of the sinkless orientation problem in the deterministic LOCAL model is Ω(log n).","lang":"eng"}],"department":[{"_id":"DaAl"}],"day":"04","license":"https://creativecommons.org/licenses/by/4.0/","type":"conference","file":[{"date_created":"2021-11-12T08:27:42Z","file_size":474242,"file_id":"10275","success":1,"date_updated":"2021-11-12T08:27:42Z","file_name":"2021_LIPIcsDISC_Korhonen.pdf","access_level":"open_access","creator":"cchlebak","content_type":"application/pdf","relation":"main_file","checksum":"c43188dc2070bbd2bf5fd6fdaf9ce36d"}],"date_updated":"2021-11-12T09:37:18Z","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"article_processing_charge":"No","month":"10","file_date_updated":"2021-11-12T08:27:42Z","acknowledgement":"Janne H. Korhonen: Project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML). Ami Paz: We acknowledge the Austrian Science Fund (FWF) and netIDEE SCIENCE project P 33775-N. Stefan Schmid: Research supported by the Austrian Science Fund (FWF) project ADVISE, I 4800-N, 2020-2023.\r\n","project":[{"call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223"}],"ddc":["000"],"volume":209,"intvolume":" 209","year":"2021","citation":{"ieee":"J. Korhonen, A. Paz, J. Rybicki, S. Schmid, and J. Suomela, “Brief announcement: Sinkless orientation is hard also in the supported LOCAL model,” in 35th International Symposium on Distributed Computing, Freiburg, Germany, 2021, vol. 209.","mla":"Korhonen, Janne, et al. “Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model.” 35th International Symposium on Distributed Computing, vol. 209, 58, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.DISC.2021.58.","short":"J. Korhonen, A. Paz, J. Rybicki, S. Schmid, J. Suomela, in:, 35th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.","ista":"Korhonen J, Paz A, Rybicki J, Schmid S, Suomela J. 2021. Brief announcement: Sinkless orientation is hard also in the supported LOCAL model. 35th International Symposium on Distributed Computing. DISC: Distributed Computing , LIPIcs, vol. 209, 58.","chicago":"Korhonen, Janne, Ami Paz, Joel Rybicki, Stefan Schmid, and Jukka Suomela. “Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model.” In 35th International Symposium on Distributed Computing, Vol. 209. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.DISC.2021.58.","apa":"Korhonen, J., Paz, A., Rybicki, J., Schmid, S., & Suomela, J. (2021). Brief announcement: Sinkless orientation is hard also in the supported LOCAL model. In 35th International Symposium on Distributed Computing (Vol. 209). Freiburg, Germany: Schloss Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2021.58","ama":"Korhonen J, Paz A, Rybicki J, Schmid S, Suomela J. Brief announcement: Sinkless orientation is hard also in the supported LOCAL model. In: 35th International Symposium on Distributed Computing. Vol 209. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.DISC.2021.58"},"conference":{"location":"Freiburg, Germany","end_date":"2021-10-08","name":"DISC: Distributed Computing ","start_date":"2021-10-04"},"ec_funded":1,"_id":"10219","article_number":"58","language":[{"iso":"eng"}],"has_accepted_license":"1","publication":"35th International Symposium on Distributed Computing","author":[{"full_name":"Korhonen, Janne","id":"C5402D42-15BC-11E9-A202-CA2BE6697425","first_name":"Janne","last_name":"Korhonen"},{"full_name":"Paz, Ami","last_name":"Paz","first_name":"Ami"},{"last_name":"Rybicki","first_name":"Joel","full_name":"Rybicki, Joel","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6432-6646"},{"first_name":"Stefan","last_name":"Schmid","full_name":"Schmid, Stefan"},{"first_name":"Jukka","last_name":"Suomela","full_name":"Suomela, Jukka"}],"doi":"10.4230/LIPIcs.DISC.2021.58","publication_identifier":{"issn":["1868-8969"],"isbn":["9-783-9597-7210-5"]},"external_id":{"arxiv":["2108.02655"]}}