Mor Baruch
ABSTRACT
Proof-labeling schemes, introduced by Korman, Kutten and Peleg [PODC 2005], are a mechanism to certify that a network configuration satisfies a given boolean predicate. Such mechanisms find applications in many contexts, e.g., the design of fault-tolerant distributed algorithms. In a proof-labeling scheme, predicate verification consists of neighbors exchanging labels, whose contents depends on the predicate. In this paper, we introduce the notion of randomized proof-labeling schemes where messages are randomized and correctness is probabilistic. We show that randomization reduces label size exponentially while guaranteeing probability of correctness arbitrarily close to one. In addition, we present a novel label-size lower bound technique that applies to both deterministic and randomized proof-labeling schemes. Using this technique, we establish several tight bounds on the verification complexity of MST, acyclicity, connectivity, and longest cycle size.
- Y. Afek, S. Kutten, and M. Yung. The local detection paradigm and its application to self-stabilization. Theor. Comput. Sci., 186(1--2):199--229, 1997. Google Scholar
Digital Library
- S. Alstrup, P. Bille, and T. Rauhe. Labeling schemes for small distances in trees. In 14th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 689--698, 2003. Google ScholarDigital Library
- S. Alstrup, C. Gavoille, H. Kaplan, and T. Rauhe. Nearest common ancestors: a survey and a new distributed algorithm. In 14th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), pages 258--264, 2002. Google ScholarDigital Library
- S. Alstrup and T. Rauhe. Small induced-universal graphs and compact implicit graph representations. In 43rd Symposium on Foundations of Computer Science (FOCS), pages 53--62, 2002. Google ScholarDigital Library
- H. Arfaoui, P. Fraigniaud, D. Ilcinkas, and F. Mathieu. Distributedly testing cycle-freeness. In 40th Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG), LNCS, pages 15--28. Springer, 2014.Google ScholarCross Ref
- H. Arfaoui, P. Fraigniaud, and A. Pelc. Local decision and verification with bounded-size outputs. In 15th Symp. on Stabilization, Safety, and Security of Distributed Systems (SSS), LNCS, pages 133--147. Springer, 2013. Google ScholarDigital Library
- B. Awerbuch, B. Patt-Shamir, and G. Varghese. Self-stabilization by local checking and correction. In 32nd Symposium on Foundations of Computer Science (FOCS), pages 268--277. IEEE, 1991. Google ScholarDigital Library
- L. Blin, P. Fraigniaud, and B. Patt-Shamir. On proof-labeling schemes versus silent self-stabilizing algorithms. In 16th Int. Symp. on Stabilization, Safety, and Security of Distributed Systems (SSS), LNCS, pages 18--32. Springer, 2014.Google ScholarCross Ref
- E. Cohen, E. Halperin, H. Kaplan, and U. Zwick. Reachability and distance queries via 2-hop labels. In 13th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 937--946, 2002. Google ScholarDigital Library
- A. Das Sarma, S. Holzer, L. Kor, A. Korman, D. Nanongkai, G. Pandurangan, D. Peleg, and R. Wattenhofer. Distributed verification and hardness of distributed approximation. SIAM J. Comput., 41(5):1235--1265, 2012.Google ScholarDigital Library
- P. Fraigniaud and C. Gavoille. Routing in trees. In 28th International Colloquium on Automata, Languages and Programming (ICALP), LNCS, pages 757--772. Springer, 2001. Google ScholarDigital Library
- P. Fraigniaud and C. Gavoille. A space lower bound for routing in trees. In 19th Symp. on Theoretical Aspects of Computer Science (STACS), LNCS, pages 65--75. Springer, 2002. Google ScholarDigital Library
- P. Fraigniaud and A. Korman. On randomized representations of graphs using short labels. In 21st ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), pages 131--137, 2009. Google ScholarDigital Library
- P. Fraigniaud, A. Korman, and D. Peleg. Towards a complexity theory for local distributed computing. J. ACM, 60(5):35, 2013. Google ScholarDigital Library
- P. Fraigniaud, S. Rajsbaum, and C. Travers. Locality and checkability in wait-free computing. Distributed Computing, 26(4):223--242, 2013.Google ScholarDigital Library
- P. Fraigniaud, S. Rajsbaum, and C. Travers. On the number of opinions needed for fault-tolerant run-time monitoring in distributed systems. In 5th International Conference on Runtime Verification (RV), LNCS, pages 92--107. Springer, 2014.Google ScholarCross Ref
- C. Gavoille, M. Katz, N. A. Katz, C. Paul, and D. Peleg. Approximate distance labeling schemes. In 9th European Symposium on Algorithms (ESA), pages 476--487, 2001. Google ScholarDigital Library
- C. Gavoille and C. Paul. Split decomposition and distance labelling: An optimal scheme for distance hereditary graphs. Electronic Notes in Discrete Mathematics, 10:117--120, 2001.Google ScholarCross Ref
- C. Gavoille, D. Peleg, S. Perennes, and R. Raz. Distance labeling in graphs. In 12th ACM Symposium on Discrete Algorithms (SODA), pages 210--219, 2001. Google ScholarDigital Library
- M. Göös and J. Suomela. Locally checkable proofs. In 30th ACM Symp. on Principles of Distributed Computing (PODC), pages 159--168, 2011. Google ScholarDigital Library
- J. E. Hopcroft and R. E. Tarjan. Efficient algorithms for graph manipulation. Commun. ACM, 16(6):372--378, 1973. Google ScholarDigital Library
- G. Itkis and L. A. Levin. Fast and lean self-stabilizing asynchronous protocols. In 35th Annual Symposium on Foundations of Computer Science (FOCS), pages 226--239. IEEE, 1994. Google ScholarDigital Library
- S. Kannan, M. Naor, and S. Rudich. Implicit representation of graphs. SIAM J. Discrete Math., 5(4):596--603, 1992. Google ScholarDigital Library
- H. Kaplan and T. Milo. Short and simple labels for small distances and other functions. In 7th Int. Workshop on Algorithms and Data Structures (WADS), pages 246--257, 2001. Google ScholarDigital Library
- M. Katz, N. A. Katz, A. Korman, and D. Peleg. Labeling schemes for flow and connectivity. In 13th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 927--936, 2002. Google ScholarDigital Library
- M. Katz, N. A. Katz, and D. Peleg. Distance labeling schemes for well-separated graph classes. Discrete Applied Mathematics, 145(3):384--402, 2005. Google ScholarDigital Library
- A. Korman. Labeling schemes for vertex connectivity. ACM Transactions on Algorithms, 6(2), 2010. Google ScholarDigital Library
- A. Korman and S. Kutten. Distributed verification of minimum spanning trees. Distributed Computing, 20:253--266, 2007.Google ScholarDigital Library
- A. Korman, S. Kutten, and T. Masuzawa. Fast and compact self stabilizing verification, computation, and fault detection of an MST. In 30th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 311--320, 2011. Google ScholarDigital Library
- A. Korman, S. Kutten, and D. Peleg. Proof labeling schemes. Distributed Computing, 22(4):215--233, 2010.Google ScholarDigital Library
- A. Korman, D. Peleg, and Y. Rodeh. Constructing labeling schemes through universal matrices. Algorithmica, 57(4):641--652, 2010. Google ScholarDigital Library
- E. Kushilevitz and N. Nisan. Communication complexity. Cambridge University Press, 1997. Google ScholarDigital Library
- C. H. Papadimitriou. Computational Complexity. Addison Wesley Longman, 1994.Google Scholar
- D. Peleg. Proximity-preserving labeling schemes and their applications. In 25th International Workshop Graph-Theoretic Concepts in Computer Science (WG), pages 30--41, 1999. Google ScholarDigital Library
- D. Peleg. Informative labeling schemes for graphs. Theor. Comput. Sci., 340(3):577--593, 2005. Google ScholarDigital Library
- M. Thorup. Compact oracles for reachability and approximate distances in planar digraphs. In 42nd Symp. on Foundations of Computer Science (FOCS), pages 242--251, 2001. Google ScholarDigital Library
- M. Thorup and U. Zwick. Compact routing schemes. In 13th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), pages 1--10, 2001. Google ScholarDigital Library
Index Terms
- Randomized Proof-Labeling Schemes
Recommendations
Randomized proof-labeling schemes
Proof-labeling schemes, introduced by Korman et al. (Distrib Comput 22(4):215---233, 2010. https://doi.org/10.1007/s00446-010-0095-3), are a mechanism to certify that a network configuration satisfies a given boolean predicate. Such mechanisms find ...
Randomized Approximate Nearest Neighbor Search with Limited Adaptivity
Special Issue on SPAA 2016We study the complexity of parallel data structures for approximate nearest neighbor search in d-dimensional Hamming space {0,1}d. A classic model for static data structures is the cell-probe model [27]. We consider a cell-probe model with limited ...
Randomized Approximate Nearest Neighbor Search with Limited Adaptivity
SPAA '16: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and ArchitecturesWe study the problem of approximate nearest neighbor search in $d$-dimensional Hamming space {0,1}d. We study the complexity of the problem in the famous cell-probe model, a classic model for data structures. We consider algorithms in the cell-probe ...
Comments