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

Testing juntas nearly optimally E Blais Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009 | 138 | 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 | 125 | 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 | 101 | 2015 |

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 | 82 | 2017 |

Active property testing MF Balcan, E Blais, A Blum, L Yang 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 21-30, 2012 | 73 | 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 | 69 | 2016 |

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 | 63* | 2019 |

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

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 | 60 | 2014 |

Improved bounds for testing juntas E Blais International Workshop on Approximation Algorithms for Combinatorial …, 2008 | 54 | 2008 |

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

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

Testing boolean function isomorphism N Alon, E Blais International Workshop on Randomization and Approximation Techniques in …, 2010 | 37 | 2010 |

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 | 37 | 2006 |

A mathematical model of performance-relevant feature interactions Y Zhang, J Guo, E Blais, K Czarnecki, H Yu Proceedings of the 20th International Systems and Software Product Line …, 2016 | 33 | 2016 |

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 | 32 | 2019 |

Tight Bounds for Testing *k*-LinearityE Blais, D Kane International Workshop on Approximation Algorithms for Combinatorial …, 2012 | 26* | 2012 |

Graphics processing method and system IR Ameline, EA Blais US Patent 8,744,184, 2014 | 23 | 2014 |

A tight composition theorem for the randomized query complexity of partial functions S Ben-David, E Blais 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020 | 21 | 2020 |