Efficient Rijndael Encryption Implementation with Composite Field Arithmetic. - Atri Rudra; Pradeep K. Dubey; Charanjit S. Jutla; Vijay Kumar; Josyula R. Rao; Pankaj Rohatgi (CHES, 2001)

Coalitional games on graphs: core structure, substitutes and frugality. - Rahul Garg 001; Vijay Kumar; Atri Rudra; Akshat Verma (EC, 2003)

Online learning in online auctions. - Avrim Blum; Vijay Kumar; Atri Rudra; Felix Wu (SODA, 2003)

Efficient galois field arithmetic on SIMD architectures. - Raghav Bhaskar; Pradeep K. Dubey; Vijay Kumar; Atri Rudra (SPAA, 2003)

Testing Low-Degree Polynomials over Prime Fields. - Charanjit S. Jutla; Anindya C. Patthak; Atri Rudra; David Zuckerman (FOCS, 2004)

Tolerant Locally Testable Codes. - Venkatesan Guruswami; Atri Rudra (APPROX-RANDOM, 2005)

Approximation Algorithms for Wavelength Assignment. - Vijay Kumar; Atri Rudra (FSTTCS, 2005)

Limits to list decoding Reed-Solomon codes. - Venkatesan Guruswami; Atri Rudra (STOC, 2005)

Walrasian Equilibrium: Hardness, Approximations and Tractable Instances. - Ning Chen 005; Atri Rudra (WINE, 2005)

On the Robust Testability of Product of Codes - Don Coppersmith; Atri Rudra (Electron. Colloquium Comput. Complex., 2005)

Ordering by weighted number of wins gives a good ranking for weighted tournaments. - Don Coppersmith; Lisa Fleischer; Atri Rudra (SODA, 2006)

Explicit capacity-achieving list-decodable codes. - Venkatesan Guruswami; Atri Rudra (STOC, 2006)

Efficient List Decoding of Explicit Codes with Optimal Redundancy. - Atri Rudra (AAECC, 2007)

Improved Approximation Algorithms for the Spanning Star Forest Problem. - Ning Chen 005; Roee Engelberg; C. Thach Nguyen; Prasad Raghavendra; Atri Rudra; Gyanit Singh (APPROX-RANDOM, 2007)

Better Binary List-Decodable Codes Via Multilevel Concatenation. - Venkatesan Guruswami; Atri Rudra (APPROX-RANDOM, 2007)

Paper Retraction: On the Hardness of Embeddings Between Two Finite Metrics. - Matthew Cary; Atri Rudra; Ashish Sabharwal (ICALP, 2007)

Dynamic pricing for impatient bidders. - Nikhil Bansal 001; Ning Chen 005; Neva Cherniavsky; Atri Rudra; Baruch Schieber; Maxim Sviridenko (SODA, 2007)

Lower bounds for randomized read/write stream algorithms. - Paul Beame; T. S. Jayram; Atri Rudra (STOC, 2007)

Pricing Commodities, or How to Sell When Buyers Have Restricted Valuations. - Robert Krauthgamer; Aranyak Mehta; Atri Rudra (WAOA, 2007)

Soft Decoding, Dual BCH Codes, and Better List-Decodable e-Biased Codes. - Venkatesan Guruswami; Atri Rudra (CCC, 2008)

Greedy List Intersection. - Robert Krauthgamer; Aranyak Mehta; Vijayshankar Raman; Atri Rudra (ICDE, 2008)

Concatenated codes can achieve list-decoding capacity. - Venkatesan Guruswami; Atri Rudra (SODA, 2008)

Soft decoding, dual BCH codes, and better list-decodable eps-biased codes. - Venkatesan Guruswami; Atri Rudra (Electron. Colloquium Comput. Complex., 2008)

Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy. - Venkatesan Guruswami; Atri Rudra (IEEE Trans. Inf. Theory, 2008)

List Decoding near Capacity: Folded RS Codes. - Atri Rudra (Encyclopedia of Algorithms, 2008)

Limits to List Decoding Random Codes. - Atri Rudra (COCOON, 2009)

Approximating Matches Made in Heaven. - Ning Chen 005; Nicole Immorlica; Anna R. Karlin; Mohammad Mahdian; Atri Rudra (ICALP (1), 2009)

iMAP: Indirect Measurement of Air Pollution with Cellphones. - Murat Demirbas; Carole Rudra; Atri Rudra; Murat Ali Bayir (PerCom Workshops, 2009)

Error correction up to the information-theoretic limit. - Venkatesan Guruswami; Atri Rudra (Commun. ACM, 2009)

k + Decision Trees - (Extended Abstract). - James Aspnes; Eric Blais; Murat Demirbas; Ryan O'Donnell; Atri Rudra; Steve Uurtamo (ALGOSENSORS, 2010)

Two Theorems on List Decoding - (Extended Abstract). - Atri Rudra; Steve Uurtamo (APPROX-RANDOM, 2010)

When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings - (Extended Abstract). - Nikhil Bansal 001; Anupam Gupta 001; Jian Li 015; Julián Mestre; Viswanath Nagarajan; Atri Rudra (ESA (2), 2010)

Data Stream Algorithms for Codeword Testing. - Atri Rudra; Steve Uurtamo (ICALP (1), 2010)

Analyzing Nonblocking Switching Networks using Linear Programming (Duality). - Hung Q. Ngo 001; Atri Rudra; Anh N. Le; Thanh-Nhan Nguyen (INFOCOM, 2010)

Efficiently Decodable Non-adaptive Group Testing. - Piotr Indyk; Hung Q. Ngo 001; Atri Rudra (SODA, 2010)

Floodlight illumination of infinite wedges. - Matthew Cary; Atri Rudra; Ashish Sabharwal; Erik Vee (Comput. Geom., 2010)

Two Theorems in List Decoding. - Atri Rudra; Steve Uurtamo (Electron. Colloquium Comput. Complex., 2010)

The existence of concatenated codes list-decodable up to the hamming bound. - Venkatesan Guruswami; Atri Rudra (IEEE Trans. Inf. Theory, 2010)

Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications - (Extended Abstract). - Hung Q. Ngo 001; Ely Porat; Atri Rudra (ICALP (1), 2011)

Singlehop Collaborative Feedback Primitives for Threshold Querying in Wireless Sensor Networks. - Murat Demirbas; Serafettin Tasci; Hanifi Gunes; Atri Rudra (IPDPS, 2011)

Symmetric Functions Capture General Functions. - Richard J. Lipton; Kenneth W. Regan; Atri Rudra (MFCS, 2011)

Polynomial Fitting of Data Streams with Applications to Codeword Testing. - Andrew McGregor 001; Atri Rudra; Steve Uurtamo (STACS, 2011)

An FPTAS for the Lead-Based Multiple Video Transmission LMVT Problem - Atri Rudra; Swapnoneel Roy (CoRR, 2011)

Storage Enforcement with Kolmogorov Complexity and List Decoding. - Mohammad Iftekhar Husain; Steven Y. Ko; Atri Rudra; Steve Uurtamo (Electron. Colloquium Comput. Complex., 2011)

Flexible coloring. - Xiaozhou Li; Atri Rudra; Ram Swaminathan (Inf. Process. Lett., 2011)

Pricing commodities. - Robert Krauthgamer; Aranyak Mehta; Atri Rudra (Theor. Comput. Sci., 2011)

Soft Decoding, Dual BCH Codes, and Better List-Decodable varepsilon-Biased Codes. - Venkatesan Guruswami; Atri Rudra (IEEE Trans. Inf. Theory, 2011)

Recovering simple signals. - Anna C. Gilbert; Brett Hemenway; Atri Rudra; Martin J. Strauss; Mary Wootters (ITA, 2012)

Worst-case optimal join algorithms: [extended abstract]. - Hung Q. Ngo 001; Ely Porat; Christopher Ré; Atri Rudra (PODS, 2012)

PGV: A Storage Enforcing Remote Verification Scheme. - Mohammad Iftekhar Husain; Steve Uurtamo; Steven Y. Ko; Atri Rudra; Ramalingam Sridhar (SRDS, 2012)

Efficiently Decodable Compressed Sensing by List-Recoverable Codes and Recursion. - Hung Q. Ngo 001; Ely Porat; Atri Rudra (STACS, 2012)

When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings. - Nikhil Bansal 001; Anupam Gupta 001; Jian Li 015; Julián Mestre; Viswanath Nagarajan; Atri Rudra (Algorithmica, 2012)

Simulating Special but Natural Quantum Circuits - Richard J. Lipton; Kenneth W. Regan; Atri Rudra (CoRR, 2012)

Almost Universal Hash Families are also Storage Enforcing - Mohammad Iftekhar Husain; Steven Y. Ko; Atri Rudra; Steve Uurtamo (CoRR, 2012)

On the Circuit Complexity of Composite Galois Field Transformations. - Charanjit S. Jutla; Vijay Kumar; Atri Rudra (Electron. Colloquium Comput. Complex., 2012)

ℓ2/ℓ2-Foreach Sparse Recovery with Low Risk. - Anna C. Gilbert; Hung Q. Ngo 001; Ely Porat; Atri Rudra; Martin J. Strauss (ICALP (1), 2013)

Towards fingerprints as strings: Secure indexing for fingerprint matching. - Jesse Hartloff; Jimmy Dobler; Sergey Tulyakov; Atri Rudra; Venu Govindaraju (ICB, 2013)

An energy complexity model for algorithms. - Swapnoneel Roy; Atri Rudra; Akshat Verma (ITCS, 2013)

Accurate Decoding of Pooled Sequenced Data Using Compressed Sensing. - Denisa Duma; Mary Wootters; Anna C. Gilbert; Hung Q. Ngo 001; Atri Rudra; Matthew Alpert; Timothy J. Close; Gianfranco Ciardo; Stefano Lonardi (WABI, 2013)

Towards Instance Optimal Join Algorithms for Data in Indexes - Hung Q. Ngo 001; Dung T. Nguyen; Christopher Ré; Atri Rudra (CoRR, 2013)

Skew strikes back: new developments in the theory of join algorithms. - Hung Q. Ngo 001; Christopher Ré; Atri Rudra (SIGMOD Rec., 2013)

Special Issue: APPROX-RANDOM 2012: Guest Editors' Foreword. - Alexandr Andoni; Atri Rudra (Theory Comput., 2013)

Secure Fingerprint Matching with Generic Local Structures. - Matthew Morse; Jesse Hartloff; Thomas Effland; Jim Schuler; Jennifer Cordaro; Sergey Tulyakov; Atri Rudra; Venu Govindaraju (CVPR Workshops, 2014)

Topology Matters in Communication. - Arkadev Chattopadhyay; Jaikumar Radhakrishnan; Atri Rudra (FOCS, 2014)

Energy Aware Algorithmic Engineering. - Swapnoneel Roy; Atri Rudra; Akshat Verma (MASCOTS, 2014)

Beyond worst-case analysis for joins with minesweeper. - Hung Q. Ngo 001; Dung T. Nguyen; Christopher Ré; Atri Rudra (PODS, 2014)

Every list-decodable code for high noise has abundant near-optimal rate puncturings. - Atri Rudra; Mary Wootters (STOC, 2014)

Sparse Approximation, List Decoding, and Uncertainty Principles. - Mahmoud Abo Khamis; Anna C. Gilbert; Hung Q. Ngo 001; Atri Rudra (CoRR, 2014)

Bidirectional data verification for cloud storage. - Mohammad Iftekhar Husain; Steven Y. Ko; Steve Uurtamo; Atri Rudra; Ramalingam Sridhar (J. Netw. Comput. Appl., 2014)

