Near-Optimal Bounds for Adversarial Wake-up in Distributed Networks

Authors: Robinson, Peter, Tan, Ming Ming

Source: Proceedings of the 38th ACM Symposium on Parallelism in Algorithms and Architectures. :355-365

Availability: http://dl.acm.org/doi/10.1145/3816782.3819199

A tight meta-theorem for LOCAL certification of MSO2 properties within bounded treewidth graphs

Authors: Cook, Linda, Kim, Eun Jung, Masařík, Tomáš

Source: Proceedings of the ACM Symposium on Principles of Distributed Computing. :110-120

Availability: http://dl.acm.org/doi/10.1145/3732772.3733562

Tight bounds on the message complexity of distributed tree verification

Authors: Kutten, Shay, Robinson, Peter, Tan, Ming Ming

Contributors: Shay Kutten and Peter Robinson and Ming Ming Tan

Source: Distributed Computing. 38:113-130

Subject Terms: FOS: Computer and information sciences, Distributed Graph Algorithm, message complexity, Lower Bound, Communication complexity, information complexity, Computer Science - Distributed, Parallel, and Cluster Computing, Graph theory (including graph drawing) in computer science, distributed graph verification, Computer Science - Data Structures and Algorithms, Distributed algorithms, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing (cs.DC), lower bound, distributed minimum spanning tree

File Description: application/xml; application/pdf

Access URL: http://arxiv.org/abs/2401.11991
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2023.26

Fast All-Pairs Shortest Paths Algorithm in Large Sparse Graph

Authors: Yang, Shaofeng, Liu, Xiandong, Wang, Yunting, He, Xin, Tan, Guangming

Source: Proceedings of the 37th International Conference on Supercomputing. :277-288

Availability: http://dl.acm.org/doi/10.1145/3577193.3593728

Brief Announcement: What Can We Compute in a Single Round of the Congested Clique?

Authors: Robinson, Peter

Source: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing. :168-171

Availability: http://dl.acm.org/doi/10.1145/3583668.3594575

An O(n2) Self-Stabilizing Algorithm for Minimal Total Dominating Set in Arbitrary Graphs

Authors: Ding, Yihua, Wang, James Z, srimani, Pradip K

Source: 2020 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT) WI-IAT Web Intelligence and Intelligent Agent Technology (WI-IAT), 2020 IEEE/WIC/ACM International Joint Conference on. :49-54 Dec, 2020

Relation: 2020 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT)

Brief Announcement: Perfect Matching with Few Link Activations

Authors: Mirault, Hugo^Aff10, Robinson, Peter^Aff10, Tan, Ming Ming^Aff10, Zhu, Xianbin^Aff11

Contributors: Goos, Gerhard, Series Editor^{Aff1, Aff3}, Hartmanis, Juris, Founding Editor^Aff2, Bertino, Elisa, Editorial Board Member^Aff4, Gao, Wen, Editorial Board Member^Aff5, Steffen, Bernhard, Editorial Board Member^Aff6, Yung, Moti, Editorial Board Member^Aff7, Schmid, Ulrich, editor^Aff8, Kuznets, Roman, editor^Aff9

Source: Structural Information and Communication Complexity : 32nd International Colloquium, SIROCCO 2025, Delphi, Greece, June 2–4, 2025, Proceedings. 15671:437-443

A distributed approach to weighted frequent Subgraph mining

Authors: Babu, Nisha, John, Ansamma

Source: 2016 International Conference on Emerging Technological Trends (ICETT) Emerging Technological Trends (ICETT), International Conference on. :1-7 Oct, 2016

Relation: 2016 International Conference on Emerging Technological Trends (ICETT)

Dynamic Maximal Matching in Clique Networks

Authors: Li, Minming, Robinson, Peter, Zhu, Xianbin

Contributors: Minming Li and Peter Robinson and Xianbin Zhu

Source: CoRR.

