Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing
暂无分享,去创建一个
[1] Alexander Lubotzky,et al. Discrete groups, expanding graphs and invariant measures , 1994, Progress in mathematics.
[2] Venkatesan Guruswami,et al. Non-malleable Coding Against Bit-Wise and Split-State Tampering , 2013, Journal of Cryptology.
[3] Béla Bollobás,et al. THE ASYMPTOTIC NUMBER OF UNLABELLED REGULAR GRAPHS , 1982 .
[4] Oded Goldreich. On Testing Hamiltonicity in the Bounded Degree Graph Model , 2020, Electron. Colloquium Comput. Complex..
[5] László Babai,et al. Graph isomorphism in quasipolynomial time [extended abstract] , 2015, STOC.
[6] Oded Goldreich,et al. Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity , 1988, SIAM J. Comput..
[7] David Ellis,et al. The expansion of random regular graphs , 2011 .
[8] N. Linial,et al. Expander Graphs and their Applications , 2006 .
[9] Benny Sudakov,et al. On the asymmetry of random regular graphs and random graphs , 2002, Random Struct. Algorithms.
[10] Dana Ron,et al. Property testing and its connection to learning and approximation , 1998, JACM.
[11] Omer Reingold,et al. Assignment testers: towards a combinatorial proof of the PCP-theorem , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[12] Svante Janson,et al. Permutation Pseudographs and Contiguity , 2002, Combinatorics, Probability and Computing.
[13] Ronitt Rubinfeld,et al. Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..
[14] Oded Goldreich,et al. Introduction to Property Testing , 2017 .
[15] Kenji Obata,et al. A lower bound for testing 3-colorability in bounded-degree graphs , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[16] Lance Fortnow,et al. Tolerant versus intolerant testing for Boolean properties , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).
[17] M. Murty. Ramanujan Graphs , 1965 .
[18] Eli Ben-Sasson,et al. Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding , 2004, SIAM J. Comput..
[19] B. Bollobás. Distinguishing Vertices of Random Graphs , 1982 .
[20] László Babai,et al. Graph isomorphism in quasipolynomial time [extended abstract] , 2016, STOC.
[21] G. David Forney,et al. Concatenated codes , 2009, Scholarpedia.
[22] P. Erdös. ASYMMETRIC GRAPHS , 2022 .
[23] B. Abdolmaleki. Non-Malleable Codes , 2017 .
[24] Dana Ron,et al. Property Testing in Bounded Degree Graphs , 2002, STOC '97.
[25] Yevgeniy Dodis,et al. Non-malleable extractors and symmetric key cryptography from weak secrets , 2009, STOC '09.
[26] Y. Cho,et al. Discrete Groups , 1994 .
[27] Oded Goldreich,et al. Hierarchy Theorems for Property Testing , 2011, computational complexity.
[28] J. Bourgain,et al. Uniform expansion bounds for Cayley graphs of SL2(Fp) , 2008 .
[29] Vipul Goyal,et al. Non-malleable extractors and codes, with their many tampered extensions , 2015, IACR Cryptol. ePrint Arch..
[30] Ronitt Rubinfeld,et al. Tolerant property testing and distance approximation , 2006, J. Comput. Syst. Sci..
[31] Oded Goldreich,et al. Every set in P is strongly testable under a suitable encoding , 2018, Electron. Colloquium Comput. Complex..
[32] Eugene M. Luks,et al. Isomorphism of graphs of bounded valence can be tested in polynomial time , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[33] Avi Wigderson,et al. Non-adaptive vs Adaptive Queries in the Dense Graph Testing Model , 2020, Electron. Colloquium Comput. Complex..