Sampling and output estimation in distributed algorithms and LCAs
From MaRDI portal
Cites work
- A fast and simple randomized parallel algorithm for maximal matching
- A Local Computation Approximation Scheme to Maximum Matching
- An Improved Distributed Algorithm for Maximal Independent Set
- Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms
- Can Distributed Uniformity Testing Be Local?
- Coloring fast without learning your neighbors' colors
- Coloring Powers of Planar Graphs
- Converting online algorithms to local computation algorithms
- Deterministic stateless centralized local algorithms for bounded degree graphs
- Distance-2 Coloring in the CONGEST Model
- Distributed Approximation on Power Graphs
- Efficient Size Estimation and Impossibility of Termination in Uniform Dense Population Protocols
- How long it takes for an ordinary node with an ordinary ID to output?
- scientific article; zbMATH DE number 7561278 (Why is no real title available?)
- Improved deterministic distributed matching via rounding
- Local algorithms for sparse spanning graphs
- Local computation algorithms for graphs of non-constant degrees
- Removing randomness in parallel computation without a processor penalty
- Sleeping is Efficient: MIS in O (1)-rounds Node-averaged Awake Complexity
- Structural information and communication complexity. 28th international colloquium, SIROCCO 2021, Wrocław, Poland, June 28 -- July 1, 2021. Proceedings
- Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition
- The \(L(2,1)\)-labeling on graphs and the frequency assignment problem
- The locality of distributed symmetry breaking
- What Can be Sampled Locally?
This page was built for publication: Sampling and output estimation in distributed algorithms and LCAs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6971744)
