| Efficient Rijndael encryption implementation with composite field arithmetic A Rudra, PK Dubey, CS Jutla, V Kumar, JR Rao, P Rohatgi International Workshop on Cryptographic Hardware and Embedded Systems, 171-184, 2001 | 377* | 2001 |
| Online learning in online auctions A Blum, V Kumar, A Rudra, F Wu Theoretical Computer Science 324 (2-3), 137-146, 2004 | 199 | 2004 |
| Worst-case optimal join algorithms HQ Ngo, E Porat, C Ré, A Rudra Journal of the ACM (JACM) 65 (3), 1-40, 2018 | 196 | 2018 |
| 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 | 162 | 2008 |
| 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 | 145 | 2014 |
| 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 | 138 | 2006 |
| Efficiently decodable non-adaptive group testing P Indyk, HQ Ngo, A Rudra Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010 | 127 | 2010 |
| FAQ: questions asked frequently M Abo Khamis, HQ Ngo, A Rudra Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2016 | 103* | 2016 |
| Approximating matches made in heaven N Chen, N Immorlica, AR Karlin, M Mahdian, A Rudra International Colloquium on Automata, Languages, and Programming, 266-278, 2009 | 103 | 2009 |
| Explicit capacity-achieving list-decodable codes V Guruswami, A Rudra Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006 | 86 | 2006 |
| 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 | 81 | 2012 |
| Efficiently decodable error-correcting list disjunct matrices and applications H Ngo, E Porat, A Rudra Automata, Languages and Programming, 557-568, 2011 | 60 | 2011 |
| Testing low-degree polynomials over prime fields CS Jutla, AC Patthak, A Rudra, D Zuckerman Foundations of Computer Science, 2004. Proceedings. 45th Annual IEEE …, 2004 | 59 | 2004 |
| Limits to list decoding Reed-Solomon codes V Guruswami, A Rudra Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005 | 52 | 2005 |
| Using smartphones to collect time–activity data for long-term personal-level air pollution exposure assessment ML Glasgow, CB Rudra, EH Yoo, M Demirbas, J Merriman, P Nayak, ... Journal of exposure science & environmental epidemiology 26 (4), 356-364, 2016 | 50 | 2016 |
| An energy complexity model for algorithms S Roy, A Rudra, A Verma Proceedings of the 4th conference on Innovations in Theoretical Computer …, 2013 | 49 | 2013 |
| Joins via geometric resolutions: Worst case and beyond MA Khamis, HQ Ngo, C Ré, A Rudra ACM Transactions on Database Systems (TODS) 41 (4), 1-45, 2016 | 44 | 2016 |
| imap: Indirect measurement of air pollution with cellphones M Demirbas, C Rudra, A Rudra, MA Bayir 2009 IEEE International Conference on Pervasive Computing and Communications …, 2009 | 44 | 2009 |
| Tolerant locally testable codes V Guruswami, A Rudra Approximation, Randomization and Combinatorial Optimization. Algorithms and …, 2005 | 42 | 2005 |
| Join processing for graph patterns: An old dog with new tricks D Nguyen, M Aref, M Bravenboer, G Kollias, HQ Ngo, C Ré, A Rudra Proceedings of the GRADES'15, 1-8, 2015 | 39 | 2015 |
Hung Q. NgorelationalAIVerified email at relational.ai
