On the public citation graph

Some simple distributed algorithms for sparse networks

0 signed · 169 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01303516openalex-snapshot

Low diameter graph decompositions

inferredcites →https://doi.org/10.1016/0020-0190(87)90169-4openalex-snapshot

Parallel (Δ + 1)-coloring of constant-degree graphs

inferredcites →https://doi.org/10.1016/0020-0190(95)00013-3openalex-snapshot

Analysis of approximate algorithms for edge-coloring bipartite graphs

inferredcites →https://doi.org/10.1016/0743-7315(92)90018-iopenalex-snapshot

Scheduling parallel I/O operations in multiple bus systems

inferredcites →https://doi.org/10.1016/b978-0-08-040806-4.50027-7openalex-snapshot

A GRAPH-THEORETIC MODEL FOR THE SCHEDULING PROBLEM AND ITS APPLICATION TO SIMULTANEOUS RESOURCE SCHEDULING

inferredcites →https://doi.org/10.1109/sfcs.1989.63504openalex-snapshot

Network decomposition and locality in distributed computation

inferredcites →https://doi.org/10.1137/0221015openalex-snapshot

Locality in Distributed Graph Algorithms

inferredcites →https://doi.org/10.1137/0401044openalex-snapshot

Parallel Symmetry-Breaking in Sparse Graphs

inferredcites →https://doi.org/10.1145/301308.301360openalex-snapshot

A faster distributed algorithm for computing maximal matchings deterministically

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/net.20293openalex-snapshot

On the complexity of distributed graph coloring with local minimality constraints

inferred← citeshttps://doi.org/10.1002/wcm.617openalex-snapshot

Joint processing of topology control and channel assignment in wireless ad hoc networks

inferred← citeshttps://doi.org/10.1007/11533719_85openalex-snapshot

Distributed Weighted Vertex Cover via Maximal Matchings

inferred← citeshttps://doi.org/10.1007/11577327_12openalex-snapshot

Approximation of Self-stabilizing Vertex Cover Less Than 2

inferred← citeshttps://doi.org/10.1007/11823285_61openalex-snapshot

On Greedy Graph Coloring in the Distributed Model

inferred← citeshttps://doi.org/10.1007/11830924_43openalex-snapshot

Distance Approximation in Bounded-Degree and General Sparse Graphs

inferred← citeshttps://doi.org/10.1007/11864219_27openalex-snapshot

Distributed Approximation Algorithms in Unit-Disk Graphs

inferred← citeshttps://doi.org/10.1007/978-1-4471-5173-9_12openalex-snapshot

Matching

inferred← citeshttps://doi.org/10.1007/978-1-4471-5173-9_13openalex-snapshot

Vertex Cover

inferred← citeshttps://doi.org/10.1007/978-3-030-01325-7_19openalex-snapshot

Deterministic Distributed Ruling Sets of Line Graphs

inferred← citeshttps://doi.org/10.1007/978-3-030-01325-7_21openalex-snapshot

A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in $$O(\log N\log \varDelta /\log ^2\log \varDelta )$$ Rounds

inferred← citeshttps://doi.org/10.1007/978-3-030-24922-9_3openalex-snapshot

Locality of Not-so-Weak Coloring

inferred← citeshttps://doi.org/10.1007/978-3-031-32733-9_15openalex-snapshot

Distributed Half-Integral Matching and Beyond

inferred← citeshttps://doi.org/10.1007/978-3-032-09120-8_1openalex-snapshot

Distributed Weak Independent Sets in Hypergraphs: Upper and Lower Bounds

inferred← citeshttps://doi.org/10.1007/978-3-319-25258-2_15openalex-snapshot

A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation

inferred← citeshttps://doi.org/10.1007/978-3-319-25258-2_4openalex-snapshot

Exact Bounds for Distributed Graph Colouring

inferred← citeshttps://doi.org/10.1007/978-3-319-28684-6_10openalex-snapshot

Constant-Time Local Computation Algorithms

inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_22openalex-snapshot

Distributed Computing with Advice: Information Sensitivity of Graph Coloring

inferred← citeshttps://doi.org/10.1007/978-3-540-75142-7_14openalex-snapshot

Distributed Approximations for Packing in Unit-Disk Graphs

inferred← citeshttps://doi.org/10.1007/978-3-642-04355-0_21openalex-snapshot

