Proof labeling schemes

Distributed Computing

Volumn 22, Issue 4, 2010, Pages 215-233

  Korman, Amos ^a   Kutten, Shay ^b   Peleg, David ^c  

^a CNRS   (France)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Distributed networks; Proof labels; Property verification; Self stabilization

Indexed keywords

BIT COMPLEXITY; DISTRIBUTED ALGORITHM; DISTRIBUTED NETWORKS; EFFICIENT CONSTRUCTION; GLOBAL PROPERTIES; LABELING SCHEME; PROPERTY VERIFICATION; SELF STABILIZATION; UPPER AND LOWER BOUNDS;

STABILIZATION;

LABELS;

EID: 77954886510     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-010-0095-3     Document Type: Article

References (46)

1. Afek, Y., Dolev, S.: Local stabilizer. J. Parallel Distrib. Comput. 62(5), 745-765 (2002)
2. Afek, Y., Kutten, S., Yung, M.: The local detection paradigm and its application to self-stabilization. Theor. Comput. Sci. 186 (1-2), 199-229 (1997)
3. Aggarwal, S., Kutten, S.: Time optimal self-stabilizing spanning tree algorithms. In: Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science, pp. 400-410 (1993)
4. Angluin, D.: Local and global properties in networks of processes. In: Proceedings of the 12th ACM Symposium on Theory of Computing, pp. 82-93 (1980)
5. Arora, A., Gouda, M.: Distributed reset (extended abstract) In: Proceedings of the 10th Conference on Foundations of Software Technology and Theoretical Computer Science Bangalore, India, pp. 316-331 (1990)
6. Awerbuch, B., Kutten, S., Mansour, Y., Patt-Shamir, B., Varghese, G.: Time optimal self-stabilizing synchronization. In: Proceedings of the ACM Symposium on the Theory of Computer Science, pp. 652-661 (1993)
7. Awerbuch, B., Patt-Shamir, B., Varghese, G.: Self-stabilization by local checking and correction. In: Proceedings of the IEEE Symposium on the Foundations of Computer Science, pp. 268-277 (1991)
8. Awerbuch, B., Patt-Shamir, B., Varghese, G., Dolev, S.: Self-stabilization by local checking and global reset. In: Proceedings of the Workshop on Distributed Algorithms. Lecture Notes in Computer Science 857, pp. 326-339. Springer (1994)
9. Awerbuch, B., Varghese, G.: Distributed program checking: a paradigm for building self-stabilizing distributed protocols. In: Proceedins of the IEEE Symposium on the Foundations of Computer Science, pp. 258-267 (1991)
10. Beauquier, J., Delaet, S., Dolev, S., Tixeuil, S.: Transient Fault Detectors. In: Proceedings of the 12th International Symposium on Distributed Computing, LNCS 1499, pp. 62-74. Springer-Verlag (1998)
11. Cohen, R., Fraigniaud, P., Ilcinkas, D., Korman, A., Peleg, D.: Labeling schemes for tree representation. In: Proceedings of the 7th International Workshop on Distributed Computing, LNCS 3741, pp. 13-24. Springer (2005)
12. Cohen, R., Fraigniaud, P., Ilcinkas, D., Korman, A., Peleg, D.: Label-guided graph exploration by a finite automaton. In: Proceedings of the 32nd International Colloquium on Automata, Languages, and Programming, pp. 335-346 (2005) (Pubitemid 41436113)
13. Dijkstra, E. W.: Self-stabilizing systems in spite of distributed control. Commun. ACM 17(11), 643-644 (1974)
14. Dixon, B., Rauch, M., Tarjan, R. E.: Verification and sensitivity analysis of minimum spanning trees in linear time. SIAM J. Comput. 21(6), 1184-1192 (1992)
15. Dolev, S., Gouda, M., Schneider, M.: Requirements for silent stabilization. Acta Inform. 136(6), 447-462 (1999)
16. Dolev, S., Israeli, A., Moran, S.: Self-stabilization of dynamic systems assuming only read/write atomicity. Distrib. Comput. J. 7(1), 3-16 (1993)
17. Dolev, S., Israeli, A., Moran, S.: Uniform dynamic self-stabilizing leader election. IEEE Trans. Parallel Distrib. Syst. 8(4), 424-440 (1997)
18. Even, S.: Graph Algorithms. Computer Science Press (1979)
19. Garey, M., Johnson, D.: Computers and Intractability. W. H. Freeman and Company, New York (1979)
20. Fredman, M. L., Willard, D. E.: Trans-dichotomous algorithms for minimum spanning trees and shortest paths. In: Proceedings of the 31st Annual Symposium on Foundations of Computer Science. Los Alamitos, CA, pp. 719-725 (1990)
21. Gallager, R. G., Humblet, P. A., Spira, P. M.: A distributed algorithm for minimum-weight spanning trees. ACM Trans. Program. Lang. Syst. 5, 66-77 (1983)
22. Gavoille, C.: Routing in distributed networks: overview and open problems. ACM SIGACT News-Distrib. Comput. Column 32, 36-52 (2001)
23. Gavoille, C., Peleg, D., Pérennes, S., Raz, R.: Distance labeling in graphs. J. Algorithms 53(1), 85-112 (2004)
24. Fraigniaud, P., Ilcinkas, D., Pelc, A.: Oracle size: a new measure of difficulty for communication tasks. In: Proceedings of the 25th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 179-187 (2006)
25. Fraigniaud, P., Ilcinkas, D., Pelc, A.: Tree exploration with an oracle. In: Proceedings of the 31st International Symposium on Mathematical Foundations of Computer Science, pp. 24-37 (2006)
26. Fraigniaud, P., Korman, A., Lebhar, E.: Local MST computation with short advice. In: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 154-160 (2007)
27. Jayaram, G. M., Varghese, G.: Crash failures can drive protocols to arbitrary states. In: Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing, pp. 247-256 (1996)
28. Jayaram, G. M., Varghese, G.: The complexity of crash failures. In: Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing, pp. 179-188
29. Kannan, S., Naor, M., Rudich, S.: Implicit representation of graphs. In: SIAM Joural on Descrete Mathematics 5, 596-603 (1992)
30. Karger, D. R., Klein, P. N., Tarjan, R. E.: A randomized linear-time algorithm to find minimum spanning trees. J. ACM 42(2), 321-328 (1955)
31. Katz, M., Katz, N. A., Korman, A., Peleg, D.: Labeling schemes for flow and connectivity. SIAM J. Comput. 34, 23-40 (2004)
32. Korman, A.: Labeling schemes for vertex connectivity. In: Proceedings of the 34th International Colloquium on Automata, Languages and Programming, pp. 102-109 (2007)
33. Korman, A., Kutten, S., Peleg, D.: Proof labeling schemes. A detailed version. http://ie.technion.ac.il/kutten/pdf/Proof LabelingSchemespdf
34. Korman, A., Kutten, S.: Distributed verification of minimum spanning trees. In: Proceedings of the 25th Annual ACM SIGACT-SIG-OPS Symposium on Principles of Distributed Computing, Denver, Colorado, USA, pp. 26-34 (2006)
35. Kuhn, F., Moscibroda, T., Wattenhofer, R.: What cannot be computed locally! In: Proceedings of the ACM Symposium on the Principles of Distributed Computing, pp. 300-309 (2004)
36. Kushilevitz, E., Nissan, N.: Communication complexity. Cambridge University Press (1997)
37. Linial, N.: Distributive graph algorithms-global solutions from local data. In: IEEE Symposium on the Foundations of Computer Science, pp. 331-335 (1987)
38. Naor, M., Stockmeyer, L.: What can be computed locally? In: Proceedings of the 25th ACM Symposium on Theory of Computing, pp. 184-193 (1993)
39. Peleg, D., Upfal, E.: A tradeoff between size and efficiency for routing tables. J. ACM 36, 510-530 (1989)
40. Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM (2000)
41. Peleg, D.: Proximity-preserving labeling schemes. J. Graph Theory 33, 167-176 (2000)
42. Peleg, D.: Informative Labeling Schemes for Graphs, Theoretical Computer Science 340. Special Issue of MFCS'00 papers pp. 577-593 (2005)
43. Santoro, N., Khatib, R.: Labeling and implicit routing in networks. Comput. J. 28, 5-8 (1985)
44. Tiwari, P.: Lower bounds on communication complexity in distributed computer networks. J. ACM 34, 921-938 (1987)
45. Wattenhofer, M., Wattenhofer, R.: Distributed weighted matching. In: Proceedings of the 18th International Symposium on Distributed Computing. LNCS 3274, pp. 335-348. Springer (2004)
46. Yao, A. C.: Some complexity questions related to distributed computing. In: Proceedings of the 11th ACM Symposium on Theory of Computing, pp. 209-213 (1979)