Property testing lower bounds via communication complexity E Blais, J Brody, K Matulef computational complexity 21 (2), 311-358, 2012 | 139 | 2012 |

Testing juntas nearly optimally E Blais Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009 | 115 | 2009 |

Rapid sampling for visualizations with ordering guarantees A Kim, E Blais, A Parameswaran, P Indyk, S Madden, R Rubinfeld Proceedings of the VLDB Endowment International Conference on Very Large …, 2015 | 79 | 2015 |

Performance prediction of configurable software systems by fourier learning (t) Y Zhang, J Guo, E Blais, K Czarnecki 2015 30th IEEE/ACM International Conference on Automated Software …, 2015 | 56 | 2015 |

Active property testing MF Balcan, E Blais, A Blum, L Yang 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 21-30, 2012 | 49 | 2012 |

A polynomial lower bound for testing monotonicity A Belovs, E Blais Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 45 | 2016 |

Improved bounds for testing juntas E Blais Approximation, Randomization and Combinatorial Optimization. Algorithms and …, 2008 | 44 | 2008 |

Lower bounds for testing properties of functions over hypergrid domains E Blais, S Raskhodnikova, G Yaroslavtsev 2014 IEEE 29th Conference on Computational Complexity (CCC), 309-320, 2014 | 39 | 2014 |

Polynomial regression under arbitrary product distributions E Blais, R O’Donnell, K Wimmer Machine learning 80 (2-3), 273-294, 2010 | 38 | 2010 |

Lower bounds for testing function isomorphism E Blais, R O'Donnell 2010 IEEE 25th Annual Conference on Computational Complexity, 235-246, 2010 | 35 | 2010 |

Testing boolean function isomorphism N Alon, E Blais Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2010 | 34 | 2010 |

I've seen" enough" incrementally improving visualizations to support rapid decision making S Rahman, M Aliakbarpour, HK Kong, E Blais, K Karahalios, ... Proceedings of the VLDB Endowment 10 (11), 1262-1273, 2017 | 33 | 2017 |

Distribution testing lower bounds via reductions from communication complexity E Blais, CL Canonne, T Gur ACM Transactions on Computation Theory (TOCT) 11 (2), 1-37, 2019 | 32* | 2019 |

Learning circuits with few negations E Blais, CL Canonne, IC Oliveira, RA Servedio, LY Tan arXiv preprint arXiv:1410.8420, 2014 | 29 | 2014 |

On the inference of parsimonious indel evolutionary scenarios L Chindelevitch, Z Li, E Blais, M Blanchette Journal of bioinformatics and computational biology 4 (03), 721-744, 2006 | 28 | 2006 |

Partially symmetric functions are efficiently isomorphism testable E Blais, A Weinstein, Y Yoshida SIAM Journal on Computing 44 (2), 411-432, 2015 | 26 | 2015 |

Tight Bounds for Testing *k*-LinearityE Blais, D Kane Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2012 | 21 | 2012 |

Gene maps linearization using genomic rearrangement distances G Blin, E Blais, D Hermelin, P Guillon, M Blanchette, N El-Mabrouk Journal of Computational Biology 14 (4), 394-407, 2007 | 19 | 2007 |

Tolerant junta testing and the connection to submodular optimization and function isomorphism E Blais, CL Canonne, T Eden, A Levi, D Ron ACM Transactions on Computation Theory (TOCT) 11 (4), 1-33, 2019 | 14 | 2019 |

Approximating Boolean functions with depth-2 circuits E Blais, LY Tan SIAM Journal on Computing 44 (6), 1583-1600, 2015 | 14 | 2015 |