# Eric Price

According to our database1, Eric Price authored at least 63 papers between 2007 and 2020.

Collaborative distances:

Book
In proceedings
Article
PhD thesis
Other

## Bibliography

2020
A Fast Binary Splitting Approach to Non-Adaptive Group Testing.
CoRR, 2020

Separations and equivalences between turnstile streaming and linear sketching.
Proceedings of the Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

2019
Active Perception Based Formation Control for Multiple Aerial Vehicles.
IEEE Robotics Autom. Lett., 2019

Lower Bounds for Compressed Sensing with Generative Models.
CoRR, 2019

Exponential Separations Between Turnstile Streaming and Linear Sketching.
CoRR, 2019

Collision-Based Testers are Optimal for Uniformity and Closeness.
Chicago J. Theor. Comput. Sci., 2019

Compressed Sensing with Adversarial Sparse Noise via L1 Regression.
Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

The Complexity of Counting Cycles in the Adjacency List Streaming Model.
Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019

Outlier-Robust High-Dimensional Sparse Estimation via Iterative Filtering.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Proceedings of the 36th International Conference on Machine Learning, 2019

Markerless Outdoor Human Motion Capture Using Multiple Autonomous Micro Aerial Vehicles.
Proceedings of the 2019 IEEE/CVF International Conference on Computer Vision, 2019

Estimating the Frequency of a Clustered Signal.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Active Regression via Linear-Sample Sparsification.
Proceedings of the Conference on Learning Theory, 2019

2018
Deep Neural Network-Based Cooperative Visual Tracking Through Multiple Micro Aerial Vehicles.
IEEE Robotics Autom. Lett., 2018

Adversarial Examples from Cryptographic Pseudo-Random Generators.
CoRR, 2018

Batch Sparse Recovery, or How to Leverage the Average Sparsity.
CoRR, 2018

Compressed Sensing with Deep Image Prior and Learned Regularization.
CoRR, 2018

CoRR, 2018

Deep Neural Network-based Cooperative Visual Tracking through Multiple Micro Aerial Vehicles.
CoRR, 2018

AmbientGAN: Generative models from lossy measurements.
Proceedings of the 6th International Conference on Learning Representations, 2018

The Sketching Complexity of Graph and Hypergraph Counting.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

Stochastic Multi-armed Bandits in Constant Space.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

2017
Sample-Optimal Identity Testing with High Probability.
Electronic Colloquium on Computational Complexity (ECCC), 2017

Condition number-free query and active learning of linear families.
CoRR, 2017

Fast Regression with an $\ell_\infty$ Guarantee.
CoRR, 2017

A Hybrid Sampling Scheme for Triangle Counting.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Compressed Sensing using Generative Models.
Proceedings of the 34th International Conference on Machine Learning, 2017

Fast sparse recovery for any RIP-1 matrix.
Proceedings of the 2017 IEEE International Conference on Acoustics, 2017

Fast Regression with an $ell_infty$ Guarantee.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Robust Polynomial Regression up to the Information Theoretic Limit.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

Testing Hereditary Properties of Sequences.
Proceedings of the Approximation, 2017

2016
Sparse Fourier Transform.
Encyclopedia of Algorithms, 2016

Extensions and Limitations of the Neural GPU.
CoRR, 2016

Improved graph sampling for triangle counting.
CoRR, 2016

Equality of Opportunity in Supervised Learning.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Fourier-Sparse Interpolation without a Frequency Gap.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015
Nearly-optimal bounds for sparse recovery in generic norms, with applications to $k$-median sketching.
CoRR, 2015

Tight Bounds for Learning a Mixture of Two Gaussians.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Binary Embedding: Fundamental Limits and Fast Algorithm.
Proceedings of the 32nd International Conference on Machine Learning, 2015

A Robust Sparse Fourier Transform in the Continuous Setting.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

SCRAM: Scalable Collision-avoiding Role Assignment with Minimal-Makespan for Formational Positioning.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Optimal Lower Bound for Itemset Frequency Indicator Sketches.
CoRR, 2014

Sharp bounds for learning a mixture of two gaussians.
CoRR, 2014

New constructions of RIP matrices with fast multiplication and fewer rows.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Improved Concentration Bounds for Count-Sketch.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

(Nearly) Sample-Optimal Sparse Fourier Transform.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

The Noisy Power Method: A Meta Algorithm with Applications.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

Trace Reconstruction Revisited.
Proceedings of the Algorithms - ESA 2014, 2014

2013
Sparse recovery and Fourier sampling.
PhD thesis, 2013

Lower Bounds for Adaptive Sparse Recovery.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Sample-optimal average-case sparse Fourier Transform in two dimensions.
Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012
Compressive Sensing with Local Geometric Features.
Int. J. Comput. Geom. Appl., 2012

Nearly optimal sparse fourier transform.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Simple and practical algorithm for sparse Fourier transform.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Applications of the Shannon-Hartley theorem to data streams and sparse recovery.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
K-median clustering, model-based compressive sensing, and sparse recovery for earth mover distance.
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Efficient Sketches for the Set Query Problem.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

(1 + eps)-Approximate Sparse Recovery.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

On the Power of Adaptivity in Sparse Recovery.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010
Confluently Persistent Tries for Efficient Version Control.
Algorithmica, 2010

Lower Bounds for Sparse Recovery.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2007
Browser-Based Attacks on Tor.
Proceedings of the Privacy Enhancing Technologies, 7th International Symposium, 2007