A multiple server scheme for fingerprint fuzzy vaults. - Jesse Hartloff; Matthew Morse; Bingsheng Zhang; Thomas Effland; Jennifer Cordaro; Jim Schuler; Sergey Tulyakov; Atri Rudra; Venu Govindaraju (CVPR Workshops, 2015)

The Range of Topological Effects on Communication. - Arkadev Chattopadhyay; Atri Rudra (ICALP (2), 2015)

It'll Probably Work Out: Improved List-Decoding Through Random Operations. - Atri Rudra; Mary Wootters (ITCS, 2015)

Joins via Geometric Resolutions: Worst-case and Beyond. - Mahmoud Abo Khamis; Hung Q. Ngo 001; Christopher Ré; Atri Rudra (PODS, 2015)

Join Processing for Graph Patterns: An Old Dog with New Tricks. - Dung T. Nguyen; Molham Aref; Martin Bravenboer; George Kollias; Hung Q. Ngo 001; Christopher Ré; Atri Rudra (GRADES@SIGMOD/PODS, 2015)

FAQ: Questions Asked Frequently. - Mahmoud Abo Khamis; Hung Q. Ngo 001; Atri Rudra (PODS, 2016)

Recurrence Width for Structured Dense Matrix Vector Multiplication. - Albert Gu; Rohan Puttagunta; Christopher Ré; Atri Rudra (CoRR, 2016)

Efficient Decodable Group Testing. - Hung Q. Ngo 001; Atri Rudra (Encyclopedia of Algorithms, 2016)

List Decoding near Capacity: Folded RS Codes. - Atri Rudra (Encyclopedia of Algorithms, 2016)

Tight Network Topology Dependent Bounds on Rounds of Communication. - Arkadev Chattopadhyay; Michael Langberg; Shi Li 001; Atri Rudra (SODA, 2017)

Answering FAQs in CSPs, probabilistic graphical models, databases, logic and matrix operations (invited talk). - Atri Rudra (STOC, 2017)

Implementation of Tetris as a Model Counter. - Jimmy Dobler; Atri Rudra (CoRR, 2017)

Average-radius list-recovery of random linear codes: it really ties the room together. - Atri Rudra; Mary Wootters (CoRR, 2017)

Juggling Functions Inside a Database. - Mahmoud Abo Khamis; Hung Q. Ngo 001; Atri Rudra (SIGMOD Rec., 2017)

Learning Invariance with Compact Transforms. - Anna T. Thomas; Albert Gu; Tri Dao; Atri Rudra; Christopher Ré (ICLR (Workshop), 2018)

Learning Compressed Transforms with Low Displacement Rank. - Anna T. Thomas; Albert Gu; Tri Dao; Atri Rudra; Christopher Ré (NeurIPS, 2018)

Average-radius list-recoverability of random linear codes. - Atri Rudra; Mary Wootters (SODA, 2018)

A Two-pronged Progress in Structured Dense Matrix Vector Multiplication. - Christopher De Sa; Albert Gu; Rohan Puttagunta; Christopher Ré; Atri Rudra (SODA, 2018)

General strong polarization. - Jaroslaw Blasiok; Venkatesan Guruswami; Preetum Nakkiran; Atri Rudra; Madhu Sudan 001 (STOC, 2018)

Hypertree Decompositions Revisited for PGMs. - Aarthy Shivram Arun; Sai Vikneshwar Mani Jayaraman; Christopher Ré; Atri Rudra (CoRR, 2018)

Worst-case Optimal Join Algorithms. - Hung Q. Ngo 001; Ely Porat; Christopher Ré; Atri Rudra (J. ACM, 2018)

Learning Fast Algorithms for Linear Transforms Using Butterfly Factorizations. - Tri Dao; Albert Gu; Matthew Eichhorn; Atri Rudra; Christopher Ré (ICML, 2019)

Topology Dependent Bounds For FAQs. - Michael Langberg; Shi Li 001; Sai Vikneshwar Mani Jayaraman; Atri Rudra (PODS, 2019)

