Distributed Computing: A Locality-Sensitive Approach
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Equilibria of Games in Networks for Local Tasks
- Brief announcement: Distributed reconfiguration of spanning trees
- Building self-stabilizing overlay networks with the transitive closure framework
- A deterministic almost-tight distributed algorithm for approximating single-source shortest paths
- Fault-tolerant graph realizations in the congested clique
- Coloring and covering nowhere dense graphs
- Computational models for networks of tiny artifacts: a survey
- Deciding and verifying network properties locally with few output bits
- Fast distributed approximation for TAP and 2-edge-connectivity
- Distributed computing with the Cloud
- On the power of threshold-based algorithms for detecting cycles in the \textsc{CONGEST} model
- Graph spanners: a tutorial review
- A queueing network-based distributed Laplacian solver for directed graphs
- Leader election in well-connected graphs
- Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition
- scientific article; zbMATH DE number 7561283 (Why is no real title available?)
- Spanders: distributed spanning expanders
- Tight bounds on the message complexity of distributed tree verification
- Efficient computation in congested anonymous dynamic networks
- A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots
- Topology recognition with advice
- Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks
- The Synergy of Finite State Machines
- Introduction to local certification
- Fast Distributed Approximation for Max-Cut
- Linial for lists
- Local certification of graphs with bounded genus
- Steiner shallow-light trees are exponentially lighter than spanning ones
- An optimal bit complexity randomized distributed MIS algorithm (extended abstract)
- A note on efficient aggregate queries in sensor networks
- The complexity landscape of distributed locally checkable problems on trees
- Amnesiac flooding: synchronous stateless information dissemination
- Distributed independent sets in interval and segment intersection graphs
- Invited talk: Resilient distributed algorithms
- Connections between Theta-graphs, Delaunay triangulations, and orthogonal surfaces
- A topological perspective on distributed network algorithms
- Tree \(t\)-spanners in outerplanar graphs via supply demand partition
- On the microscopic view of time and messages
- A hierarchy of local decision
- Fast deterministic distributed algorithms for sparse spanners
- Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree
- Combinatorial algorithms for distributed graph coloring
- Improved distributed degree splitting and edge coloring
- scientific article; zbMATH DE number 7561256 (Why is no real title available?)
- scientific article; zbMATH DE number 7561459 (Why is no real title available?)
- scientific article; zbMATH DE number 7561635 (Why is no real title available?)
- Distributed approximation of k-service assignment
- Distributed algorithms for random graphs
- Cycle bases in graphs characterization, algorithms, complexity, and applications
- Xheal: a localized self-healing algorithm using expanders
- Improving Inter-cluster Broadcasting in Ad Hoc Networks by Delayed Flooding
- Weak models of distributed computing, with connections to modal logic
- Fault-Tolerant Compact Routing Schemes for General Graphs
- Distributed distance-\(r\) covering problems on sparse high-girth graphs
- Distributed Computing with the Cloud
- Low-light trees, and tight lower bounds for Euclidean spanners
- Constructing labeling schemes through universal matrices
- On compact and efficient routing in certain graph classes
- Fooling views: a new lower bound technique for distributed computations under congestion
- Allowing each node to communicate only once in a distributed system: shared whiteboard models
- Solving the parity problem in one-dimensional cellular automata
- A near-optimal low-energy deterministic distributed SSSP with ramifications on congestion and APSP
- A LOCAL view of the polynomial hierarchy
- On the power of quantum distributed proofs
- Even-cycle detection in the randomized and quantum CONGEST model
- Computing minimum weight cycle in the CONGEST model
- A tight lower bound for 3-coloring grids in the online-LOCAL model
- Brief announcement: Self-stabilizing MIS computation in the beeping model
- Making local algorithms wait-free: the case of ring coloring
- Near-optimal distributed maximum flow
- Distributed independent sets in interval and segment intersection graphs
- Local MST computation with short advice
- General compact labeling schemes for dynamic trees
- Distributed backup placement in networks
- Distributed strategies for generating weight-balanced and doubly stochastic digraphs
- \(f\)-sensitivity distance oracles and routing schemes
- Local 7-coloring for planar subgraphs of unit disk graphs
- Impact of knowledge on election time in anonymous networks
- Shortest hop multipath algorithm for wireless sensor networks
- Compact and low delay routing labeling scheme for unit disk graphs
- Space efficient and time optimal distributed BFS tree construction
- Latency, capacity, and distributed minimum spanning trees
- scientific article; zbMATH DE number 2156277 (Why is no real title available?)
- Close to linear space routing schemes
- Simple neural-like P systems for maximal independent set selection
- Distributed half-integral matching and beyond
- Energy-efficient distributed algorithms for synchronous networks
- Minimum cost flow in the CONGEST model
- On the power of threshold-based algorithms for detecting cycles in the CONGEST model
- Greedy spanners in Euclidean spaces admit sublinear separators
- Distributed approximation algorithms for k-dominating set in graphs of bounded genus and linklessly embeddable graphs
- Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time
- Synchronous concurrent broadcasts for intermittent channels with bounded capacities
- When should you wait before updating? -- Toward a robustness refinement
- Distributed construction of low-interference spanners
- \(\mathrm{SKIP}^{+}\), a self-stabilizing skip graph
- Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes
- Transient fault detectors
- On scalable and locality-aware web document sharing.
- Combinatorial algorithms for distributed graph coloring
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)