Subject Terms: FOS: Computer and information sciences, maximal matching, Computer Science - Distributed, Parallel, and Cluster Computing, distributed graph algorithm, Computer Science - Data Structures and Algorithms, dynamic network, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing (cs.DC), lower bound, randomized algorithm

File Description: application/pdf

Access URL: http://arxiv.org/abs/2401.15550
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.73

A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching

Authors: KITAMURA, Naoki, IZUMI, Taisuke

Source: IEICE Transactions on Information and Systems. :634-645

Subject Terms: FOS: Computer and information sciences, maximum matching, Computer Science - Distributed, Parallel, and Cluster Computing, distributed graph algorithm, Distributed, Parallel, and Cluster Computing (cs.DC), 0102 computer and information sciences, congest model, 01 natural sciences

Access URL: https://www.jstage.jst.go.jp/article/transinf/E105.D/3/E105.D_2021EDP7083/_pdf
http://arxiv.org/abs/2104.12057
https://arxiv.org/abs/2104.12057

The Message Complexity of Distributed Graph Optimization

Authors: Dufoulon, Fabien, Pai, Shreyas, Pandurangan, Gopal, Pemmaraju, Sriram V., Robinson, Peter

Contributors: Fabien Dufoulon and Shreyas Pai and Gopal Pandurangan and Sriram V. Pemmaraju and Peter Robinson

Subject Terms: Distributed graph algorithm, message complexity, distributed approximation

File Description: application/pdf

Relation: Is Part Of LIPIcs, Volume 287, 15th Innovations in Theoretical Computer Science Conference (ITCS 2024); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.41

Availability: https://doi.org/10.4230/LIPIcs.ITCS.2024.41
https://nbn-resolving.org/urn:nbn:de:0030-drops-195690
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.41

Tight Bounds on the Message Complexity of Distributed Tree Verification

Authors: Kutten, Shay, Robinson, Peter, Tan, Ming Ming

Contributors: Shay Kutten and Peter Robinson and Ming Ming Tan

Subject Terms: Distributed Graph Algorithm, Lower Bound

File Description: application/pdf

Relation: Is Part Of LIPIcs, Volume 286, 27th International Conference on Principles of Distributed Systems (OPODIS 2023); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2023.26

Availability: https://doi.org/10.4230/LIPIcs.OPODIS.2023.26
https://nbn-resolving.org/urn:nbn:de:0030-drops-195163
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2023.26

Distributed Sketching Lower Bounds for k-Edge Connected Spanning Subgraphs, BFS Trees, and LCL Problems

Authors: Robinson, Peter

Contributors: Peter Robinson

Subject Terms: Distributed graph algorithm, graph sketching, streaming

File Description: application/pdf

Relation: Is Part Of LIPIcs, Volume 281, 37th International Symposium on Distributed Computing (DISC 2023); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.32

Availability: https://doi.org/10.4230/LIPIcs.DISC.2023.32
https://nbn-resolving.org/urn:nbn:de:0030-drops-191589
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.32

The Message Complexity of Distributed Graph Optimization

Authors: Dufoulon, Fabien, Pai, Shreyas, Pandurangan, Gopal, Pemmaraju, Sriram, Robinson, Peter

Contributors: Fabien Dufoulon and Shreyas Pai and Gopal Pandurangan and Sriram V. Pemmaraju and Peter Robinson, Guruswami, Venkatesan, Department of Computer Science, Lancaster University, University of Houston, University of Iowa, Augusta University, Aalto-yliopisto, Aalto University

Source: CoRR.

Subject Terms: distributed approximation, FOS: Computer and information sciences, message complexity, Computer Science - Distributed, Parallel, and Cluster Computing, Distributed graph algorithm, Distributed, Parallel, and Cluster Computing (cs.DC)

File Description: application/pdf

Access URL: http://arxiv.org/abs/2311.14811
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.41
https://aaltodoc.aalto.fi/handle/123456789/130419

Low diameter graph decompositions by approximate distance computation

Authors: Becker R., Emek Y., Lenzen C.