Sparse Recovery for Orthogonal Polynomial Transforms. - Anna C. Gilbert; Albert Gu; Christopher Ré; Atri Rudra; Mary Wootters (ICALP, 2020)

Kaleidoscope: An Efficient, Learnable Representation For All Structured Linear Maps. - Tri Dao; Nimit Sharad Sohoni; Albert Gu; Matthew Eichhorn; Amit Blonder; Megan Leszczynski; Atri Rudra; Christopher Ré (ICLR, 2020)

HiPPO: Recurrent Memory with Optimal Polynomial Projections. - Albert Gu; Tri Dao; Stefano Ermon; Atri Rudra; Christopher Ré (NeurIPS, 2020)

Covering the Relational Join. - Shi Li 001; Sai Vikneshwar Mani Jayaraman; Atri Rudra (CoRR, 2020)

Scatterbrain: Unifying Sparse and Low-rank Attention. - Beidi Chen; Tri Dao; Eric Winsor; Zhao Song 002; Atri Rudra; Christopher Ré (NeurIPS, 2021)

Combining Recurrent, Convolutional, and Continuous-time Models with Linear State Space Layers. - Albert Gu; Isys Johnson; Karan Goel; Khaled Saab 002; Tri Dao; Atri Rudra; Christopher Ré (NeurIPS, 2021)

Scatterbrain: Unifying Sparse and Low-rank Attention Approximation. - Beidi Chen; Tri Dao; Eric Winsor; Zhao Song 002; Atri Rudra; Christopher Ré (CoRR, 2021)

Worst-case Optimal Binary Join Algorithms under General 𝓁p Constraints. - Sai Vikneshwar Mani Jayaraman; Corey Ropell; Atri Rudra (CoRR, 2021)

Pixelated Butterfly: Simple and Efficient Sparse training for Neural Network Models. - Beidi Chen; Tri Dao; Kaizhao Liang; Jiaming Yang; Zhao Song 002; Atri Rudra; Christopher Ré (ICLR, 2022)

Monarch: Expressive Structured Matrices for Efficient and Accurate Training. - Tri Dao; Beidi Chen; Nimit Sharad Sohoni; Arjun D. Desai; Michael Poli; Jessica Grogan; Alexander Liu; Aniruddh Rao; Atri Rudra; Christopher Ré (ICML, 2022)

FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awareness. - Tri Dao; Daniel Y. Fu; Stefano Ermon; Atri Rudra; Christopher Ré (NeurIPS, 2022)

A qualitative, network-centric method for modeling socio-technical systems, with applications to evaluating interventions on social media platforms to increase social equality. - Kenneth Joseph; Huei-Yen Winnie Chen; Stefania Ionescu; Yuhao Du; Pranav Sankhe; Aniko Hannak; Atri Rudra (Appl. Netw. Sci., 2022)

Computing expected multiplicities for bag-TIDBs with bounded multiplicities. - Su Feng; Boris Glavic; Aaron Huber; Oliver Kennedy; Atri Rudra (CoRR, 2022)

Hungry Hungry Hippos: Towards Language Modeling with State Space Models. - Daniel Y. Fu; Tri Dao; Khaled Kamal Saab; Armin W. Thomas; Atri Rudra; Christopher Ré (ICLR, 2023)

How to Train your HIPPO: State Space Models with Generalized Orthogonal Basis Projections. - Albert Gu; Isys Johnson; Aman Timalsina; Atri Rudra; Christopher Ré (ICLR, 2023)

Simple Hardware-Efficient Long Convolutions for Sequence Modeling. - Daniel Y. Fu; Elliot L. Epstein; Eric Nguyen; Armin W. Thomas; Michael Zhang; Tri Dao; Atri Rudra; Christopher Ré (ICML, 2023)

Monarch Mixer: A Simple Sub-Quadratic GEMM-Based Architecture. - Daniel Y. Fu; Simran Arora; Jessica Grogan; Isys Johnson; Evan Sabri Eyuboglu; Armin W. Thomas; Benjamin Spector; Michael Poli; Atri Rudra; Christopher Ré (NeurIPS, 2023)

