No label defined (Q5002725)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7375977

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7375977

Statements

scholarly article

0 references

Boaz Patt-Shamir

0 references

0 references

0 references

publication date

28 July 2021

0 references

full work available at URL

https://arxiv.org/abs/1703.07734

0 references

zbMATH Keywords

local computation algorithms

0 references

sublinear algorithms

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

A local algorithm for finding dense subgraphs

0 references

Almost Optimal Local Graph Clustering Using Evolving Sets

0 references

Approximating the Minimum Spanning Tree Weight in Sublinear Time

0 references

Randomized Greedy Algorithms for Independent Sets and Matchings in Regular Graphs: Exact Results and Finite Girth Corrections

0 references

An Improved Distributed Algorithm for Maximal Independent Set

0 references

Parallel Symmetry-Breaking in Sparse Graphs

0 references

Property testing in bounded degree graphs

0 references

Non-local probes do not help with many graph problems

0 references

Testing and Reconstruction of Lipschitz Functions with Applications to Data Privacy

0 references

On the efficiency of local decoding procedures for error-correcting codes

0 references

Local Algorithms for Sparse Spanning Graphs

0 references

Locality in Distributed Graph Algorithms

0 references

A Simple Parallel Algorithm for the Maximal Independent Set Problem

0 references

Upper bounds for static resource allocation in a distributed system

0 references

Converting Online Algorithms to Local Computation Algorithms

0 references

A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring

0 references

What Can be Computed Locally?

0 references

Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms

0 references

New techniques and tighter bounds for local computation algorithms

0 references

Local Monotonicity Reconstruction

0 references

A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning

0 references

Locally Decodable Codes

0 references

Improved Constant-Time Approximation Algorithms for Maximum Matchings and Other Optimization Problems

0 references

Identifiers

zbMATH Open document ID

0 references

10.4230/LIPIcs.ICALP.2018.50

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5002725

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5002725&oldid=36702492"