New techniques and tighter bounds for local computation algorithms

Given an input x and a search problem F, local computation algorithms (LCAs) implement access to specified locations of y in a legal output y∈F(x), using polylogarithmic time and space. Parnas and Ron [27] and Mansour et al. [19] showed how to convert certain distributed and online algorithms to LCA...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of computer and system sciences Jg. 82; H. 7; S. 1180 - 1200
Hauptverfasser: Reingold, Omer, Vardi, Shai
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier Inc 01.11.2016
Schlagworte:
Algorithms
Complexity
Computation
Legal
Local computation algorithms
Online
Pseudorandomness
Searching
Sublinear algorithms
Local computation algorithms
Sublinear algorithms
Pseudorandomness
ISSN:0022-0000, 1090-2724
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Given an input x and a search problem F, local computation algorithms (LCAs) implement access to specified locations of y in a legal output y∈F(x), using polylogarithmic time and space. Parnas and Ron [27] and Mansour et al. [19] showed how to convert certain distributed and online algorithms to LCAs, respectively. In this work, we expand on those lines of work and develop new techniques for designing LCAs and bounding their space and time complexity. •We introduce d-light graphs, a new family that includes graphs of constant bounded degree and Erdos–Renyi graphs.•We develop new techniques for bounding the time and space requirements of LCAs.•We use these techniques to develop algorithms for a large family of problems on d-light graphs.•For example, we construct an LCA that requires O(log⁡nlog⁡log⁡n) space and O(log2⁡n) time for MIS.•We show that the above LCA requires O(log⁡log⁡n) time and O(log⁡n) space in expectation.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0022-0000
1090-2724
DOI:10.1016/j.jcss.2016.05.007