M. Naor and L. Stockmeyer, "What can be computed locally?," Proc. 25th ACM Symp. on Theory of Computing, 1993, pp. 409-412. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Local Stabilizer - Afek, Dolev (1997) (13 citations) (Correct)
....input algorithm and is local. Where by local we mean first, that as soon as the system enters a corrupted state, that fact is detected and second that the expected computation time lost in recovering from the corrupted state is proportional to the size of the corrupted part of the network (See [23, 25, 24] for more discussion and motivation for locality) Distributed (synchronous) systems, such as network of workstations, serve users at different sites at different times. Synchronization among processors in a distributed system may be achieved by means of clocks (using an outside entity like GPS) ....
M. Naor and L. Stockmeyer, "What can be computed locally?," Proc. 25th ACM Symp. on Theory of Computing, 1993, pp. 409-412.
Local Labeling And Resource Allocation Using Preprocessing - Attiya, Shachnai, Tamir (1994) (Correct)
....should be forwarded. Clearly, within t communication rounds, a processor can get information only from processors located within distance t. The study of problems that are local, i.e. in which the value of a processor depends only on its close by neighborhood, has attracted much attention, e.g. [13, 16, 12, 18, 11]. This study assumed that processors have no knowledge about the network topology. In many common scenarios, this is not the situation: If the same problem has to be solved many times on different sub networks of a fixed network G, then it might be worthwhile to conduct some preliminary ....
.... computations was first studied by Cole and Vishkin, who showed in [9] that a 3 coloring of a ring requires only the knowledge of a O(log n) neighborhood; this bound was shown to be tight by Linial [12] The more general problem of computing labels locally was studied by Naor and Stockmeyer [16] in the case where no preprocessing is allowed. They present local algorithms for some labeling problems whose validity can be checked locally, and also show that randomization does not help in making a labeling problem local. In follow up work, Mayer, Naor and Stockmeyer [15] consider the amount ....
[Article contains additional citation context not shown here]
M. Naor and L. Stockmeyer. "What can be computed locally?" 25th ACM Symposium on Theory of Computing, 1993, pp. 184--193.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC