{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:12:17Z","timestamp":1759637537194,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":59,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T00:00:00Z","timestamp":1625529600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"publisher","award":["755839"],"award-info":[{"award-number":["755839"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,6]]},"DOI":"10.1145\/3409964.3461798","type":"proceedings-article","created":{"date-parts":[[2021,6,30]],"date-time":"2021-06-30T23:07:02Z","timestamp":1625094422000},"page":"151-161","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["On Sparsity Awareness in Distributed Computations"],"prefix":"10.1145","author":[{"given":"Keren","family":"Censor-Hillel","sequence":"first","affiliation":[{"name":"Technion, Haifa, Israel"}]},{"given":"Dean","family":"Leitersdorf","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}]},{"given":"Volodymyr","family":"Polosukhin","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}]}],"member":"320","published-online":{"date-parts":[[2021,7,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Amir Abboud Keren Censor-Hillel and Seri Khoury. 2016. Near-Linear Lower Bounds for Distributed Distance Computations Even in Sparse Networks. In DISC.  Amir Abboud Keren Censor-Hillel and Seri Khoury. 2016. Near-Linear Lower Bounds for Distributed Distance Computations Even in Sparse Networks. In DISC.","DOI":"10.1007\/978-3-662-53426-7_3"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Udit Agarwal and Vijaya Ramachandran. 2019. Distributed Weighted All Pairs Shortest Paths Through Pipelining. In IPDPS.  Udit Agarwal and Vijaya Ramachandran. 2019. Distributed Weighted All Pairs Shortest Paths Through Pipelining. In IPDPS.","DOI":"10.1109\/IPDPS.2019.00014"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Udit Agarwal and Vijaya Ramachandran. 2020. Faster Deterministic All Pairs Shortest Paths in Congest Model. In SPAA.  Udit Agarwal and Vijaya Ramachandran. 2020. Faster Deterministic All Pairs Shortest Paths in Congest Model. In SPAA.","DOI":"10.1145\/3350755.3400256"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Udit Agarwal Vijaya Ramachandran Valerie King and Matteo Pontecorvi. 2018. A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in O (n ^3\/2 ) Rounds. In PODC.  Udit Agarwal Vijaya Ramachandran Valerie King and Matteo Pontecorvi. 2018. A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in O (n ^3\/2 ) Rounds. In PODC.","DOI":"10.1145\/3212734.3212773"},{"key":"e_1_3_2_1_5_1","unstructured":"Bertie Ancona Keren Censor-Hillel Mina Dalirrooyfard Yuval Efron and Virginia Vassilevska Williams. 2020. Distributed Distance Approximation. In OPODIS.  Bertie Ancona Keren Censor-Hillel Mina Dalirrooyfard Yuval Efron and Virginia Vassilevska Williams. 2020. Distributed Distance Approximation. In OPODIS."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"John Augustine Keerti Choudhary Avi Cohen David Peleg Sumathi Sivasubramaniam and Suman Sourav. 2020 a. Distributed Graph Realizations textdagger. In IPDPS.  John Augustine Keerti Choudhary Avi Cohen David Peleg Sumathi Sivasubramaniam and Suman Sourav. 2020 a. Distributed Graph Realizations textdagger. In IPDPS.","DOI":"10.1109\/IPDPS47924.2020.00026"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"John Augustine Mohsen Ghaffari Robert Gmyr Kristian Hinnenthal Christian Scheideler Fabian Kuhn and Jason Li. 2019. Distributed Computation in Node-Capacitated Networks. In SPAA.  John Augustine Mohsen Ghaffari Robert Gmyr Kristian Hinnenthal Christian Scheideler Fabian Kuhn and Jason Li. 2019. Distributed Computation in Node-Capacitated Networks. In SPAA.","DOI":"10.1145\/3323165.3323195"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"John Augustine Kristian Hinnenthal Fabian Kuhn Christian Scheideler and Philipp Schneider. 2020 b. Shortest Paths in a Hybrid Network Model. In SODA.  John Augustine Kristian Hinnenthal Fabian Kuhn Christian Scheideler and Philipp Schneider. 2020 b. Shortest Paths in a Hybrid Network Model. In SODA.","DOI":"10.1137\/1.9781611975994.78"},{"key":"e_1_3_2_1_9_1","volume-title":"Ivan Rapaport, and Eric R\u00e9 mila.","author":"Becker Florent","year":"2015","unstructured":"Florent Becker , Antonio Fern\u00e1 ndez Anta , Ivan Rapaport, and Eric R\u00e9 mila. 2015 . Brief Announcement : A Hierarchy of Congested Clique Models, from Broadcast to Unicast. In PODC. Florent Becker, Antonio Fern\u00e1 ndez Anta, Ivan Rapaport, and Eric R\u00e9 mila. 2015. Brief Announcement: A Hierarchy of Congested Clique Models, from Broadcast to Unicast. In PODC."},{"key":"e_1_3_2_1_10_1","volume-title":"Ivan Rapaport, and Eric R\u00e9 mila.","author":"Becker Florent","year":"2016","unstructured":"Florent Becker , Antonio Fern\u00e1 ndez Anta , Ivan Rapaport, and Eric R\u00e9 mila. 2016 . The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model. In COCOON. Florent Becker, Antonio Fern\u00e1 ndez Anta, Ivan Rapaport, and Eric R\u00e9 mila. 2016. The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model. In COCOON."},{"key":"e_1_3_2_1_11_1","unstructured":"Ruben Becker Andreas Karrenbauer Sebastian Krinninger and Christoph Lenzen. 2017. Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models. In DISC.  Ruben Becker Andreas Karrenbauer Sebastian Krinninger and Christoph Lenzen. 2017. Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models. In DISC."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Aaron Bernstein and Danupon Nanongkai. 2019. Distributed exact weighted all-pairs shortest paths in near-linear time. In STOC.  Aaron Bernstein and Danupon Nanongkai. 2019. Distributed exact weighted all-pairs shortest paths in near-linear time. In STOC.","DOI":"10.1145\/3313276.3316326"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Keren Censor-Hillel Yi-Jun Chang Francc ois Le Gall and Dean Leitersdorf. 2021 a. Tight Distributed Listing of Cliques. In SODA.  Keren Censor-Hillel Yi-Jun Chang Francc ois Le Gall and Dean Leitersdorf. 2021 a. Tight Distributed Listing of Cliques. In SODA.","DOI":"10.1137\/1.9781611976465.171"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Keren Censor-Hillel Michal Dory Janne H. Korhonen and Dean Leitersdorf. 2019 a. Fast Approximate Shortest Paths in the Congested Clique. In PODC.  Keren Censor-Hillel Michal Dory Janne H. Korhonen and Dean Leitersdorf. 2019 a. Fast Approximate Shortest Paths in the Congested Clique. In PODC.","DOI":"10.1145\/3293611.3331633"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Keren Censor-Hillel Francc ois Le Gall and Dean Leitersdorf. 2020 a. On Distributed Listing of Cliques. In PODC.  Keren Censor-Hillel Francc ois Le Gall and Dean Leitersdorf. 2020 a. On Distributed Listing of Cliques. In PODC.","DOI":"10.1145\/3382734.3405742"},{"key":"e_1_3_2_1_16_1","unstructured":"Keren Censor-Hillel Petteri Kaski Janne H. Korhonen Christoph Lenzen Ami Paz and Jukka Suomela. 2019 b. Algebraic methods in the congested clique. Distributed Comput. (2019).  Keren Censor-Hillel Petteri Kaski Janne H. Korhonen Christoph Lenzen Ami Paz and Jukka Suomela. 2019 b. Algebraic methods in the congested clique. Distributed Comput. (2019)."},{"key":"e_1_3_2_1_17_1","unstructured":"Keren Censor-Hillel Seri Khoury and Ami Paz. 2017. Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model. In DISC.  Keren Censor-Hillel Seri Khoury and Ami Paz. 2017. Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model. In DISC."},{"key":"e_1_3_2_1_18_1","unstructured":"Keren Censor-Hillel Dean Leitersdorf and Volodymyr Polosukhin. 2021 b. Distance Computations in the Hybrid Network Model via Oracle Simulations. In STACS.  Keren Censor-Hillel Dean Leitersdorf and Volodymyr Polosukhin. 2021 b. Distance Computations in the Hybrid Network Model via Oracle Simulations. In STACS."},{"key":"e_1_3_2_1_19_1","unstructured":"Keren Censor-Hillel Dean Leitersdorf and Volodymyr Polosukhin. 2021. On Sparsity Awareness in Distributed Computations. arxiv: 2105.06068 [cs.DC] hrefhttps:\/\/arxiv.org\/abs\/2105.06068nolinkurlarXiv:2105.06068.  Keren Censor-Hillel Dean Leitersdorf and Volodymyr Polosukhin. 2021. On Sparsity Awareness in Distributed Computations. arxiv: 2105.06068 [cs.DC] hrefhttps:\/\/arxiv.org\/abs\/2105.06068nolinkurlarXiv:2105.06068."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Keren Censor-Hillel Dean Leitersdorf and Elia Turner. 2020 b. Sparse matrix multiplication and triangle listing in the Congested Clique model. Theor. Comput. Sci. (2020).  Keren Censor-Hillel Dean Leitersdorf and Elia Turner. 2020 b. Sparse matrix multiplication and triangle listing in the Congested Clique model. Theor. Comput. Sci. (2020).","DOI":"10.1016\/j.tcs.2019.11.006"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Yi-Jun Chang Seth Pettie and Hengjie Zhang. 2019. Distributed Triangle Detection via Expander Decomposition. In SODA.  Yi-Jun Chang Seth Pettie and Hengjie Zhang. 2019. Distributed Triangle Detection via Expander Decomposition. In SODA.","DOI":"10.1137\/1.9781611975482.51"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Yi-Jun Chang and Thatchaphol Saranurak. 2019. Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration. In PODC.  Yi-Jun Chang and Thatchaphol Saranurak. 2019. Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration. In PODC.","DOI":"10.1145\/3293611.3331618"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Yi-Jun Chang and Thatchaphol Saranurak. 2020. Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization. In FOCS.  Yi-Jun Chang and Thatchaphol Saranurak. 2020. Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization. In FOCS.","DOI":"10.1109\/FOCS46700.2020.00043"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Shiri Chechik and Doron Mukhtar. 2020. Single-Source Shortest Paths in the CONGEST Model with Improved Bound. In PODC.  Shiri Chechik and Doron Mukhtar. 2020. Single-Source Shortest Paths in the CONGEST Model with Improved Bound. In PODC.","DOI":"10.1145\/3382734.3405729"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Yong Cui Hongyi Wang and Xiuzhen Cheng. 2011. Channel allocation in wireless data center networks. In INFOCOM.  Yong Cui Hongyi Wang and Xiuzhen Cheng. 2011. Channel allocation in wireless data center networks. In INFOCOM.","DOI":"10.1109\/INFCOM.2011.5934925"},{"key":"e_1_3_2_1_26_1","volume-title":"Ser. B","author":"Dinitz Michael","year":"2020","unstructured":"Michael Dinitz , Michael Schapira , and Gal Shahaf . 2020. Approximate Moore Graphs are good expanders. J. Comb. Theory , Ser. B ( 2020 ). Michael Dinitz, Michael Schapira, and Gal Shahaf. 2020. Approximate Moore Graphs are good expanders. J. Comb. Theory, Ser. B (2020)."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Michal Dory and Merav Parter. 2020. Exponentially Faster Shortest Paths in the Congested Clique. In PODC.  Michal Dory and Merav Parter. 2020. Exponentially Faster Shortest Paths in the Congested Clique. In PODC.","DOI":"10.1145\/3382734.3405711"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Andrew Drucker Fabian Kuhn and Rotem Oshman. 2014. On the power of the congested clique model. In PODC.  Andrew Drucker Fabian Kuhn and Rotem Oshman. 2014. On the power of the congested clique model. In PODC.","DOI":"10.1145\/2611462.2611493"},{"key":"e_1_3_2_1_29_1","unstructured":"Talya Eden Nimrod Fiat Orr Fischer Fabian Kuhn and Rotem Oshman. 2019. Sublinear-Time Distributed Algorithms for Detecting Small Cliques and Even Cycles. In DISC.  Talya Eden Nimrod Fiat Orr Fischer Fabian Kuhn and Rotem Oshman. 2019. Sublinear-Time Distributed Algorithms for Detecting Small Cliques and Even Cycles. In DISC."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Michael Elkin. 2017. Distributed exact shortest paths in sublinear time. In STOC.  Michael Elkin. 2017. Distributed exact shortest paths in sublinear time. In STOC.","DOI":"10.1145\/3055399.3055452"},{"key":"e_1_3_2_1_31_1","unstructured":"Michael Feldmann Kristian Hinnenthal and Christian Scheideler. 2020. Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs. In OPODIS.  Michael Feldmann Kristian Hinnenthal and Christian Scheideler. 2020. Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs. In OPODIS."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Sebastian Forster and Danupon Nanongkai. 2018. A Faster Distributed Single-Source Shortest Paths Algorithm. In FOCS.  Sebastian Forster and Danupon Nanongkai. 2018. A Faster Distributed Single-Source Shortest Paths Algorithm. In FOCS.","DOI":"10.1109\/FOCS.2018.00071"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Silvio Frischknecht Stephan Holzer and Roger Wattenhofer. 2012. Networks cannot compute their diameter in sublinear time. In SODA.  Silvio Frischknecht Stephan Holzer and Roger Wattenhofer. 2012. Networks cannot compute their diameter in sublinear time. In SODA.","DOI":"10.1137\/1.9781611973099.91"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Francc ois Le Gall. 2016. Further Algebraic Algorithms in the Congested Clique Model and Applications to Graph-Theoretic Problems. In DISC.  Francc ois Le Gall. 2016. Further Algebraic Algorithms in the Congested Clique Model and Applications to Graph-Theoretic Problems. In DISC.","DOI":"10.1007\/978-3-662-53426-7_5"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Mohsen Ghaffari and Bernhard Haeupler. 2016a. Distributed Algorithms for Planar Networks I: Planar Embedding. In PODC.  Mohsen Ghaffari and Bernhard Haeupler. 2016a. Distributed Algorithms for Planar Networks I: Planar Embedding. In PODC.","DOI":"10.1145\/2933057.2933109"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Mohsen Ghaffari and Bernhard Haeupler. 2016b. Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts MST and Min-Cut. In SODA.  Mohsen Ghaffari and Bernhard Haeupler. 2016b. Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts MST and Min-Cut. In SODA.","DOI":"10.1145\/2933057.2933109"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Mohsen Ghaffari Fabian Kuhn and Hsin-Hao Su. 2017. Distributed MST and Routing in Almost Mixing Time. In PODC.  Mohsen Ghaffari Fabian Kuhn and Hsin-Hao Su. 2017. Distributed MST and Routing in Almost Mixing Time. In PODC.","DOI":"10.1145\/3087801.3087827"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","unstructured":"Mohsen Ghaffari and Jason Li. 2018a. Improved distributed algorithms for exact shortest paths. In STOC.  Mohsen Ghaffari and Jason Li. 2018a. Improved distributed algorithms for exact shortest paths. In STOC.","DOI":"10.1145\/3188745.3188948"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","unstructured":"Mohsen Ghaffari and Jason Li. 2018b. New Distributed Algorithms in Almost Mixing Time via Transformations from Parallel Algorithms. In DISC.  Mohsen Ghaffari and Jason Li. 2018b. New Distributed Algorithms in Almost Mixing Time via Transformations from Parallel Algorithms. In DISC.","DOI":"10.1145\/3087801.3087827"},{"key":"e_1_3_2_1_40_1","unstructured":"Ofer Grossman Seri Khoury and Ami Paz. 2020. Improved Hardness of Approximation of Diameter in the CONGEST Model. In DISC.  Ofer Grossman Seri Khoury and Ami Paz. 2020. Improved Hardness of Approximation of Diameter in the CONGEST Model. In DISC."},{"key":"e_1_3_2_1_41_1","volume-title":"RUSH: Routing and scheduling for hybrid data center networks. In INFOCOM.","author":"Han Kai","year":"2015","unstructured":"Kai Han , Zhiming Hu , Jun Luo , and Liu Xiang . 2015 . RUSH: Routing and scheduling for hybrid data center networks. In INFOCOM. Kai Han, Zhiming Hu, Jun Luo, and Liu Xiang. 2015. RUSH: Routing and scheduling for hybrid data center networks. In INFOCOM."},{"key":"e_1_3_2_1_42_1","volume-title":"Inderdeep Singh, and Philip Brighten Godfrey.","author":"Harsh Vipul","year":"2018","unstructured":"Vipul Harsh , Sangeetha Abdu Jyothi , Inderdeep Singh, and Philip Brighten Godfrey. 2018 . Expander Datacenters : From Theory to Practice. CoRR ( 2018). Vipul Harsh, Sangeetha Abdu Jyothi, Inderdeep Singh, and Philip Brighten Godfrey. 2018. Expander Datacenters: From Theory to Practice. CoRR (2018)."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"crossref","unstructured":"Monika Henzinger Sebastian Krinninger and Danupon Nanongkai. 2016. A deterministic almost-tight distributed algorithm for approximating single-source shortest paths. In STOC.  Monika Henzinger Sebastian Krinninger and Danupon Nanongkai. 2016. A deterministic almost-tight distributed algorithm for approximating single-source shortest paths. In STOC.","DOI":"10.1145\/2897518.2897638"},{"key":"e_1_3_2_1_44_1","unstructured":"Stephan Holzer and Nathan Pinsker. 2015. Approximation of Distances and Shortest Paths in the Broadcast Congest Clique. In OPODIS.  Stephan Holzer and Nathan Pinsker. 2015. Approximation of Distances and Shortest Paths in the Broadcast Congest Clique. In OPODIS."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"crossref","unstructured":"Stephan Holzer and Roger Wattenhofer. 2012. Optimal distributed all pairs shortest paths and applications. In PODC.  Stephan Holzer and Roger Wattenhofer. 2012. Optimal distributed all pairs shortest paths and applications. In PODC.","DOI":"10.1145\/2332432.2332504"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"crossref","unstructured":"He Huang Xiangke Liao Shanshan Li Shaoliang Peng Xiaodong Liu and Bin Lin. 2013. The architecture and traffic management of wireless collaborated hybrid data center network. In SIGCOMM.  He Huang Xiangke Liao Shanshan Li Shaoliang Peng Xiaodong Liu and Bin Lin. 2013. The architecture and traffic management of wireless collaborated hybrid data center network. In SIGCOMM.","DOI":"10.1145\/2486001.2491724"},{"key":"e_1_3_2_1_47_1","volume-title":"Francc ois Le Gall, and Fr\u00e9 d\u00e9 ric Magniez","author":"Izumi Taisuke","year":"2020","unstructured":"Taisuke Izumi , Francc ois Le Gall, and Fr\u00e9 d\u00e9 ric Magniez . 2020 . Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model. In STACS. Taisuke Izumi, Francc ois Le Gall, and Fr\u00e9 d\u00e9 ric Magniez. 2020. Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model. In STACS."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"crossref","unstructured":"Fabian Kuhn and Philipp Schneider. 2020. Computing Shortest Paths and Diameter in the Hybrid Network Model. In PODC.  Fabian Kuhn and Philipp Schneider. 2020. Computing Shortest Paths and Diameter in the Hybrid Network Model. In PODC.","DOI":"10.1145\/3382734.3405719"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"crossref","unstructured":"Christoph Lenzen and Boaz Patt-Shamir. 2013. Fast routing table construction using small messages: extended abstract. In STOC.  Christoph Lenzen and Boaz Patt-Shamir. 2013. Fast routing table construction using small messages: extended abstract. In STOC.","DOI":"10.1145\/2488608.2488656"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"crossref","unstructured":"Christoph Lenzen and Boaz Patt-Shamir. 2015. Fast Partial Distance Estimation and Applications. In PODC.  Christoph Lenzen and Boaz Patt-Shamir. 2015. Fast Partial Distance Estimation and Applications. In PODC.","DOI":"10.1145\/2767386.2767398"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"crossref","unstructured":"Christoph Lenzen and David Peleg. 2013. Efficient distributed source detection with limited bandwidth. In PODC.  Christoph Lenzen and David Peleg. 2013. Efficient distributed source detection with limited bandwidth. In PODC.","DOI":"10.1145\/2484239.2484262"},{"key":"e_1_3_2_1_52_1","unstructured":"Jason Li and Merav Parter. 2019. Planar diameter via metric compression. In STOC.  Jason Li and Merav Parter. 2019. Planar diameter via metric compression. In STOC."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"crossref","unstructured":"Danupon Nanongkai. 2014. Distributed approximation algorithms for weighted shortest paths. In STOC.  Danupon Nanongkai. 2014. Distributed approximation algorithms for weighted shortest paths. In STOC.","DOI":"10.1145\/2591796.2591850"},{"key":"e_1_3_2_1_54_1","unstructured":"Merav Parter. 2020. Distributed Planar Reachability in Nearly Optimal Time. In DISC.  Merav Parter. 2020. Distributed Planar Reachability in Nearly Optimal Time. In DISC."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"crossref","unstructured":"David Peleg Liam Roditty and Elad Tal. 2012. Distributed Algorithms for Network Diameter and Girth. In ICALP (2).  David Peleg Liam Roditty and Elad Tal. 2012. Distributed Algorithms for Network Diameter and Girth. In ICALP (2).","DOI":"10.1007\/978-3-642-31585-5_58"},{"key":"e_1_3_2_1_57_1","series-title":"SIAM J. Comput. (2012)","volume-title":"Distributed Verification and Hardness of Distributed Approximation","author":"Sarma Atish Das","unstructured":"Atish Das Sarma , Stephan Holzer , Liah Kor , Amos Korman , Danupon Nanongkai , Gopal Pandurangan , David Peleg , and Roger Wattenhofer . 2012. Distributed Verification and Hardness of Distributed Approximation . SIAM J. Comput. (2012) . Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan, David Peleg, and Roger Wattenhofer. 2012. Distributed Verification and Hardness of Distributed Approximation. SIAM J. Comput. (2012)."},{"key":"e_1_3_2_1_58_1","volume-title":"Vu","author":"Su Hsin-Hao","year":"2020","unstructured":"Hsin-Hao Su and Hoa T . Vu . 2020 . Distributed Dense Subgraph Detection and Low Outdegree Orientation. In DISC. Hsin-Hao Su and Hoa T. Vu. 2020. Distributed Dense Subgraph Detection and Low Outdegree Orientation. In DISC."},{"key":"e_1_3_2_1_59_1","volume-title":"Ryan","author":"Wang Guohui","year":"2010","unstructured":"Guohui Wang , David G. Andersen , Michael Kaminsky , Konstantina Papagiannaki , T. S. Eugene Ng , Michael Kozuch , and Michael P . Ryan . 2010 . c-Through: part-time optics in data centers. In SIGCOMM. Guohui Wang, David G. Andersen, Michael Kaminsky, Konstantina Papagiannaki, T. S. Eugene Ng, Michael Kozuch, and Michael P. Ryan. 2010. c-Through: part-time optics in data centers. In SIGCOMM."}],"event":{"name":"SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Virtual Event USA","acronym":"SPAA '21"},"container-title":["Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3409964.3461798","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3409964.3461798","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:08Z","timestamp":1750191428000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3409964.3461798"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,6]]},"references-count":59,"alternative-id":["10.1145\/3409964.3461798","10.1145\/3409964"],"URL":"https:\/\/doi.org\/10.1145\/3409964.3461798","relation":{},"subject":[],"published":{"date-parts":[[2021,7,6]]},"assertion":[{"value":"2021-07-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}