Optimizing the Critical Path of Distributed Dataflow Graph Algorithms

Συγγραφείς: Durrman, Dante, Saule, Erik

Πηγή: 2023 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) IPDPSW Parallel and Distributed Processing Symposium Workshops (IPDPSW), 2023 IEEE International. :898-904 May, 2023

Relation: 2023 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)

Distributed Maximal Independent Set Computation in Hundred Billion-Edge Graphs

Συγγραφείς: Liu, Yisheng, Pearce, Roger, Reza, Tahsin

Πηγή: 2026 25th International Symposium on Parallel and Distributed Computing (ISPDC) ISPDC Parallel and Distributed Computing (ISPDC), 2026 25th International Symposium on. :93-102 Jul, 2026

Relation: 2026 25th International Symposium on Parallel and Distributed Computing (ISPDC)

About randomised distributed graph colouring and graph partition algorithms

Συγγραφείς: Métivier, Y. ^⁎, Robson, J.M., Saheb-Djahromi, N., Zemmari, A.

Πηγή: In Information and Computation 2010 208(11):1296-1304

Distributed Graph Realizations

Συγγραφείς: Augustine, J., Choudhary, K., Cohen, A., Peleg, D., Sivasubramaniam, S., Sourav, S.

Πηγή: IEEE Transactions on Parallel and Distributed Systems IEEE Trans. Parallel Distrib. Syst. Parallel and Distributed Systems, IEEE Transactions on. 33(6):1321-1337 Jun, 2022

On the time and the bit complexity of distributed randomised anonymous ring colouring

Συγγραφείς: Métivier, Y., Robson, J.M., Saheb-Djahromi, N., Zemmari, A. ^⁎

Πηγή: In Theoretical Computer Science 2 September 2013 502:64-75

Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization

Συγγραφείς: Chang, Yi-Jun, Saranurak, Thatchaphol

Πηγή: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) FOCS Foundations of Computer Science (FOCS), 2020 IEEE 61st Annual Symposium on. :377-388 Nov, 2020

Relation: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)

A distributed gradient algorithm based on randomized block-coordinate and projection-free over networks

Συγγραφείς: Junlong Zhu, Xin Wang, Mingchuan Zhang, Muhua Liu, Qingtao Wu

Πηγή: Complex & Intelligent Systems, Vol 9, Iss 1, Pp 267-283 (2022)

Θεματικοί όροι: Block-coordinate descent, Computational complexity, Frank–Wolfe algorithm, Huge-scale optimization, Electronic computers. Computer science, QA75.5-76.95, Information technology, T58.5-58.64

Περιγραφή αρχείου: electronic resource

Relation: https://doaj.org/toc/2199-4536; https://doaj.org/toc/2198-6053

Σύνδεσμος πρόσβασης: https://doaj.org/article/5807c383284647558f25c9c193a692f9

Fast distributed algorithms for connectivity and MST in Large Graphs

Συγγραφείς: Pandurangan, G., Author, Robinson, P., Author, Scquizzato, Michele, Author

Συνεισφορές: Pandurangan, G., Author, Robinson, P., Author, Scquizzato, Michele, Author

Πηγή: ACM Transactions on Parallel Computing. 5(1):1-22

Θεματικοί όροι: Distributed graph algorithms, Graph connectivity, Graph sketching, Minimum spanning trees, Distributed computer systems, Algorithmic foundations, Communication complexity, Connectivity algorithms, Poly-logarithmic factors, Trees (mathematics)

Περιγραφή αρχείου: print

Σύνδεσμος πρόσβασης: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-314288

Distributed Lower Bounds for Ruling Sets

Συγγραφείς: Balliu, Alkida, Brandt, Sebastian, Olivetti, Dennis

Πηγή: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) FOCS Foundations of Computer Science (FOCS), 2020 IEEE 61st Annual Symposium on. :365-376 Nov, 2020

Relation: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)

Local certification of graphs with bounded genus

Συγγραφείς: Feuilloley, Laurent ^{a, ⁎, 1}, Fraigniaud, Pierre ^{b, 2}, Montealegre, Pedro ^{c, 3}, Rapaport, Ivan ^{d, 4}, Rémila, Éric ^{e, 5}, Todinca, Ioan ^f

Πηγή: In Discrete Applied Mathematics 30 January 2023 325:9-36

An analysis of load-balancing algorithms on edge-Markovian evolving graphs

Συγγραφείς: Shiraga, Takeharu ^{a, ⁎}, Kijima, Shuji ^b

Πηγή: In Journal of Computer and System Sciences September 2026 160

Fast algorithms for Vizing's theorem on bounded degree graphs

Συγγραφείς: Bernshteyn, Anton ^a, Dhawan, Abhishek ^b

Πηγή: In Journal of Combinatorial Theory, Series B November 2025 175:69-125

Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition

Συγγραφείς: Ghaffari, Mohsen, Kuhn, Fabian

Πηγή: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) FOCS Foundations of Computer Science (FOCS), 2021 IEEE 62nd Annual Symposium on. :1009-1020 Feb, 2022

Relation: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)

Optimal deterministic distributed algorithms for maximal independent set in geometric graphs

Συγγραφείς: Molla, Anisur Rahaman ^{a, 1}, Pandit, Supantha ^{b, ⁎, 2}, Roy, Sasanka ^c

Πηγή: In Journal of Parallel and Distributed Computing October 2019 132:36-47

Sampling and output estimation in distributed algorithms and LCAs

Συγγραφείς: Barenboim, Leonid ^{a, ⁎}, Maimon, Tzalik ^b

Πηγή: In Theoretical Computer Science 28 August 2025 1046

A note on the network coloring game: A randomized distributed (Δ + 1)-coloring algorithm

Συγγραφείς: Fryganiotis, Nikolaos, Papavassiliou, Symeon, Pelekis, Christos ^⁎

Πηγή: In Information Processing Letters August 2023 182

Patterns from nature: Distributed greedy colouring with simple messages and minimal graph knowledge

Συγγραφείς: Xu, Lei ^{a, b}, Jeavons, Peter ^{b, ⁎}

Πηγή: In Information Sciences 20 September 2015 316:550-566

A randomized algorithm for the joining protocol in dynamic distributed networks

Συγγραφείς: Cooper, Colin ^a, Klasing, Ralf ^{b, ⁎}, Radzik, Tomasz ^a

Πηγή: In Theoretical Computer Science 2008 406(3):248-262

Randomized algorithms and upper bounds for multiple domination in graphs and networks

Συγγραφείς: Gagarin, Andrei ^a, Poghosyan, Anush ^b, Zverovich, Vadim ^{b, ⁎}

Πηγή: In Discrete Applied Mathematics March 2013 161(4-5):604-611

A simple randomized scheme for constructing low-weight [formula omitted]-connected spanning subgraphs with applications to distributed algorithms

Συγγραφείς: Khan, Maleq ^{a, ⁎}, Pandurangan, Gopal ^a, Anil Kumar, V.S. ^b

Πηγή: In Theoretical Computer Science 2007 385(1):101-114