Near-Optimal Scheduling of Distributed Algorithms-Reference-Cited by-同舟云学术

Near-Optimal Scheduling of Distributed Algorithms

Published:2015-07-21 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing
language:
Short-container-title:

Author:

Ghaffari Mohsen¹

Affiliation:

1. MIT, Cambridge, MA, USA

Funder

AFOSR

NSF

Simon's Institute for the Theory of Computing

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/2767386.2767417

Reference36 articles.

1. Lecture notes on Algorithmic Power Tools. http://www.ccs.neu.edu/home/rraj/Courses/7880/F09/Lectures/GeneralLLL_Apps.pdf. Accessed: 2015-02. Lecture notes on Algorithmic Power Tools. http://www.ccs.neu.edu/home/rraj/Courses/7880/F09/Lectures/GeneralLLL_Apps.pdf. Accessed: 2015-02.

2. Lecture notes on Algorithmic Power Tools. http://www.ccs.neu.edu/home/rraj/Courses/7880/F09/Lectures/PacketRouting.pdf. Accessed: 2015-02. Lecture notes on Algorithmic Power Tools. http://www.ccs.neu.edu/home/rraj/Courses/7880/F09/Lectures/PacketRouting.pdf. Accessed: 2015-02.

3. Lecture notes on k-wise uniform (randomness) generators. http://pages.cs.wisc.edu/~dieter/Courses/2013s-CS880/Scribes/PDF/lecture04.pdf. Accessed: 2015-02. Lecture notes on k-wise uniform (randomness) generators. http://pages.cs.wisc.edu/~dieter/Courses/2013s-CS880/Scribes/PDF/lecture04.pdf. Accessed: 2015-02.

4. Lecture notes on Randomized Algorithms and Probabilistic Analysis. http://courses.cs.washington.edu/courses/cse525/13sp/scribe/lec10.pdf. Accessed: 2015-02. Lecture notes on Randomized Algorithms and Probabilistic Analysis. http://courses.cs.washington.edu/courses/cse525/13sp/scribe/lec10.pdf. Accessed: 2015-02.

5. Lecture notes on Randomness and Computation. http://www.cs.berkeley.edu/~sinclair/cs271/n22.pdf. Accessed: 2015-02. Lecture notes on Randomness and Computation. http://www.cs.berkeley.edu/~sinclair/cs271/n22.pdf. Accessed: 2015-02.

Cited by 28 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Fast Broadcast in Highly Connected Networks;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17

2. A Near-Optimal Low-Energy Deterministic Distributed SSSP with Ramifications on Congestion and APSP;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17

3. Deterministic Expander Routing: Faster and More Versatile;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17

4. Polylog-Competitive Deterministic Local Routing and Scheduling;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

5. Secure Computation Meets Distributed Universal Optimality;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06