A Local 2-Approximation Algorithm for the Vertex Cover Problem

inferred← citeshttps://doi.org/10.1007/978-3-642-05118-0_2openalex-snapshot

Local Algorithms: Self-stabilization on Speed

inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_68openalex-snapshot

Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs

inferred← citeshttps://doi.org/10.1007/978-3-642-17551-0_1openalex-snapshot

Innovations and Trends in Web Data Management

inferred← citeshttps://doi.org/10.1007/978-3-642-17679-1_6openalex-snapshot

Deterministic Dominating Set Construction in Networks with Bounded Degree

inferred← citeshttps://doi.org/10.1007/978-3-642-18073-6_8openalex-snapshot

Simulating Sparse Hamiltonians with Star Decompositions

inferred← citeshttps://doi.org/10.1007/978-3-642-24100-0_5openalex-snapshot

Combinatorial Algorithms for Distributed Graph Coloring

inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_37openalex-snapshot

On the Locality of Some NP-Complete Problems

inferred← citeshttps://doi.org/10.1007/978-3-662-44777-2_33openalex-snapshot

Deterministic Stateless Centralized Local Algorithms for Bounded Degree Graphs

inferred← citeshttps://doi.org/10.1007/s00224-017-9788-3openalex-snapshot

Constant-Time Local Computation Algorithms

inferred← citeshttps://doi.org/10.1007/s00446-008-0070-4openalex-snapshot

Coloring unstructured radio networks

inferred← citeshttps://doi.org/10.1007/s00446-008-0076-yopenalex-snapshot

Distributed computing with advice: information sensitivity of graph coloring

inferred← citeshttps://doi.org/10.1007/s00446-011-0127-7openalex-snapshot

Distributed algorithms for covering, packing and maximum weighted matching

inferred← citeshttps://doi.org/10.1007/s00446-012-0167-7openalex-snapshot

Distributed deterministic edge coloring using bounded neighborhood independence

inferred← citeshttps://doi.org/10.1007/s00446-012-0174-8openalex-snapshot

Toward more localized local algorithms: removing assumptions concerning global knowledge

inferred← citeshttps://doi.org/10.1007/s00446-013-0203-2openalex-snapshot

Combinatorial algorithms for distributed graph coloring

inferred← citeshttps://doi.org/10.1007/s00446-015-0245-8openalex-snapshot

Linear-in- $$\varDelta $$ Δ lower bounds in the LOCAL model

inferred← citeshttps://doi.org/10.1007/s00446-016-0269-8openalex-snapshot

Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring

inferred← citeshttps://doi.org/10.1007/s00446-017-0299-xopenalex-snapshot

Distributed backup placement in networks

inferred← citeshttps://doi.org/10.1007/s00446-018-00346-8openalex-snapshot

Improved distributed degree splitting and edge coloring

inferred← citeshttps://doi.org/10.1007/s00446-018-0344-4openalex-snapshot

Improved deterministic distributed matching via rounding

inferred← citeshttps://doi.org/10.1007/s00446-020-00375-2openalex-snapshot

Almost global problems in the LOCAL model

inferred← citeshttps://doi.org/10.1007/s00446-021-00391-wopenalex-snapshot

Optimal distributed covering algorithms

inferred← citeshttps://doi.org/10.1007/s00446-022-00423-zopenalex-snapshot

Distributed backup placement

inferred← citeshttps://doi.org/10.1007/s00446-022-00424-yopenalex-snapshot

Linial for lists

inferred← citeshttps://doi.org/10.1007/s00446-024-00461-9openalex-snapshot

Component stability in low-space massively parallel computation

inferred← citeshttps://doi.org/10.1007/s00446-025-00477-9openalex-snapshot

Exponential speedup over locality in MPC with optimal memory

inferred← citeshttps://doi.org/10.1007/s00446-025-00486-8openalex-snapshot

Towards distributed two-stage stochastic optimization

inferred← citeshttps://doi.org/10.1007/s00446-025-00488-6openalex-snapshot

Optimal message-passing with noisy beeps

inferred← citeshttps://doi.org/10.1007/s11227-009-0285-6openalex-snapshot

Rematch: a highly reliable scheduling algorithm on heterogeneous wireless mesh network

inferred← citeshttps://doi.org/10.1016/j.array.2020.100023openalex-snapshot

