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

Συγγραφείς: Robinson, Peter, Tan, Ming Ming

Πηγή: Proceedings of the 38th ACM Symposium on Parallelism in Algorithms and Architectures. :355-365

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3816782.3819199

A Distributed Graph Algorithm for Discovering Unique Behavioral Groups from Large-Scale Telco Data

Συγγραφείς: Ho, Qirong, Lin, Wenqing, Shaham, Eran, Krishnaswamy, Shonali, Dang, The Anh, Wang, Jingxuan, Zhongyan, Isabel Choo, She-Nash, Amy

Πηγή: Proceedings of the 25th ACM International on Conference on Information and Knowledge Management. :1353-1362

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/2983323.2983354

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

Συγγραφείς: Cook, Linda, Kim, Eun Jung, Masařík, Tomáš

Πηγή: Proceedings of the ACM Symposium on Principles of Distributed Computing. :110-120

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3732772.3733562

A distributed graph algorithm for the detection of local cycles and knots

Συγγραφείς: Boukerche, A., Tropper, C.

Πηγή: IEEE Transactions on Parallel and Distributed Systems IEEE Trans. Parallel Distrib. Syst. Parallel and Distributed Systems, IEEE Transactions on. 9(8):748-757 Aug, 1998

An Examination of a Symmetric Memory Model's Impact on Performance in a Distributed Graph Algorithm

Συγγραφείς: Ing, Michael C

Όροι ευρετηρίου: University of Pittsburgh ETD, PeerReviewed

Σύνδεσμος: https://d-scholarship.pitt.edu/40405/1/ingmc_etdPitt2021.pdf
https://worldcat.org/search?q=on:PIT+http://d-scholarship.pitt.edu/cgi/oai2+DCG_ENTIRE_REPOSITORY+CNTCOLL
https://d-scholarship.pitt.edu/40405/
https://d-scholarship.pitt.edu/40405

A Message-Optimal Distributed Graph Algorithm: Partial Precedence Constrained Scheduling

Συγγραφείς: Chaudhuri,Pranay, Thompson,Hussein

Πηγή: JUCS-Journal of Universal Computer Science 10(2): 106-119

Θεματικοί όροι: distributed algorithm, task, 0202 electrical engineering, electronic engineering, information engineering, scheduling, 0102 computer and information sciences, 02 engineering and technology, directed graph, 01 natural sciences, precedence constraints

Περιγραφή αρχείου: text/html

Tight bounds on the message complexity of distributed tree verification

Συγγραφείς: Kutten, Shay, Robinson, Peter, Tan, Ming Ming

Συνεισφορές: Shay Kutten and Peter Robinson and Ming Ming Tan

Πηγή: Distributed Computing. 38:113-130

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/xml; application/pdf

Σύνδεσμος πρόσβασης: 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

Συγγραφείς: Yang, Shaofeng, Liu, Xiandong, Wang, Yunting, He, Xin, Tan, Guangming

Πηγή: Proceedings of the 37th International Conference on Supercomputing. :277-288

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3577193.3593728

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

Συγγραφείς: Robinson, Peter

Πηγή: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing. :168-171

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3583668.3594575

A Distributed Graph Algorithm: Knot Detection

Συγγραφείς: Misra, Jayadev, Chandy, K. M.

Πηγή: ACM Transactions on Programming Languages and Systems (TOPLAS). 4(4):678-686

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/69622.357190

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

Συγγραφείς: Ding, Yihua, Wang, James Z, srimani, Pradip K

Πηγή: 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

Συγγραφείς: Mirault, Hugo^Aff10, Robinson, Peter^Aff10, Tan, Ming Ming^Aff10, Zhu, Xianbin^Aff11

Συνεισφορές: 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

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

A Distributed Graph Algorithm for Geometric Routing in Ad Hoc Wireless Networks

Συγγραφείς: Rashid Bin Muhammad

Πηγή: Journal of Networks. 2

Θεματικοί όροι: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

A distributed approach to weighted frequent Subgraph mining

Συγγραφείς: Babu, Nisha, John, Ansamma

Πηγή: 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

Συγγραφείς: Li, Minming, Robinson, Peter, Zhu, Xianbin

Συνεισφορές: Minming Li and Peter Robinson and Xianbin Zhu

Πηγή: CoRR.

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: 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

Συγγραφείς: KITAMURA, Naoki, IZUMI, Taisuke

Πηγή: IEICE Transactions on Information and Systems. :634-645

Θεματικοί όροι: 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

Σύνδεσμος πρόσβασης: 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

Συγγραφείς: Dufoulon, Fabien, Pai, Shreyas, Pandurangan, Gopal, Pemmaraju, Sriram V., Robinson, Peter

Συνεισφορές: Fabien Dufoulon and Shreyas Pai and Gopal Pandurangan and Sriram V. Pemmaraju and Peter Robinson

Θεματικοί όροι: Distributed graph algorithm, message complexity, distributed approximation

Περιγραφή αρχείου: 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

Διαθεσιμότητα: 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

Συγγραφείς: Kutten, Shay, Robinson, Peter, Tan, Ming Ming

Συνεισφορές: Shay Kutten and Peter Robinson and Ming Ming Tan

Θεματικοί όροι: Distributed Graph Algorithm, Lower Bound

Περιγραφή αρχείου: 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

Διαθεσιμότητα: 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

A General Distributed Graph Algorithm for Fair Access to Critical Sections

Συγγραφείς: Horst F. Wedde

Πηγή: Distributed Algorithms on Graphs ISBN: 9780773573475

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

Συγγραφείς: Robinson, Peter

Συνεισφορές: Peter Robinson

Θεματικοί όροι: Distributed graph algorithm, graph sketching, streaming

Περιγραφή αρχείου: 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

Διαθεσιμότητα: 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