New techniques and tighter bounds for local computation algorithms-Reference-Cited by-同舟云学术

New techniques and tighter bounds for local computation algorithms

Author:

Reingold Omer,Vardi Shai

Funder

Google Europe Fellowship in Game Theory

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science

Reference37 articles.

1. Space-efficient local computation algorithms;Alon,2012

2. Balanced allocations;Azar;SIAM J. Comput.,1999

3. Compressed representations of permutations, and applications;Barbay,2009

4. The locality of distributed symmetry breaking;Barenboim,2012

5. Balls into non-uniform bins;Berenbrink;J. Parallel Distrib. Comput.,2014

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

1. Local Computation Algorithms for Maximum Matching: New Lower Bounds;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

2. Dynamic (1+ϵ)-Approximate Matching Size in Truly Sublinear Update Time;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

3. Agnostic proper learning of monotone functions: beyond the black-box correction barrier;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

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

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