A distributed algorithm for vertex coloring problems in wireless networks

inferred← citeshttps://doi.org/10.1016/j.camwa.2008.10.095openalex-snapshot

The coverage-control optimization in sensor network subject to sensing area

inferred← citeshttps://doi.org/10.1016/j.comcom.2012.10.008openalex-snapshot

Effective channel assignments in cognitive radio networks

inferred← citeshttps://doi.org/10.1016/j.ic.2018.07.001openalex-snapshot

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

inferred← citeshttps://doi.org/10.1016/j.ins.2014.06.035openalex-snapshot

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

inferred← citeshttps://doi.org/10.1016/j.jpdc.2022.09.012openalex-snapshot

Secured distributed algorithms without hardness assumptions

inferred← citeshttps://doi.org/10.1016/j.tcs.2007.05.028openalex-snapshot

A simple randomized scheme for constructing low-weight k -connected spanning subgraphs with applications to distributed algorithms

inferred← citeshttps://doi.org/10.1016/j.tcs.2010.11.010openalex-snapshot

A fault-containing self-stabilizing (3−2Δ+1) -approximation algorithm for vertex cover in anonymous networks

inferred← citeshttps://doi.org/10.1016/j.tcs.2015.08.037openalex-snapshot

Distributed algorithms for random graphs

inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114278openalex-snapshot

Distributed half-integral matching and beyond

inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114760openalex-snapshot

Distributed approximation for f-matching

inferred← citeshttps://doi.org/10.1090/proc/17048openalex-snapshot

Borel Vizing’s theorem for graphs of subexponential growth

inferred← citeshttps://doi.org/10.1103/physreva.110.052215openalex-snapshot

Implementation of a continuous-time quantum walk on a sparse graph

inferred← citeshttps://doi.org/10.1109/ccwc51732.2021.9375920openalex-snapshot

On distributed forest decomposition of graphs with bounded arboricity

inferred← citeshttps://doi.org/10.1109/focs.2012.60openalex-snapshot

The Locality of Distributed Symmetry Breaking

inferred← citeshttps://doi.org/10.1109/focs.2016.72openalex-snapshot

An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model

inferred← citeshttps://doi.org/10.1109/focs.2017.25openalex-snapshot

Deterministic Distributed Edge-Coloring via Hypergraph Maximal Matching

inferred← citeshttps://doi.org/10.1109/focs.2019.00037openalex-snapshot

Lower Bounds for Maximal Matchings and Maximal Independent Sets

inferred← citeshttps://doi.org/10.1109/focs.2019.00048openalex-snapshot

Distributed Local Approximation Algorithms for Maximum Matching in Graphs and Hypergraphs

inferred← citeshttps://doi.org/10.1109/focs46700.2020.00042openalex-snapshot

Distributed Lower Bounds for Ruling Sets

inferred← citeshttps://doi.org/10.1109/focs61266.2024.00128openalex-snapshot

Faster $(\Delta+1)$-Edge Coloring: Breaking the $m\sqrt{n}$ Time Barrier

inferred← citeshttps://doi.org/10.1109/glocom.2007.236openalex-snapshot

A Combination Scheme of Topology Control and Channel Assignment in Wireless Ad Hoc Networks

inferred← citeshttps://doi.org/10.1109/icccn.2011.6005934openalex-snapshot

Local Channel Assignments in Cognitive Radio Networks

inferred← citeshttps://doi.org/10.1109/iceee2.2018.8391375openalex-snapshot

Fault tolerance performance of self-stabilizing independent set algorithms on a covering-based problem: The case of link monitoring in WSNs

inferred← citeshttps://doi.org/10.1109/iceeie52663.2021.9616719openalex-snapshot

Performance Evaluation of Capacitated Vertex Cover Algorithms for Security Applications in Wireless Sensor Networks

inferred← citeshttps://doi.org/10.1109/ipdps.2018.00082openalex-snapshot

Distributed Symmetry Breaking in Graphs with Bounded Diversity

inferred← citeshttps://doi.org/10.1109/tpds.2008.53openalex-snapshot

Interference-Aware Joint Routing and TDMA Link Scheduling for Static Wireless Networks

inferred← citeshttps://doi.org/10.1109/tsmc.2021.3121695openalex-snapshot

