Article

Free access

What can be computed locally?

Authors:

Moni Naor,

Larry StockmeyerAuthors Info & Claims

STOC '93: Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing

Pages 184 - 193

https://doi.org/10.1145/167088.167149

Published: 01 June 1993 Publication History

PDF eReader

References

[1]

L. Adleman, Two theorems on random polynomial time, Proc. 19th IEEE Syrup. on Foundations of Computer Science, 1978, pp. 75-83.

Digital Library

Google Scholar

[2]

Y. Afek, 2i. Kutten, and M. Yung, Local detection for global self stabilization, manuscript; preliminary version in Proc. 4th WDAG, LNCS 486, Springer-Verlag, 1991, pp. 15-28.

Digital Library

Google Scholar

[3]

B. Awerbuch, A.V. Goldberg, M. Luby, and S.A. Plotkin, Network decomposition and locality in distributed computation, Proc. 30th IEEE Syrup. on Foundations of Computer Science, 1989, pp. 364--369.

Digital Library

Google Scholar

[4]

K.M. Chandy and J. Misra, The drinking philosophers problem, A CM Trans. Programming Languages and Systems 6 (1984), pp. 632-646.

Digital Library

Google Scholar

[5]

M. Choy and A.K. Singh, Efficient fault tolerant algorithms for resource allocation in distributed systems, Proc. 24th A CM Syrup. on Theory o} Computing, 1992, pp. 593-602.

Digital Library

Google Scholar

[6]

R. Cole and U. Vishkin, Deterministic coin tossing with applications to optimal parallel list ranking, Information and Control 70 (1986), pp. 32-53.

Digital Library

Google Scholar

[7]

G.N. Frederickson and N.A. Lynch, Electing a leader in a synchronous ring, J. Assoc. Comput. Mach. 34 (1987), pp. 98-115.

Digital Library

Google Scholar

[8]

A.V. Goldberg, S.A. Plotkin, and G.E. Shannon, Parallel symmetry-breaking in sparse graphs, SIAM J. Discrete Math. 1 (1989), pp. 434-446.

Digital Library

Google Scholar

[9]

N. Linial, Locality in distributed graph algorithms, SIAM J. Comput. 21 (1992), pp. 193-201.

Digital Library

Google Scholar

[10]

N.A. Lynch, Upper bounds for static resource allocation in a distributed system, J. Comput. System Sci. 23 (1981), pp. 254-278.

Crossref

Google Scholar

[11]

S. Moran, M. Snir, and U. Manber, Applications of Ramsey's theorem to decision tree complexity, J. Assoc. Comput. Mach. 32 (1985), pp. 938-949.

Digital Library

Google Scholar

[12]

M. Naor and L. Stockmeyer, What can be computed locally?, IBM Research Report, in preparation.

Google Scholar

[13]

A. Panconesi and A. Srinivasan, Improved distributed algorithms for coloring and network decomposition problems, Proc. 24th A CM Syrup. on Theory of Computing, 1992, pp. 581-592.

Digital Library

Google Scholar

[14]

E. Styer and G.L. Peterson, Improved algorithms for distributed resource allocation, Proc. 7th ACM Symp. on Principles of Distributed Computing, 1988, pp. 105-116.

Digital Library

Google Scholar

[15]

A. C.-C. Yao, Should tables be sorted?, J. Assoc. Comput. Mach. 28 (1981), pp. 615-628.

Digital Library

Google Scholar

Cited By

View all

D’Inverno GBianchini MSampoli MScarselli F(2024)On the approximation capability of GNNs in node classification/regression tasksSoft Computing10.1007/s00500-024-09676-128:13-14(8527-8547)Online publication date: 5-Jul-2024
https://doi.org/10.1007/s00500-024-09676-1
Qiu ZYuan AChen CMarathe MRavi SRosenkrantz DStearns RVullikanti AAgmon NAn BRicci AYeoh W(2023)Assigning Agents to Increase Network-Based Neighborhood DiversityProceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems10.5555/3545946.3598690(600-608)Online publication date: 30-May-2023
https://dl.acm.org/doi/10.5555/3545946.3598690
Agrawal AAugustine JPeleg DRamachandran SOshman RNolin AHalldorsson MBalliu A(2023)Brief Announcement: Local Problems in the SUPPORTED ModelProceedings of the 2023 ACM Symposium on Principles of Distributed Computing10.1145/3583668.3594583(172-175)Online publication date: 19-Jun-2023
https://dl.acm.org/doi/10.1145/3583668.3594583
Show More Cited By

Index Terms

What can be computed locally?

Recommendations

What Can Be Computed Locally?

The purpose of this paper is a study of computation that can be done locally in a distributed network, where "locally" means within time (or distance) independent of the size of the network. Locally checkable labeling (LCL) problems are considered, ...
Can MIC find its place in the field of PDES?: An Early Performance Evaluation of PDES Simulator on Intel Many Integrated Cores Coprocessor
DS-RT 2015: Proceedings of the 19th International Symposium on Distributed Simulation and Real Time Applications

