| Property testing lower bounds via communication complexity E Blais, J Brody, K Matulef computational complexity 21, 311-358, 2012 | 171 | 2012 |
| Testing k-wise and almost k-wise independence N Alon, A Andoni, T Kaufman, K Matulef, R Rubinfeld, N Xie Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007 | 136 | 2007 |
| Testing halfspaces K Matulef, R O'Donnell, R Rubinfeld, RA Servedio SIAM Journal on Computing 39 (5), 2004-2047, 2010 | 120 | 2010 |
| Testing for concise representations I Diakonikolas, HK Lee, K Matulef, K Onak, R Rubinfeld, RA Servedio, ... Foundations of Computer Science, 2007. FOCS'07. 48th Annual IEEE Symposium …, 2007 | 118 | 2007 |
| Testing±1-weight halfspace K Matulef, R O’Donnell, R Rubinfeld, RA Servedio International Workshop on Approximation Algorithms for Combinatorial …, 2009 | 34 | 2009 |
| Efficiently Testing Sparse GF(2) Polynomials I Diakonikolas, HK Lee, K Matulef, RA Servedio, A Wan International Colloquium on Automata, Languages, and Programming, 502-514, 2008 | 19 | 2008 |
| Finding the Maximum Area Parallelogram in a Convex Polygon. K Jin, K Matulef CCCG, 2011 | 15 | 2011 |
| Lower bounds for testing computability by small width OBDDs J Brody, K Matulef, C Wu International Conference on Theory and Applications of Models of Computation …, 2011 | 13 | 2011 |
| Efficiently testing sparse GF (2) polynomials I Diakonikolas, HK Lee, K Matulef, RA Servedio, A Wan Algorithmica 61 (3), 580-605, 2011 | 5 | 2011 |
| Lower bounds for testing computability by small-width branching programs J Brody, K Matulef, C Wu Proc. 8th Annual Theory and Applications of Models of Computation 11, 2011 | 3 | 2011 |
| Testing (subclasses of) halfspaces K Matulef, R O’Donnell, R Rubinfeld, R Servedio Property testing: current research and surveys, 334-340, 2010 | 2 | 2010 |
| Testing and learning Boolean functions KM Matulef Massachusetts Institute of Technology, 2009 | 2 | 2009 |
| Property testing on linked lists P Afshani, K Matulef, BT Wilkinson Electronic Colloquium on Computational Complexity, 2013 | 1 | 2013 |
| Geometric Partitioning. W Steiger CCCG, 2011 | | 2011 |
| Research Abstracts-2007 K Agrawal, YXH NUS, CE Leiserson, J Sukha, N Alon, A Andoni, ... | | |
Joshua BrodyAssociate Professor, Swarthmore College在 cs.swarthmore.edu 的电子邮件经过验证
