| Candidate weak pseudorandom functions in AC0 ○ MOD2 A Akavia, A Bogdanov, S Guo, A Kamath, A Rosen Proceedings of the 5th conference on Innovations in theoretical computer …, 2014 | 70 | 2014 |
| Adaptively secure constrained pseudorandom functions D Hofheinz, A Kamath, V Koppula, B Waters International Conference on Financial Cryptography and Data Security, 357-376, 2019 | 34 | 2019 |
| Adaptively secure constrained pseudorandom functions D Hofheinz, A Kamath, V Koppula, B Waters Cryptology ePrint Archive, 2014 | 26 | 2014 |
| On the power of compressed sensing with generative models A Kamath, E Price, S Karmalkar International Conference on Machine Learning, 5101-5109, 2020 | 19 | 2020 |
| A simple proof of a new set disjointness with applications to data streams A Kamath, E Price, DP Woodruff arXiv preprint arXiv:2105.11338, 2021 | 16 | 2021 |
| Lower bounds for compressed sensing with generative models A Kamath, S Karmalkar, E Price arXiv preprint arXiv:1912.02938, 2019 | 16 | 2019 |
| Adaptive sparse recovery with limited adaptivity A Kamath, E Price Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 12 | 2019 |
| Testing whether the uniform distribution is a stationary distribution S Chakraborty, A Kamath, R Pratap Information Processing Letters 116 (7), 475-480, 2016 | 1 | 2016 |
| Testing uniformity of stationary distribution S Chakraborty, A Kamath, R Pratap The Seventh European Conference on Combinatorics, Graph Theory and …, 2013 | 1 | 2013 |
| Lower bounds for sparse recovery problems AD Kamath The University of Texas at Austin, 2020 | | 2020 |
| Survey: Lasserre Hierarchy towards Approximation Algorithms AD Kamath | | |
Eric PriceAssociate Professor of Computer Science at the University of Texas at Austin在 cs.utexas.edu 的电子邮件经过验证
