Locally computing edge orientations

Cites work

scientific article; zbMATH DE number 1670532 (Why is no real title available?)
scientific article; zbMATH DE number 2185626 (Why is no real title available?)
scientific article; zbMATH DE number 4191094 (Why is no real title available?)
scientific article; zbMATH DE number 4213418 (Why is no real title available?)
scientific article; zbMATH DE number 5485538 (Why is no real title available?)
scientific article; zbMATH DE number 1559537 (Why is no real title available?)
scientific article; zbMATH DE number 1775440 (Why is no real title available?)
scientific article; zbMATH DE number 7650375 (Why is no real title available?)
scientific article; zbMATH DE number 7829256 (Why is no real title available?)
A Local Computation Approximation Scheme to Maximum Matching
A constructive arboricity approximation scheme
A lower bound for the distributed Lovász local lemma
A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
A parallel algorithmic version of the local lemma
A quasi-polynomial time partition oracle for graphs with an excluded minor
A simple greedy algorithm for dynamic graph orientation
A simple storage scheme for strings achieving entropy bounds
An Improved Distributed Algorithm for Maximal Independent Set
An algorithmic approach to the Lovász local lemma. I
An improved constant-time approximation algorithm for maximum~matchings
Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms
Deterministic coin tossing with applications to optimal parallel list ranking
Deterministic distributed edge-coloring via hypergraph maximal matching
Deterministic stateless centralized local algorithms for bounded degree graphs
Distributed Lower Bounds for Ruling Sets
Distributed degree splitting, edge coloring, and orientations
Distributed edge coloring and a special case of the constructive Lovász local lemma
Distributed local approximation algorithms for maximum matching in graphs and hypergraphs
Efficient primal-dual graph algorithms for MapReduce
Faster fully dynamic matchings with small approximation ratios
Improved Local Computation Algorithm for Set Cover via Sparsification
Improved dynamic graph coloring
Improved local computation algorithms for constructing spanners
Improved low-degree testing and its applications
Learning polynomials with queries: The highly noisy case
Limitations of local filters of Lipschitz and monotone functions
Local Graph Partitions for Approximation and Testing
Local computation algorithms for graphs of non-constant degrees
Local computation algorithms for spanners
Local computation of maximal independent set
Local list decoding with a constant number of queries
Local monotonicity reconstruction
Local reconstructors and tolerant testers for connectivity and diameter
Locally decodable codes and private information retrieval schemes.
Lower bounds for local monotonicity reconstruction from transitive-closure spanners
Massively parallel algorithms for small subgraph counting
Noise tolerance of expanders and sublinear expansion reconstruction
On derandomizing local distributed algorithms
On dynamic \(\alpha+1\) Arboricity decomposition and out-orientation
On the efficiency of local decoding procedures for error-correcting codes
On the locality of Nash-Williams forest decomposition and star-forest decomposition
Orienting dynamic graphs, with applications to maximal matchings and adjacency queries
Polynomial lower bound for distributed graph coloring in a weak LOCAL model
Properly learning monotone functions via local correction
Property-preserving data reconstruction
Pseudorandom generators without the XOR lemma
Random-Self-Reducibility of Complete Sets
Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems
Simple deterministic algorithms for fully dynamic maximal matching
Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples
Space-efficient local computation algorithms
Sparsifying distributed algorithms with ramifications in massively parallel computation and centralized local computation
Squeezing succinct data structures into entropy bounds
Sublinear Random Access Generators for Preferential Attachment Graphs.
Testing and reconstruction of Lipschitz functions with applications to data privacy
The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation
The Landscape of Distributed Complexities on Trees and Beyond
The Randomized Local Computation Complexity of the Lovász Local Lemma
The locality of distributed symmetry breaking

This page was built for publication: Locally computing edge orientations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7253158)