Author:
Blais Eric,Brody Joshua,Matulef Kevin
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference46 articles.
1. Noga Alon & Eric Blais (2010). Testing Boolean Function Isomorphism. In Proc. 14th International Workshop on Randomization and Approximation Techniques in Computer Science, 394–405.
2. Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar & D. Sivakumar (2002). An Information Statistics Approach to Data Stream and Communication Complexity. In Proc. 43rd Annual IEEE Symposium on Foundations of Computer Science, 209–218.
3. Tugkan Batu, Ronitt Rubinfeld & Patrick White (1999). Fast Approximate PCPs for Multidimensional Bin-Packing Problems. In Proc. 3rd International Workshop on Randomization and Approximation Techniques in Computer Science, 245–256.
4. Arnab Bhattacharyya, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova & David P. Woodruff (2009). Transitive-Closure Spanners of the Hypercube and the Hypergrid. Technical Report TR09-046, ECCC.
5. Eric Blais (2008). Improved Bounds for Testing Juntas. In Proc. 12th International Workshop on Randomization and Approximation Techniques in Computer Science, 317–330.
Cited by
43 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献