Better Approximation for Distributed Weighted Vertex Cover via Game-Theoretic Learning

inferred← citeshttps://doi.org/10.1109/wcnc.2007.381openalex-snapshot

Upper Bound of The Number of Channels for Conflict-Free Communication in Multi-Channel Wireless Networks

inferred← citeshttps://doi.org/10.1109/wcnc.2010.5506644openalex-snapshot

Upper Bounds on the Number of Channels to Ensure Collision-Free Communications in Multi-Channel Wireless Networks Using Directional Antennas

inferred← citeshttps://doi.org/10.1134/s1995423911030013openalex-snapshot

Graph coloring in a class of parallel local algorithms

inferred← citeshttps://doi.org/10.1137/1.9781611975482.48openalex-snapshot

Sublinear Algorithms for (Δ + 1) Vertex Coloring

inferred← citeshttps://doi.org/10.1137/1.9781611975994.76openalex-snapshot

Faster Deterministic Distributed Coloring Through Recursive List Coloring

inferred← citeshttps://doi.org/10.1137/1.9781611976014.14openalex-snapshot

Distributed Backup Placement in One Round and its Applications to Maximum Matching Approximation and Self-Stabilization

inferred← citeshttps://doi.org/10.1137/1.9781611976472.21openalex-snapshot

A Breezing Proof of the KMW Bound

inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch163openalex-snapshot

Improved Distributed Algorithms for the Lovász Local Lemma and Edge Coloring

inferred← citeshttps://doi.org/10.1137/12088848xopenalex-snapshot

Distributed $(\Delta+1)$-Coloring in Linear (in $\Delta$) Time

inferred← citeshttps://doi.org/10.1137/17m1117537openalex-snapshot

An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model

inferred← citeshttps://doi.org/10.1137/24m1715866openalex-snapshot

Distributed Edge Coloring in Time Polylogarithmic in ${\Delta }$

inferred← citeshttps://doi.org/10.1145/1073970.1073977openalex-snapshot

Coloring unstructured radio networks

inferred← citeshttps://doi.org/10.1145/1161089.1161119openalex-snapshot

Efficient interference-aware TDMA link scheduling for static wireless networks

inferred← citeshttps://doi.org/10.1145/1435375.1435381openalex-snapshot

Distributed weighted vertex cover via maximal matchings

inferred← citeshttps://doi.org/10.1145/1536414.1536432openalex-snapshot

Distributed (δ+1)-coloring in linear (in δ) time

inferred← citeshttps://doi.org/10.1145/1582716.1582746openalex-snapshot

Distributed and parallel algorithms for weighted vertex cover and other covering problems

inferred← citeshttps://doi.org/10.1145/1582716.1582751openalex-snapshot

Coloring unstructured wireless multi-hop networks

inferred← citeshttps://doi.org/10.1145/1810479.1810533openalex-snapshot

Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks

inferred← citeshttps://doi.org/10.1145/1835698.1835783openalex-snapshot

Distributed algorithms for edge dominating sets

inferred← citeshttps://doi.org/10.1145/1993806.1993814openalex-snapshot

Toward more localized local algorithms

inferred← citeshttps://doi.org/10.1145/1993806.1993825openalex-snapshot

Distributed deterministic edge coloring using bounded neighborhood independence

inferred← citeshttps://doi.org/10.1145/2332432.2332464openalex-snapshot

Distributed maximal matching

inferred← citeshttps://doi.org/10.1145/2611462.2611467openalex-snapshot

Linear-in-delta lower bounds in the LOCAL model

inferred← citeshttps://doi.org/10.1145/2684464.2684469openalex-snapshot

Distributed Maximum Matching in Bounded Degree Graphs

inferred← citeshttps://doi.org/10.1145/2755573.2755583openalex-snapshot

Distributed Backup Placement in Networks

inferred← citeshttps://doi.org/10.1145/2767386.2767410openalex-snapshot

Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic and Faulty Networks

inferred← citeshttps://doi.org/10.1145/2903137openalex-snapshot

The Locality of Distributed Symmetry Breaking

inferred← citeshttps://doi.org/10.1145/2933057.2933086openalex-snapshot

A Distributed (2+ε)-Approximation for Vertex Cover in O(logδ/ε log log δ) Rounds

