Pages that link to "Item:Q4907581"
From MaRDI portal
The following pages link to Distributed Verification and Hardness of Distributed Approximation (Q4907581):
Displayed 50 items.
- A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots (Q259059) (← links)
- Fast and compact self-stabilizing verification, computation, and fault detection of an MST (Q498670) (← links)
- Local checkability, no strings attached: (a)cyclicity, reachability, loop free updates in SDNs (Q1686112) (← links)
- On efficient distributed construction of near optimal routing schemes (Q1741966) (← links)
- On mobile agent verifiable problems (Q1753994) (← links)
- Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model (Q1981632) (← links)
- Fast distributed approximation for TAP and 2-edge-connectivity (Q1988524) (← links)
- Randomized proof-labeling schemes (Q2002054) (← links)
- Redundancy in distributed proofs (Q2025853) (← links)
- Compact distributed certification of planar graphs (Q2037111) (← links)
- Local certification of graphs with bounded genus (Q2104916) (← links)
- Approximate minimum directed spanning trees under congestion (Q2117742) (← links)
- Latency, capacity, and distributed minimum spanning trees (Q2119398) (← links)
- Sublinear-time distributed algorithms for detecting small cliques and even cycles (Q2146871) (← links)
- What can be sampled locally? (Q2189170) (← links)
- The sparsest additive spanner via multiple weighted BFS trees (Q2201997) (← links)
- A hierarchy of local decision (Q2219059) (← links)
- Detecting cliques in CONGEST networks (Q2220401) (← links)
- Fooling views: a new lower bound technique for distributed computations under congestion (Q2220402) (← links)
- Randomized distributed decision (Q2256969) (← links)
- Message lower bounds via efficient network synchronization (Q2292919) (← links)
- Locality and checkability in wait-free computing (Q2441537) (← links)
- Proof-labeling schemes: broadcast, unicast and in between (Q2672621) (← links)
- A distributed algorithm for directed minimum-weight spanning tree (Q2689838) (← links)
- Message Lower Bounds via Efficient Network Synchronization (Q2835018) (← links)
- Fast Distributed Approximation for TAP and 2-Edge-Connectivity (Q3300822) (← links)
- Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models (Q4989920) (← links)
- (Q4993305) (← links)
- A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths (Q4997313) (← links)
- Distributed Spanner Approximation (Q4997324) (← links)
- (Q5009503) (← links)
- Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time (Q5020729) (← links)
- Distributed Approximate Maximum Matching in the CONGEST Model. (Q5090895) (← links)
- (Q5090916) (← links)
- (Q5090924) (← links)
- (Q5090925) (← links)
- (Q5090930) (← links)
- The Sparsest Additive Spanner via Multiple Weighted BFS Trees (Q5091078) (← links)
- Distributed Testing of Distance-k Colorings (Q5100965) (← links)
- Distributed Graph Algorithms and their Complexity: An Introduction (Q5135263) (← links)
- Distributed construction of purely additive spanners (Q5915631) (← links)
- Fast distributed algorithms for testing graph properties (Q5915702) (← links)
- Approximate proof-labeling schemes (Q5919426) (← links)
- Communication costs in a geometric communication network (Q6052702) (← links)
- Routing schemes for hybrid communication networks (Q6145044) (← links)
- Minimum cost flow in the CONGEST model (Q6148076) (← links)
- Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions (Q6154194) (← links)
- (1- <i>ϵ</i> )-Approximate Maximum Weighted Matching in poly(1/ <i>ϵ</i> , log <i>n</i> ) Time in the Distributed and Parallel Settings (Q6202220) (← links)
- Brief Announcement: Minimum Cost Maximum Flow in the CONGEST Model (Q6202225) (← links)
- Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability (Q6202229) (← links)