The widespread utilization of many-core processors offers a good opportunity for Parallel Discrete Events Simulation (PDES) to obtain a better execution performance. As one of the newly introduced many-core processors, the Intel Xeon Phi coprocessor ...
Can Portability Improve Performance?: An Empirical Study of Parallel Graph Analytics
ICPE '15: Proceedings of the 6th ACM/SPEC International Conference on Performance Engineering

Due to increasingly large datasets, graph analytics - traversals, all-pairs shortest path computations, centrality measures, etc. - are becoming the focus of high-performance computing (HPC). Because HPC is currently dominated by many-core architectures ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

STOC '93: Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing

June 1993

812 pages

ISBN:0897915917

DOI:10.1145/167088

Chairmen:
Rao Kosaraju
John Hopkins Univ., Baltimore, MD
,
David Johnson
AT&T Bell Lab.
,
Alok Aggarwal
IBM T. J. Watson Research Center,Yorktown Heights, NY

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1993

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC93

Sponsor:

SIGACT

STOC93: 25th Annual ACM Symposium on the Theory of Computing

May 16 - 18, 1993

California, San Diego, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Upcoming Conference

STOC '25

Sponsor:
sigact

57th Annual ACM Symposium on Theory of Computing (STOC 2025)

June 23 - 27, 2025

Prague , Czech Republic

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

71
Total Citations
View Citations
1,079
Total Downloads

Downloads (Last 12 months)139
Downloads (Last 6 weeks)17

Reflects downloads up to 15 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

D’Inverno GBianchini MSampoli MScarselli F(2024)On the approximation capability of GNNs in node classification/regression tasksSoft Computing10.1007/s00500-024-09676-128:13-14(8527-8547)Online publication date: 5-Jul-2024
https://doi.org/10.1007/s00500-024-09676-1
Qiu ZYuan AChen CMarathe MRavi SRosenkrantz DStearns RVullikanti AAgmon NAn BRicci AYeoh W(2023)Assigning Agents to Increase Network-Based Neighborhood DiversityProceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems10.5555/3545946.3598690(600-608)Online publication date: 30-May-2023
https://dl.acm.org/doi/10.5555/3545946.3598690
Agrawal AAugustine JPeleg DRamachandran SOshman RNolin AHalldorsson MBalliu A(2023)Brief Announcement: Local Problems in the SUPPORTED ModelProceedings of the 2023 ACM Symposium on Principles of Distributed Computing10.1145/3583668.3594583(172-175)Online publication date: 19-Jun-2023
https://dl.acm.org/doi/10.1145/3583668.3594583
Bouritsas GFrasca FZafeiriou SBronstein M(2023)Improving Graph Neural Network Expressivity via Subgraph Isomorphism CountingIEEE Transactions on Pattern Analysis and Machine Intelligence10.1109/TPAMI.2022.315431945:1(657-668)Online publication date: 1-Jan-2023
https://doi.org/10.1109/TPAMI.2022.3154319
Fu XYin YZheng C(2023)Self-stabilizing $$(\varDelta +1)$$-Coloring in Sublinear (in $$\varDelta $$) Rounds via Locally-Iterative AlgorithmsComputing and Combinatorics10.1007/978-3-031-49190-0_17(232-243)Online publication date: 9-Dec-2023
https://doi.org/10.1007/978-3-031-49190-0_17
Pemmaraju SSobel J(2023)Exact Distributed SamplingStructural Information and Communication Complexity10.1007/978-3-031-32733-9_25(558-575)Online publication date: 25-May-2023
https://doi.org/10.1007/978-3-031-32733-9_25
Barenboim LElkin MGoldenberg U(2021)Locally-iterative Distributed (Δ + 1)-coloring and ApplicationsJournal of the ACM10.1145/348662569:1(1-26)Online publication date: 7-Dec-2021
https://dl.acm.org/doi/10.1145/3486625
Akhoondian Amiri SWiederhake B(2021)Distributed Distance-r Covering Problems on Sparse High-Girth GraphsAlgorithms and Complexity10.1007/978-3-030-75242-2_3(37-60)Online publication date: 4-May-2021
https://doi.org/10.1007/978-3-030-75242-2_3
Guidara APomares Hernández SRodríguez Henríquez LHadj Kacem HHadj Kacem A(2020)Towards Causal Consistent Updates in Software-Defined NetworksApplied Sciences10.3390/app1006208110:6(2081)Online publication date: 19-Mar-2020
https://doi.org/10.3390/app10062081
Assadi SChen YKhanna SChan T(2019)Sublinear algorithms for (Δ + 1) vertex coloringProceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3310435.3310483(767-786)Online publication date: 6-Jan-2019
https://dl.acm.org/doi/10.5555/3310435.3310483
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

What Can Be Computed Locally?

Can MIC find its place in the field of PDES?: An Early Performance Evaluation of PDES Simulator on Intel Many Integrated Cores Coprocessor

Can Portability Improve Performance?: An Empirical Study of Parallel Graph Analytics