| Randomised Composition and Small-Bias Minimax | 1 | 0.43 | 2022 |
| VC dimension and distribution-free sample-based testing | 0 | 0.34 | 2021 |
| A Polynomial Lower Bound For Testing Monotonicity | 0 | 0.34 | 2021 |
| On Testing and Robust Characterizations of Convexity. | 0 | 0.34 | 2020 |
| Testing convexity of functions over finite domains. | 0 | 0.34 | 2020 |
| A Tight Composition Theorem for the Randomized Query Complexity of Partial Functions: Extended Abstract | 0 | 0.34 | 2020 |
| A New Minimax Theorem for Randomized Algorithms (Extended Abstract) | 0 | 0.34 | 2020 |
| Distribution Testing Lower Bounds via Reductions from Communication Complexity. | 0 | 0.34 | 2019 |
| Optimal Separation and Strong Direct Sum for Randomized Query Complexity. | 0 | 0.34 | 2019 |
| Testing submodularity and other properties of valuation functions. | 0 | 0.34 | 2017 |
| I've Seen "Enough": Incrementally Improving Visualizations to Support Rapid Decision Making. | 0 | 0.34 | 2017 |
| I've seen "enough": incrementally improving visualizations to support rapid decision making | 7 | 0.40 | 2017 |
| A Worst-Case Analysis of Constraint-Based Algorithms for Exact Multi-objective Combinatorial Optimization. | 1 | 0.34 | 2017 |
| Learning and Testing Junta Distributions. | 1 | 0.35 | 2016 |
| Alice and Bob Show Distribution Testing Lower Bounds (They don't talk to each other anymore.). | 1 | 0.38 | 2016 |
| A characterization of constant-sample testable properties | 0 | 0.34 | 2016 |
| A mathematical model of performance-relevant feature interactions. | 4 | 0.38 | 2016 |
| A Polynomial Lower Bound for Testing Monotonicity. | 11 | 0.73 | 2016 |
| Partially Symmetric Functions Are Efficiently Isomorphism Testable | 0 | 0.34 | 2015 |
| Quantum Algorithm for Monotonicity Testing on the Hypercube | 5 | 0.46 | 2015 |
| Rapid Sampling for Visualizations with Ordering Guarantees. | 0 | 0.34 | 2015 |
| An inequality for the Fourier spectrum of parity decision trees | 1 | 0.35 | 2015 |
| Performance Prediction of Configurable Software Systems by Fourier Learning (T) | 25 | 0.75 | 2015 |
| Rapid sampling for visualizations with ordering guarantees | 34 | 0.87 | 2014 |
| Semi-Strong Colouring of Intersecting Hypergraphs. | 2 | 0.42 | 2014 |
| On DNF Approximators for Monotone Boolean Functions. | 1 | 0.36 | 2014 |
| The Information Complexity of Hamming Distance. | 2 | 0.37 | 2014 |
| Approximating Boolean Functions with Depth-2 Circuits | 2 | 0.37 | 2013 |
| Lower Bounds for Testing Properties of Functions over Hypergrid Domains | 3 | 0.38 | 2013 |
| Nearly Tight Bounds for Testing Function Isomorphism. | 2 | 0.38 | 2013 |
| Hypercontractivity Via the Entropy Method. | 1 | 0.40 | 2013 |
| Partially Symmetric Functions Are Efficiently Isomorphism-Testable | 2 | 0.38 | 2012 |
| Tight Bounds for Testing k-Linearity. | 11 | 0.58 | 2012 |
| Property Testing Lower Bounds via Communication Complexity | 66 | 2.13 | 2011 |
| Active Testing | 0 | 0.34 | 2011 |
| Testing juntas: a brief survey | 1 | 0.35 | 2010 |
| k + Decision Trees - (Extended Abstract) | 1 | 0.43 | 2010 |
| Lower Bounds for Testing Function Isomorphism | 17 | 0.84 | 2010 |
| Testing juntas nearly optimally | 30 | 1.00 | 2009 |
| Improved Bounds for Testing Juntas | 18 | 0.86 | 2008 |
| Polynomial regression under arbitrary product distributions | 16 | 0.88 | 2008 |
| Gene maps linearization using genomic rearrangement distances. | 8 | 0.59 | 2007 |
| Common substrings in random strings | 0 | 0.34 | 2006 |
| On the inference of parsimonious indel evolutionary scenarios. | 11 | 0.89 | 2006 |
| Inferring gene orders from gene maps using the breakpoint distance | 1 | 0.36 | 2006 |
