Pages that link to "Item:Q3990110"
From MaRDI portal
The following pages link to Locality in Distributed Graph Algorithms (Q3990110):
Displaying 50 items.
- 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)
- Patterns from nature: distributed greedy colouring with simple messages and minimal graph knowledge (Q1749842) (← links)
- Best of two local models: centralized local and distributed local algorithms (Q1784947) (← links)
- Deterministic distributed construction of \(T\)-dominating sets in time \(T\) (Q1786883) (← links)
- On the least distance eigenvalues of the second power of a graph (Q1786948) (← links)
- Distributed algorithm for approximating the maximum matching (Q1887042) (← links)
- On the extremal combinatorics of the Hamming space (Q1894014) (← links)
- The local nature of \(\Delta\)-coloring and its algorithmic applications (Q1894705) (← links)
- A distributed approximation algorithm for the bottleneck connected dominating set problem (Q1926605) (← links)
- Sublinear fully distributed partition with applications (Q1959378) (← links)
- Almost stable matchings by truncating the Gale-Shapley algorithm (Q1959728) (← links)
- Improved distributed \(\Delta\)-coloring (Q1981630) (← links)
- Almost global problems in the LOCAL model (Q1981631) (← links)
- Fast distributed approximation for TAP and 2-edge-connectivity (Q1988524) (← links)
- Distributed backup placement (Q2084982) (← links)
- Local mending (Q2097329) (← links)
- Linial for lists (Q2104037) (← links)
- Distributed algorithms for fractional coloring (Q2117704) (← links)
- Distributed graph problems through an automata-theoretic Lens (Q2117706) (← links)
- Distributed reconfiguration of maximal independent sets (Q2186816) (← links)
- What can be sampled locally? (Q2189170) (← links)
- Improved deterministic distributed matching via rounding (Q2189173) (← 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)
- Combinatorial algorithms for distributed graph coloring (Q2251151) (← links)
- No sublogarithmic-time approximation scheme for bipartite vertex cover (Q2256970) (← links)
- Low-weight superimposed codes and related combinatorial structures: bounds and applications (Q2285161) (← links)
- Dynamic networks of finite state machines (Q2292917) (← links)
- Local algorithms for sparse spanning graphs (Q2300722) (← links)
- Distributed coloring in sparse graphs with fewer colors (Q2335690) (← links)
- Linear-time algorithms for tree root problems (Q2346968) (← links)
- Distributed coloring algorithms for triangle-free graphs (Q2347810) (← links)
- Allowing each node to communicate only once in a distributed system: shared whiteboard models (Q2355326) (← links)
- Coloring unstructured radio networks (Q2377260) (← links)
- Distributed computing with advice: information sensitivity of graph coloring (Q2377267) (← links)
- Large cuts with local algorithms on triangle-free graphs (Q2411507) (← links)
- Local 7-coloring for planar subgraphs of unit disk graphs (Q2430012) (← 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)
- Property testing of planarity in the \textsf{CONGEST} model (Q2657275) (← links)
- A fast distributed algorithm for \((\Delta+1)\)-edge-coloring (Q2664558) (← links)
- Distributed minimum vertex coloring and maximum independent set in chordal graphs (Q2672608) (← links)
- Probabilistic constructions in continuous combinatorics and a bridge to distributed algorithms (Q2684542) (← links)
- Distributed graph problems through an automata-theoretic lens (Q2689441) (← links)
- Mini-workshop: Descriptive combinatorics, LOCAL algorithms and random processes. Abstracts from the mini-workshop held February 13--19, 2022 (Q2693035) (← links)
- Fast and Simple Local Algorithms for 2-Edge Dominating Sets and 3-Total Vertex Covers (Q2803828) (← links)
