Best of two local models: Centralized local and distributed local algorithms-Reference-Cited by-同舟云学术

Best of two local models: Centralized local and distributed local algorithms

Author:

Even Guy,Medina Moti,Ron Dana

Funder

Israeli Ministry of Science and Technology

Israel Science Foundation

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference32 articles.

1. Constant-time approximation algorithms via local improvements;Nguyen,2008

2. Deterministic stateless centralized local algorithms for bounded degree graphs;Even,2014

3. Distributed maximum matching in bounded degree graphs;Even,2015

4. Fast local computation algorithms;Rubinfeld,2011

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

1. Average Sensitivity of Graph Algorithms;SIAM Journal on Computing;2023-08-14

2. Local Computation of Maximal Independent Set;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10

3. Error-sensitive proof-labeling schemes;Journal of Parallel and Distributed Computing;2022-08

5. Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems;Proceedings of the 39th Symposium on Principles of Distributed Computing;2020-07-31