Laughing Hyena Distillery: Extracting Compact Recurrences From Convolutions. - Stefano Massaroli; Michael Poli; Daniel Y. Fu; Hermann Kumbong; Rom N. Parnichkun; David W. Romero; Aman Timalsina; Quinn McIntyre; Beidi Chen; Atri Rudra; Ce Zhang 001; Christopher Ré; et al. (NeurIPS, 2023)

Teaching Responsible Computing in Context: Models, Practices, and Tools. - Stacy A. Doore; Atri Rudra; Omowumi Ogunyemi; Trystan S. Goetze; Mehran Sahami; Thomas J. Cortina; Kiran Bhardwaj; Crystal Lee (SIGCSE (2), 2023)

Technical Perspective: (Pre-) Semirings Come to the Recursion Party. - Atri Rudra (SIGMOD Rec., 2023)

Foreword: a Commemorative Issue for Alan L. Selman. - Elvira Mayordomo; Mitsunori Ogihara; Atri Rudra (Theory Comput. Syst., 2023)

Arithmetic Circuits, Structured Matrices and (not so) Deep Learning. - Atri Rudra (Theory Comput. Syst., 2023)

Zoology: Measuring and Improving Recall in Efficient Language Models. - Simran Arora; Sabri Eyuboglu; Aman Timalsina; Isys Johnson; Michael Poli; James Zou 001; Atri Rudra; Christopher Ré (ICLR, 2024)

Simple linear attention language models balance the recall-throughput tradeoff. - Simran Arora; Sabri Eyuboglu; Michael Zhang; Aman Timalsina; Silas Alberti; James Zou 001; Atri Rudra; Christopher Ré (ICML, 2024)

Simple linear attention language models balance the recall-throughput tradeoff. - Simran Arora; Sabri Eyuboglu; Michael Zhang; Aman Timalsina; Silas Alberti; Dylan Zinsley; James Zou 001; Atri Rudra; Christopher Ré (CoRR, 2024)

Just read twice: closing the recall gap for recurrent language models. - Simran Arora; Aman Timalsina; Aaryan Singhal; Benjamin Spector; Sabri Eyuboglu; Xinyi Zhao; Ashish Rao; Atri Rudra; Christopher Ré (CoRR, 2024)

Towards Learning High-Precision Least Squares Algorithms with Sequence Models. - Jerry Weihong Liu; Jessica Grogan; Owen M. Dugan; Ashish Rao; Simran Arora; Atri Rudra; Christopher Ré (ICLR, 2025)

Multiple Approaches for Teaching Responsible Computing. - Stacy A. Doore; Michelle Trim; Joycelyn L. Streator; Richard L. Blumenthal; Atri Rudra; Robert B. Schnabel (CoRR, 2025)

FastPDB: Towards Bag-Probabilistic Queries at Interactive Speeds. - Aaron Huber; Oliver Kennedy; Atri Rudra; Zhuoyue Zhao 001; Su Feng; Boris Glavic (Proc. ACM Manag. Data, 2025)

Towards Learning High-Precision Least Squares Algorithms with Sequence Models. - Jerry Liu; Jessica Grogan; Owen Dugan; Ashish Rao; Simran Arora; Atri Rudra; Christopher Ré (CoRR, 2025)

Cartridges: Lightweight and general-purpose long context representations via self-study. - Sabri Eyuboglu; Ryan Ehrlich; Simran Arora; Neel Guha; Dylan Zinsley; Emily Liu; Will Tennien; Atri Rudra; James Zou 001; Azalia Mirhoseini; Christopher Ré (CoRR, 2025)

BWLer: Barycentric Weight Layer Elucidates a Precision-Conditioning Tradeoff for PINNs. - Jerry Liu; Yasa Baig; Denise Hui Jean Lee; Rajat Vadiraj Dwaraknath; Atri Rudra; Christopher Ré (CoRR, 2025)