inferred← citeshttps://doi.org/10.1145/2979675openalex-snapshot

Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic, and Faulty Networks

inferred← citeshttps://doi.org/10.1145/3060294openalex-snapshot

A Distributed (2 + ε)-Approximation for Vertex Cover in O(log Δ / ε log log Δ) Rounds

inferred← citeshttps://doi.org/10.1145/3087801.3087812openalex-snapshot

Deterministic Distributed (Delta + o(Delta))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity

inferred← citeshttps://doi.org/10.1145/3087801.3087833openalex-snapshot

LCL Problems on Grids

inferred← citeshttps://doi.org/10.1145/3188745.3188860openalex-snapshot

New classes of distributed time complexity

inferred← citeshttps://doi.org/10.1145/3188745.3188906openalex-snapshot

Deterministic distributed edge-coloring with fewer colors

inferred← citeshttps://doi.org/10.1145/3212734.3212769openalex-snapshot

Locally-Iterative Distributed (Δ+ 1)

inferred← citeshttps://doi.org/10.1145/3288599.3288601openalex-snapshot

Distributed symmetry-breaking with improved vertex-averaged complexity

inferred← citeshttps://doi.org/10.1145/3293611.3331577openalex-snapshot

Optimal Distributed Covering Algorithms

inferred← citeshttps://doi.org/10.1145/3293611.3331636openalex-snapshot

A Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma

inferred← citeshttps://doi.org/10.1145/3313276.3316393openalex-snapshot

Towards the locality of Vizing’s theorem

inferred← citeshttps://doi.org/10.1145/3382734.3405710openalex-snapshot

Distributed Edge Coloring in Time Quasi-Polylogarithmic in Delta

inferred← citeshttps://doi.org/10.1145/3382734.3405745openalex-snapshot

Truly Tight-in-Δ Bounds for Bipartite Maximal Matching and Variants

inferred← citeshttps://doi.org/10.1145/3461458openalex-snapshot

Lower Bounds for Maximal Matchings and Maximal Independent Sets

inferred← citeshttps://doi.org/10.1145/3469834openalex-snapshot

Smaller Cuts, Higher Lower Bounds

inferred← citeshttps://doi.org/10.1145/3486625openalex-snapshot

Locally-iterative Distributed (Δ + 1)-coloring and Applications

inferred← citeshttps://doi.org/10.1145/3519270.3538429openalex-snapshot

Universally-Optimal Distributed Exact Min-Cut

inferred← citeshttps://doi.org/10.1145/3519270.3538440openalex-snapshot

Distributed Edge Coloring in Time Polylogarithmic in Δ

inferred← citeshttps://doi.org/10.1145/3717823.3718211openalex-snapshot

Online Locality Meets Distributed Quantum Computing

inferred← citeshttps://doi.org/10.1145/3717823.3718265openalex-snapshot

Vizing’s Theorem in Near-Linear Time

inferred← citeshttps://doi.org/10.1145/3796701.3815951openalex-snapshot

Brief Announcement: Deterministic Edge Coloring with few Colors in CONGEST

inferred← citeshttps://doi.org/10.1145/3796701.3815955openalex-snapshot

Brief Announcement: Fast Deterministic Distributed Degree Splitting

inferred← citeshttps://doi.org/10.1145/3806392openalex-snapshot

Vizing’s Theorem in Near-Linear Time

inferred← citeshttps://doi.org/10.1186/1687-1499-2013-223openalex-snapshot

Efficient link scheduling for rechargeable wireless ad hoc and sensor networks

inferred← citeshttps://doi.org/10.1504/ijahuc.2011.041622openalex-snapshot

On the channel usability of Wireless Mesh Networks: when stability plays with you

inferred← citeshttps://doi.org/10.1515/itit-2019-0051openalex-snapshot

The power of locality: Exploring the limits of randomness in distributed computing

inferred← citeshttps://doi.org/10.15480/882.1091openalex-snapshot

Time- and space-efficient self-stabilizing algorithms

inferred← citeshttps://doi.org/10.2200/s00520ed1v01y201307dct011openalex-snapshot

Distributed Graph Coloring: Fundamentals and Recent Developments

inferred← citeshttps://doi.org/10.3390/jsan2020213openalex-snapshot

Channel Allocation in Wireless Networks with Directional Antennas

