scientific article; zbMATH DE number 7375977
From MaRDI portal
Publication:5002725
DOI10.4230/LIPIcs.ICALP.2018.50zbMath1499.68381arXiv1703.07734MaRDI QIDQ5002725
Publication date: 28 July 2021
Full work available at URL: https://arxiv.org/abs/1703.07734
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)
Cites Work
- Unnamed Item
- Unnamed Item
- Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms
- Upper bounds for static resource allocation in a distributed system
- Non-local probes do not help with many graph problems
- New techniques and tighter bounds for local computation algorithms
- A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning
- Converting Online Algorithms to Local Computation Algorithms
- Local Algorithms for Sparse Spanning Graphs
- Improved Constant-Time Approximation Algorithms for Maximum Matchings and Other Optimization Problems
- Almost Optimal Local Graph Clustering Using Evolving Sets
- On the efficiency of local decoding procedures for error-correcting codes
- Randomized Greedy Algorithms for Independent Sets and Matchings in Regular Graphs: Exact Results and Finite Girth Corrections
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- Parallel Symmetry-Breaking in Sparse Graphs
- A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring
- Locality in Distributed Graph Algorithms
- An Improved Distributed Algorithm for Maximal Independent Set
- What Can be Computed Locally?
- Approximating the Minimum Spanning Tree Weight in Sublinear Time
- Local Monotonicity Reconstruction
- Testing and Reconstruction of Lipschitz Functions with Applications to Data Privacy
- Locally Decodable Codes
- Property testing in bounded degree graphs
This page was built for publication:
