Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference13 articles.
1. Efficient testing of large graphs;Alon;Combinatorica,2000
2. Regular languages are testable with a constant number of queries;Alon;SIAM J. Comput.,2001
3. Fast approximation PCPs for multidimensional bin-packing problems;Batu,1999
4. Extremal Graph Theory;Bollobás,1978
5. Transforming comparison model lower bounds to the parallel-random-access-machine;Breslauer;Inf. Process. Lett.,1997
Cited by
46 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Improved algorithm for permutation testing;Theoretical Computer Science;2024-02
2. A d1/2+o(1) Monotonicity Tester for Boolean Functions on d-Dimensional Hypergrids*;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
3. Directed Isoperimetric Theorems for Boolean Functions on the Hypergrid and an Õ(n√d) Monotonicity Tester;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
4. Estimating the Longest Increasing Subsequence in Nearly Optimal Time;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
5. Non-adaptive vs Adaptive Queries in the Dense Graph Testing Model;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02