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...

Full description

Bibliographic Details

Published in:	Journal of computer and system sciences Vol. 82; no. 7; pp. 1180 - 1200
Main Authors:	Reingold, Omer, Vardi, Shai
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.11.2016
Subjects:	Algorithms Complexity Computation Legal Local computation algorithms Online Pseudorandomness Searching Sublinear algorithms Local computation algorithms Sublinear algorithms Pseudorandomness
ISSN:	0022-0000, 1090-2724
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!