Contributors: Becker, R., Emek, Y., Lenzen, C.

Subject Terms: (semi-)streaming graph algorithm, Distributed graph algorithm, Graph decomposition, Metric tree embedding, Parallel graph algorithms, Settore INF/01 - Informatica

Relation: ispartofbook:Leibniz International Proceedings in Informatics, LIPIcs; 11th Innovations in Theoretical Computer Science Conference, ITCS 2020; volume:151; serie:LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS; https://hdl.handle.net/10278/5029564

Availability: https://hdl.handle.net/10278/5029564
https://doi.org/10.4230/LIPIcs.ITCS.2020.50

Distributed algorithms for low stretch spanning trees

Authors: Becker R., Emek Y., Ghaffari M., Lenzen C.

Contributors: Becker, R., Emek, Y., Ghaffari, M., Lenzen, C.

Subject Terms: Ball decomposition, CONGEST model, Distributed graph algorithm, Low-stretch spanning tree, Star decomposition, Settore INF/01 - Informatica

Relation: ispartofbook:Leibniz International Proceedings in Informatics, LIPIcs; 33rd International Symposium on Distributed Computing, DISC 2019; volume:146; serie:LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS; https://hdl.handle.net/10278/5029572

Availability: https://hdl.handle.net/10278/5029572
https://doi.org/10.4230/LIPIcs.DISC.2019.4

Distributed Graph Algorithms

Authors: Raynal, Michel^Aff1

Contributors: Raynal, Michel^Aff2

Source: Distributed Algorithms for Message-Passing Systems. :35-58

About randomised distributed graph colouring and graph partition algorithms

Authors: Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari

Contributors: Zemmari, Akka, Métivier, Yves

Source: Information and Computation. 208:1296-1304

Subject Terms: Probabilistic analysis, randomised distributed graph algorithm, Graph Partition, graph partition, Bit complexity, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Probabilistic Analysis, Theoretical Computer Science, colouring, Graph algorithms (graph-theoretic aspects), [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0202 electrical engineering, electronic engineering, information engineering, Bit Complexity, Randomized algorithms, probabilistic analysis, Computer Science Applications, [INFO.INFO-OH] Computer Science [cs]/Other [cs.OH], Randomised Distributed Graph Algorithm, bit complexity, Graph partition, Computational Theory and Mathematics, Randomised distributed graph algorithm, Graph theory (including graph drawing) in computer science, Colouring, Information Systems

File Description: application/xml

An optimal bit complexity randomized distributed MIS algorithm

Authors: Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari

Contributors: Métivier, Yves, Zemmari, Akka

Source: Distributed Computing. 23:331-340

Subject Terms: Distributed graph algorithm, Randomized algorithms, 0102 computer and information sciences, 02 engineering and technology, maximal independent set, Distributed systems, 01 natural sciences, randomized algorithm, [INFO.INFO-OH] Computer Science [cs]/Other [cs.OH], bit complexity, Graph theory (including graph drawing) in computer science, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0202 electrical engineering, electronic engineering, information engineering, Distributed algorithms

File Description: application/xml

Access URL: https://zbmath.org/6003848
https://doi.org/10.1007/s00446-010-0121-5
https://hal.science/hal-00370970v1
https://hal.science/hal-00517361v1

Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions

Authors: Becker, Ruben, Emek, Yuval, Ghaffari, Mohsen, Lenzen, Christoph

Contributors: Becker, Ruben, Emek, Yuval, Ghaffari, Mohsen, Lenzen, Christoph

Subject Terms: distributed graph algorithm, parallel graph algorithm, (semi-)streaming graph algorithm, metric tree embedding, low-stretch tree, graph decompositions, Settore INF/01 - Informatica

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:001185608700001; volume:53; issue:2; firstpage:247; lastpage:286; numberofpages:40; journal:SIAM JOURNAL ON COMPUTING; https://hdl.handle.net/10278/5068732

Availability: https://hdl.handle.net/10278/5068732
https://doi.org/10.1137/22m1489034