arbitrary local algorithms / online fashion / later applications / local computation algorithm / local computation algorithms / above approximation algorithms / local reconstruction algorithms / distributed computing / search problem / symmetric permutation / improved constant-time approximation algorithm / straightforward solutions / reconstruction algorithm / Local multicoloring algorithms / online inputs / legal solution / greedy algorithms / constant-time approximation algorithms / local algorithms / randomized algorithm / valid solution / computing / parallel algorithm / main technical tools / computation algorithms / sublinear algorithms / /
Organization
National Science Foundation / Israel Science Foundation / MIT / Institute for Advanced Study / Mathematics and Blavatnik School of Computer Science / Tel Aviv University / Tel Aviv / School of Computer Science / US Federal Reserve / Sackler School of Mathematics / /
Person
Marie Curie / / /
Product
T10 / /
ProvinceOrState
New Jersey / Massachusetts / /
PublishedMedium
the Theory of Computing / SIAM Journal on Computing / Theoretical Computer Science / /
Technology
strongly local computation algorithm / improved constant-time approximation algorithm / constant-time approximation algorithms / Spaceefficient local computation algorithms / 2.1 Local computation algorithms / local computation algorithm / above approximation algorithms / local algorithms / local computation algorithms / tdma / reconstruction algorithm / Local multicoloring algorithms / arbitrary local algorithms / local reconstruction algorithms / /
Space-efficient Local Computation Algorithms∗ Noga Alon† Ronitt Rubinfeld‡ Abstract