| Flashattention: Fast and memory-efficient exact attention with io-awareness T Dao, D Fu, S Ermon, A Rudra, C Ré Advances in Neural Information Processing Systems 35, 16344-16359, 2022 | 1416 | 2022 |
| Worst-case optimal join algorithms HQ Ngo, E Porat, C Ré, A Rudra Journal of the ACM (JACM) 65 (3), 1-40, 2018 | 428 | 2018 |
| Efficient Rijndael encryption implementation with composite field arithmetic A Rudra, PK Dubey, CS Jutla, V Kumar, JR Rao, P Rohatgi Cryptographic Hardware and Embedded Systems—CHES 2001: Third International …, 2001 | 414* | 2001 |
| Combining recurrent, convolutional, and continuous-time models with linear state space layers A Gu, I Johnson, K Goel, K Saab, T Dao, A Rudra, C Ré Advances in neural information processing systems 34, 572-585, 2021 | 413 | 2021 |
| Hippo: Recurrent memory with optimal polynomial projections A Gu, T Dao, S Ermon, A Rudra, C Ré Advances in neural information processing systems 33, 1474-1487, 2020 | 393 | 2020 |
| Hungry hungry hippos: Towards language modeling with state space models DY Fu, T Dao, KK Saab, AW Thomas, A Rudra, C Ré arXiv preprint arXiv:2212.14052, 2022 | 343 | 2022 |
| Skew strikes back: new developments in the theory of join algorithms HQ Ngo, C Ré, A Rudra Acm Sigmod Record 42 (4), 5-16, 2014 | 316 | 2014 |
| Online learning in online auctions A Blum, V Kumar, A Rudra, F Wu Theoretical Computer Science 324 (2-3), 137-146, 2004 | 247 | 2004 |
| Explicit codes achieving list decoding capacity: Error-correction with optimal redundancy V Guruswami, A Rudra IEEE Transactions on Information Theory 54 (1), 135-150, 2008 | 242 | 2008 |
| FAQ: questions asked frequently M Abo Khamis, HQ Ngo, A Rudra Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2016 | 231 | 2016 |
| Efficiently decodable non-adaptive group testing P Indyk, HQ Ngo, A Rudra Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010 | 174 | 2010 |
| Essential coding theory V Guruswami, A Rudra, M Sudan Draft available at http://cse. buffalo. edu/faculty/atri/courses/coding …, 2019 | 160* | 2019 |
| Ordering by weighted number of wins gives a good ranking for weighted tournaments D Coppersmith, L Fleischer, A Rudra Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006 | 152 | 2006 |
| Approximating matches made in heaven N Chen, N Immorlica, AR Karlin, M Mahdian, A Rudra Automata, Languages and Programming: 36th International Colloquium, ICALP …, 2009 | 147 | 2009 |
| When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings N Bansal, A Gupta, J Li, J Mestre, V Nagarajan, A Rudra Algorithmica, 1-30, 2012 | 130 | 2012 |
| Scatterbrain: Unifying sparse and low-rank attention B Chen, T Dao, E Winsor, Z Song, A Rudra, C Ré Advances in Neural Information Processing Systems 34, 17413-17426, 2021 | 127 | 2021 |
| Learning fast algorithms for linear transforms using butterfly factorizations T Dao, A Gu, M Eichhorn, A Rudra, C Ré International conference on machine learning, 1517-1527, 2019 | 124 | 2019 |
| Testing low‐degree polynomials over prime fields CS Jutla, AC Patthak, A Rudra, D Zuckerman Random Structures & Algorithms 35 (2), 163-193, 2009 | 103 | 2009 |
| An energy complexity model for algorithms S Roy, A Rudra, A Verma Proceedings of the 4th conference on Innovations in Theoretical Computer …, 2013 | 101 | 2013 |
| Explicit capacity-achieving list-decodable codes V Guruswami, A Rudra Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006 | 96 | 2006 |
Christopher RéComputer Science, Stanford UniversityVerified email at cs.stanford.edu