inferred← citeshttps://doi.org/10.3929/ethz-a-005273546openalex-snapshot

Locality, Scheduling, and Selfishness: Algorithmic Foundations of Highly Decentralized Networks

inferred← citeshttps://doi.org/10.3929/ethz-b-000205784openalex-snapshot

Improved Deterministic Distributed Matching via Rounding

inferred← citeshttps://doi.org/10.3929/ethz-b-000205787openalex-snapshot

Improved distributed degree splitting and edge coloring

inferred← citeshttps://doi.org/10.4036/iis.2015.l.04openalex-snapshot

Distributed Graph Algorithms and their Complexity: An Introduction

inferred← citeshttps://doi.org/10.4230/lipics.disc.2018.22openalex-snapshot

A Deterministic Distributed $2$-Approximation for Weighted Vertex Cover in $O(\log n\logΔ/ \log^2\logΔ)$ Rounds

inferred← citeshttps://doi.org/10.4230/lipics.disc.2020.37openalex-snapshot

Distributed Maximum Matching Verification in CONGEST

inferred← citeshttps://doi.org/10.4230/lipics.icalp.2017.6openalex-snapshot

Best of Two Local Models: Local Centralized and Local Distributed Algorithms

inferred← citeshttps://doi.org/10.4230/lipics.opodis.2020.31openalex-snapshot

Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs

inferred← citeshttps://doi.org/10.4230/lipics.opodis.2023.11openalex-snapshot

Classifying Convergence Complexity of Nash Equilibria in Graphical Games Using Distributed Computing Theory

inferred← citeshttps://doi.org/10.48550/arxiv.1010.2454openalex-snapshot

Distributed Deterministic Edge Coloring using Bounded Neighborhood Independence

inferred← citeshttps://doi.org/10.48550/arxiv.1110.0367openalex-snapshot

Distributed Maximal Matching: Greedy is Optimal

inferred← citeshttps://doi.org/10.48550/arxiv.1202.1983openalex-snapshot

The Locality of Distributed Symmetry Breaking

inferred← citeshttps://doi.org/10.48550/arxiv.1204.6675openalex-snapshot

On the Locality of Some NP-Complete Problems

inferred← citeshttps://doi.org/10.48550/arxiv.1407.7882openalex-snapshot

Distributed Maximum Matching in Bounded Degree Graphs

inferred← citeshttps://doi.org/10.48550/arxiv.1502.04963openalex-snapshot

Exact bounds for distributed graph colouring

inferred← citeshttps://doi.org/10.48550/arxiv.1505.05697openalex-snapshot

A Fast Network-Decomposition Algorithm and its Applications to Constant-Time Distributed Computation

inferred← citeshttps://doi.org/10.48550/arxiv.1602.08166openalex-snapshot

An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model

inferred← citeshttps://doi.org/10.48550/arxiv.1702.05456openalex-snapshot

LCL problems on grids

inferred← citeshttps://doi.org/10.48550/arxiv.1704.02767openalex-snapshot

Deterministic Distributed Edge-Coloring via Hypergraph Maximal Matching

inferred← citeshttps://doi.org/10.48550/arxiv.1708.06275openalex-snapshot

Simple and Near-Optimal Distributed Coloring for Sparse Graphs

inferred← citeshttps://doi.org/10.48550/arxiv.1712.00285openalex-snapshot

Locally-Iterative Distributed (Delta + 1)-Coloring below Szegedy-Vishwanathan Barrier, and Applications to Self-Stabilization and to Restricted-Bandwidth Models

inferred← citeshttps://doi.org/10.48550/arxiv.1804.02513openalex-snapshot

Distributed Maximal Independent Set on Scale-Free Networks

inferred← citeshttps://doi.org/10.48550/arxiv.2001.04235openalex-snapshot

Notes on Theory of Distributed Systems

inferred← citeshttps://doi.org/10.5121/ijcnc.2014.6107openalex-snapshot

Distributed Vertex Cover Algorithms for Wireless Sensor Networks

inferred← citeshttps://doi.org/10.5555/3310435.3310483openalex-snapshot

Sublinear algorithms for (Δ + 1) vertex coloring

inferred← citeshttps://doi.org/10.70675/8a31edd0z6c6cz4167za099zc7947720d54dopenalex-snapshot

Questions de localisabilité pour le calcul distribué

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.