Author:
Goldreich Oded,Krivelevich Michael,Newman Ilan,Rozenberg Eyal
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference31 articles.
1. Alon N.: Testing Subgraphs of Large Graphs. Random Structures and Algorithms. 21, 359–370 (2002)
2. Alon N., Babai L., Itai A.: A fast and Simple Randomized Algorithm for the Maximal Independent Set Problem. J. of Algorithms. 7, 567–583 (1986)
3. Alon N., Fischer E., Krivelevich M., Szegedy M.: Efficient Testing of Large Graphs. Combinatorica. 20, 451–476 (2000)
4. N. Alon, E. Fischer, I. Newman & A. Shapira. A Combinatorial Characterization of the Testable Graph Properties: It’s All About Regularity. In 38th STOC, pages 251–260, 2006.
5. Alon N., Goldreich O., Hastad J., Peralta R.: Simple constructions of almost k-wise independent random variables. Journal of Random structures and Algorithms. 3(3), 354–482 (1992)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Non-adaptive vs Adaptive Queries in the Dense Graph Testing Model;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02
2. Testing graphs in vertex-distribution-free models;Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing;2019-06-23
3. Hierarchy Theorems for Testing Properties in Size-Oblivious Query Complexity;computational complexity;2019-06-06
4. A generalized Turán problem and its applications;Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing;2018-06-20
5. On Being Far from Far and on Dual Problems in Property Testing;Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science;2016-01-14