Distributed Computing: A Locality-Sensitive Approach
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Local edge colouring of Yao-like subgraphs of unit disk graphs
- Labeling schemes for tree representation
- Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction
- Analysis of a randomized rendezvous algorithm
- On scalable and locality-aware web document sharing.
- Design patterns in beeping algorithms: examples, emulation, and analysis
- GEODIS: towards the optimization of data locality-aware job scheduling in geo-distributed data centers
- Counter machines and distributed automata -- a story about exchanging space and time
- Impact of locality on location aware unit disk graphs
- What can be verified locally?
- Linear-in- lower bounds in the LOCAL model
- Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication
- A note on hardness of diameter approximation
- Distributed approximation of k-service assignment
- The minimum scheduling time for convergecast in wireless sensor networks
- Distributed backup placement in networks
- On efficient distributed construction of near optimal routing schemes
- Constant-time local computation algorithms
- Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks
- Impact of knowledge on election time in anonymous networks
- Locally guided randomized elections in trees: The totally fair case
- Best of two local models: centralized local and distributed local algorithms
- Deterministic distributed construction of T-dominating sets in time T
- Tree spanners on chordal graphs: complexity and algorithms
- Distance estimation and object location via rings of neighbors
- Transient fault detectors
- General compact labeling schemes for dynamic trees
- A fast distributed approximation algorithm for minimum spanning trees
- Computing the greedy spanner in near-quadratic time
- Sublinear fully distributed partition with applications
- A queueing network-based distributed Laplacian solver
- Improved distributed \(\Delta\)-coloring
- Almost global problems in the LOCAL model
- Fast distributed approximation for TAP and 2-edge-connectivity
- Deciding and verifying network properties locally with few output bits
- The complexity of leader election in diameter-two networks
- Making asynchronous distributed computations robust to noise
- Redundancy in distributed proofs
- Graph spanners: a tutorial review
- Compact distributed certification of planar graphs
- How many cooks spoil the soup?
- Light spanners for high dimensional norms via stochastic decompositions
- Local mending
- Linial for lists
- Local certification of graphs with bounded genus
- Distance labeling schemes for \(K_4\)-free bridged graphs
- Distributed graph problems through an automata-theoretic Lens
- Synchronous concurrent broadcasts for intermittent channels with bounded capacities
- Latency, capacity, and distributed minimum spanning trees
- Single-source shortest paths in the CONGEST model with improved bounds
- GHS algorithm on a graph with random weights
- What can be sampled locally?
- Improved distributed degree splitting and edge coloring
- The sparsest additive spanner via multiple weighted BFS trees
- A hierarchy of local decision
- Detecting cliques in CONGEST networks
- Fooling views: a new lower bound technique for distributed computations under congestion
- Distance and routing labeling schemes for cube-free median graphs
- A queueing network-based distributed Laplacian solver for directed graphs
- Further optimizations of CSIDH: a systematic approach to efficient strategies, permutations, and bound vectors
- Sparse covers for planar graphs and graphs that exclude a fixed minor
- Xheal: a localized self-healing algorithm using expanders
- Combinatorial algorithms for distributed graph coloring
- No sublogarithmic-time approximation scheme for bipartite vertex cover
- Computing fault-containment times of self-stabilizing algorithms using lumped Markov chains
- Distributed balanced color assignment on arbitrary networks
- Distributed approximation algorithms for k-dominating set in graphs of bounded genus and linklessly embeddable graphs
- Message lower bounds via efficient network synchronization
- Local algorithms for sparse spanning graphs
- Distributed computation in dynamic networks via random walks
- Distributed coloring algorithms for triangle-free graphs
- Allowing each node to communicate only once in a distributed system: shared whiteboard models
- Local heuristics and the emergence of spanning subgraphs in complex networks
- Tree-decompositions with bags of small diameter
- Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models
- How to use spanning trees to navigate in graphs
- Distributed construction of low-interference spanners
- Proof labeling schemes
- Towards worst-case churn resistant peer-to-peer systems
- Coloring unstructured radio networks
- Spanners for bounded tree-length graphs
- Counting in one-hop beeping networks
- Distributed distance computation and routing with small messages
- A weakly robust PTAS for minimum clique partition in unit disk graphs
- Additive spanners and distance and routing labeling schemes for hyperbolic graphs
- Local 7-coloring for planar subgraphs of unit disk graphs
- Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs
- Locality and checkability in wait-free computing
- Toward more localized local algorithms: removing assumptions concerning global knowledge
- A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs
- A simple randomized scheme for constructing low-weight \(k\)-connected spanning subgraphs with applications to distributed algorithms
- Analysis of randomized protocols for conflict-free distributed access
- Labeling schemes for weighted dynamic trees
- Max-stretch reduction for tree spanners
- Deformable spanners and applications
- Additive sparse spanners for graphs with bounded length of largest induced cycle
- A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots
- Topology recognition with advice
- DEX: self-healing expanders
- Property testing of planarity in the \textsf{CONGEST} model
This page was built for publication: Distributed Computing: A Locality-Sensitive Approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4517129)
