{"scopus_import":"1","article_processing_charge":"No","acknowledgement":"This work was partially funded by National Supercomputing Mission, Govt. of India under the project “Concurrent and Distributed Programming primitives and algorithms for Temporal Graphs”(DST/NSM/R&D_Exascale/2021/16).\r\n","title":"Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds","date_updated":"2021-11-12T09:42:55Z","month":"10","type":"conference","citation":{"apa":"Chatterjee, B., Peri, S., &#38; Sa, M. (2021). Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds. In <i>35th International Symposium on Distributed Computing</i> (Vol. 209). Freiburg, Germany: Schloss Dagstuhl - Leibniz Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2021.52\">https://doi.org/10.4230/LIPIcs.DISC.2021.52</a>","chicago":"Chatterjee, Bapi, Sathya Peri, and Muktikanta Sa. “Brief Announcement: Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds.” In <i>35th International Symposium on Distributed Computing</i>, Vol. 209. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2021.52\">https://doi.org/10.4230/LIPIcs.DISC.2021.52</a>.","mla":"Chatterjee, Bapi, et al. “Brief Announcement: Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds.” <i>35th International Symposium on Distributed Computing</i>, vol. 209, 52, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2021.52\">10.4230/LIPIcs.DISC.2021.52</a>.","short":"B. Chatterjee, S. Peri, M. Sa, in:, 35th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.","ista":"Chatterjee B, Peri S, Sa M. 2021. Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds. 35th International Symposium on Distributed Computing. DISC: Distributed Computing, LIPIcs, vol. 209, 52.","ama":"Chatterjee B, Peri S, Sa M. Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds. In: <i>35th International Symposium on Distributed Computing</i>. Vol 209. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2021.52\">10.4230/LIPIcs.DISC.2021.52</a>","ieee":"B. Chatterjee, S. Peri, and M. Sa, “Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds,” in <i>35th International Symposium on Distributed Computing</i>, Freiburg, Germany, 2021, vol. 209."},"has_accepted_license":"1","date_created":"2021-11-07T23:01:23Z","article_number":"52","status":"public","department":[{"_id":"DaAl"}],"oa_version":"Published Version","publication_identifier":{"issn":["1868-8969"],"isbn":["9-783-9597-7210-5"]},"year":"2021","ddc":["000"],"abstract":[{"text":"This paper reports a new concurrent graph data structure that supports updates of both edges and vertices and queries: Breadth-first search, Single-source shortest-path, and Betweenness centrality. The operations are provably linearizable and non-blocking.","lang":"eng"}],"publisher":"Schloss Dagstuhl - Leibniz Zentrum für Informatik","external_id":{"arxiv":["2003.01697"]},"volume":209,"alternative_title":["LIPIcs"],"_id":"10216","doi":"10.4230/LIPIcs.DISC.2021.52","author":[{"first_name":"Bapi","last_name":"Chatterjee","full_name":"Chatterjee, Bapi","id":"3C41A08A-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Peri","full_name":"Peri, Sathya","first_name":"Sathya"},{"last_name":"Sa","full_name":"Sa, Muktikanta","first_name":"Muktikanta"}],"conference":{"location":"Freiburg, Germany","end_date":"2021-10-08","name":"DISC: Distributed Computing","start_date":"2021-10-04"},"publication":"35th International Symposium on Distributed Computing","day":"04","publication_status":"published","date_published":"2021-10-04T00:00:00Z","file":[{"date_created":"2021-11-12T09:23:22Z","success":1,"checksum":"76546df112a0ba1166c864d33d7834e2","file_id":"10276","relation":"main_file","access_level":"open_access","file_name":"2021_LIPIcsDISC_BChatterjee.pdf","date_updated":"2021-11-12T09:23:22Z","file_size":795860,"creator":"cchlebak","content_type":"application/pdf"}],"file_date_updated":"2021-11-12T09:23:22Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"oa":1,"quality_controlled":"1","language":[{"iso":"eng"}],"intvolume":"       209"}