The following pages link to What Can be Computed Locally? (Q4862796):
Displaying 50 items.
- Distributed approximation of capacitated dominating sets (Q613113) (← links)
- Analysing local algorithms in location-aware quasi-unit-disk graphs (Q642985) (← links)
- An optimal bit complexity randomized distributed MIS algorithm (Q658666) (← links)
- Distributed algorithms for covering, packing and maximum weighted matching (Q661048) (← links)
- Local approximability of max-min and min-max linear programs (Q693753) (← links)
- A local approximation algorithm for minimum dominating set problem in anonymous planar networks (Q748117) (← links)
- Synchronous counting and computational algorithm design (Q896024) (← links)
- Finding hidden cliques of size \(\sqrt{N/e}\) in nearly linear time (Q896557) (← links)
- Deterministic local algorithms, unique identifiers, and fractional graph colouring (Q896700) (← links)
- A simple local 3-approximation algorithm for vertex cover (Q987844) (← links)
- Local edge colouring of Yao-like subgraphs of unit disk graphs (Q1008738) (← links)
- A silent self-stabilizing algorithm for the generalized minimal \(k\)-dominating set problem (Q1625600) (← links)
- Node labels in local decision (Q1625609) (← links)
- What can be verified locally? (Q1672006) (← links)
- Linear-in-\(\varDelta \) lower bounds in the LOCAL model (Q1689747) (← links)
- Computing large independent sets in a single round (Q1699422) (← links)
- Constant-time local computation algorithms (Q1743110) (← links)
- On mobile agent verifiable problems (Q1753994) (← links)
- Distributed verification of minimum spanning trees (Q1954247) (← links)
- Almost stable matchings by truncating the Gale-Shapley algorithm (Q1959728) (← links)
- Almost global problems in the LOCAL model (Q1981631) (← links)
- Deciding and verifying network properties locally with few output bits (Q1988527) (← links)
- Local mending (Q2097329) (← links)
- Distributed interactive proofs for the recognition of some geometric intersection graph classes (Q2097349) (← links)
- Local certification of graphs with bounded genus (Q2104916) (← links)
- Distributed graph problems through an automata-theoretic Lens (Q2117706) (← links)
- Planarity can be verified by an approximate proof labeling scheme in constant-time (Q2154327) (← links)
- An iterative domain decomposition, spectral finite element method on non-conforming meshes suitable for high frequency Helmholtz problems (Q2169503) (← links)
- What can be sampled locally? (Q2189170) (← links)
- Derandomizing local distributed algorithms under bandwidth restrictions (Q2189176) (← links)
- A hierarchy of local decision (Q2219059) (← links)
- Fooling views: a new lower bound technique for distributed computations under congestion (Q2220402) (← links)
- Further optimizations of CSIDH: a systematic approach to efficient strategies, permutations, and bound vectors (Q2229293) (← links)
- Randomized distributed decision (Q2256969) (← links)
- No sublogarithmic-time approximation scheme for bipartite vertex cover (Q2256970) (← links)
- Local algorithms for sparse spanning graphs (Q2300722) (← links)
- Allowing each node to communicate only once in a distributed system: shared whiteboard models (Q2355326) (← links)
- Can we locally compute sparse connected subgraphs? (Q2399362) (← links)
- Locality and checkability in wait-free computing (Q2441537) (← links)
- Toward more localized local algorithms: removing assumptions concerning global knowledge (Q2441787) (← links)
- New techniques and tighter bounds for local computation algorithms (Q2628795) (← links)
- Distributed graph problems through an automata-theoretic lens (Q2689441) (← links)
- Constructing near spanning trees with few local inspections (Q2977565) (← links)
- Locality and Checkability in Wait-Free Computing (Q3095336) (← links)
- (Q3179347) (← links)
- Constant space and non-constant time in distributed computing (Q3300833) (← links)
- An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract) (Q3408183) (← links)
- Ramanujan graphings and correlation decay in local algorithms (Q3452726) (← links)
- Exact Bounds for Distributed Graph Colouring (Q3460706) (← links)
- Local Maps: New Insights into Mobile Agent Algorithms (Q3540225) (← links)
