First Page | Document Content | |
---|---|---|
Date: 2011-10-02 19:00:10Network theory Analysis of algorithms Probabilistic complexity theory Randomized algorithm Graph coloring Decision tree model Probabilistic method Algorithm Shortest path problem Theoretical computer science Mathematics Applied mathematics | Space-efficient Local Computation Algorithms∗ Noga Alon† Ronitt Rubinfeld‡ AbstractAdd to Reading ListSource URL: www.math.tau.ac.ilDownload Document from Source WebsiteFile Size: 247,80 KBShare Document on Facebook |