default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAtri Rudra
Person information
- affiliation: University at Buffalo, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c78]Simran Arora, Sabri Eyuboglu, Aman Timalsina, Isys Johnson, Michael Poli, James Zou, Atri Rudra, Christopher Ré:
Zoology: Measuring and Improving Recall in Efficient Language Models. ICLR 2024- [c77]Simran Arora, Sabri Eyuboglu, Michael Zhang, Aman Timalsina, Silas Alberti, James Zou, Atri Rudra, Christopher Ré:
Simple linear attention language models balance the recall-throughput tradeoff. ICML 2024 - [i67]Simran Arora, Sabri Eyuboglu, Michael Zhang, Aman Timalsina, Silas Alberti, Dylan Zinsley, James Zou, Atri Rudra, Christopher Ré:
Simple linear attention language models balance the recall-throughput tradeoff. CoRR abs/2402.18668 (2024) - [i66]Simran Arora, Aman Timalsina, Aaryan Singhal, Benjamin Spector, Sabri Eyuboglu, Xinyi Zhao, Ashish Rao, Atri Rudra, Christopher Ré:
Just read twice: closing the recall gap for recurrent language models. CoRR abs/2407.05483 (2024) - 2023
- [j28]Elvira Mayordomo, Mitsunori Ogihara
, Atri Rudra:
Foreword: a Commemorative Issue for Alan L. Selman. Theory Comput. Syst. 67(3): 415-416 (2023) - [j27]Atri Rudra:
Arithmetic Circuits, Structured Matrices and (not so) Deep Learning. Theory Comput. Syst. 67(3): 592-626 (2023) - [j26]Atri Rudra:
Technical Perspective: (Pre-) Semirings Come to the Recursion Party. SIGMOD Rec. 52(1): 74 (2023) - [c76]Daniel Y. Fu, Tri Dao, Khaled Kamal Saab, Armin W. Thomas, Atri Rudra, Christopher Ré:
Hungry Hungry Hippos: Towards Language Modeling with State Space Models. ICLR 2023 - [c75]Albert Gu, Isys Johnson, Aman Timalsina, Atri Rudra, Christopher Ré:
How to Train your HIPPO: State Space Models with Generalized Orthogonal Basis Projections. ICLR 2023 - [c74]Daniel Y. Fu, Elliot L. Epstein, Eric Nguyen, Armin W. Thomas, Michael Zhang, Tri Dao, Atri Rudra, Christopher Ré:
Simple Hardware-Efficient Long Convolutions for Sequence Modeling. ICML 2023: 10373-10391 - [c73]Daniel Y. Fu, Simran Arora, Jessica Grogan, Isys Johnson, Evan Sabri Eyuboglu, Armin W. Thomas, Benjamin Spector, Michael Poli, Atri Rudra, Christopher Ré:
Monarch Mixer: A Simple Sub-Quadratic GEMM-Based Architecture. NeurIPS 2023 - [c72]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, Christopher Ré, Stefano Ermon, Yoshua Bengio:
Laughing Hyena Distillery: Extracting Compact Recurrences From Convolutions. NeurIPS 2023 - [c71]Stacy A. Doore, Atri Rudra, Omowumi Ogunyemi, Trystan S. Goetze, Mehran Sahami, Thomas J. Cortina, Kiran Bhardwaj, Crystal Lee:
Teaching Responsible Computing in Context: Models, Practices, and Tools. SIGCSE (2) 2023: 1185 - [i65]Daniel Y. Fu, Elliot L. Epstein, Eric Nguyen, Armin W. Thomas, Michael Zhang, Tri Dao, Atri Rudra, Christopher Ré:
Simple Hardware-Efficient Long Convolutions for Sequence Modeling. CoRR abs/2302.06646 (2023) - [i64]Daniel Y. Fu, Simran Arora, Jessica Grogan, Isys Johnson, Sabri Eyuboglu, Armin W. Thomas, Benjamin Spector, Michael Poli, Atri Rudra, Christopher Ré:
Monarch Mixer: A Simple Sub-Quadratic GEMM-Based Architecture. CoRR abs/2310.12109 (2023) - [i63]Stefano Massaroli, Michael Poli, Daniel Y. Fu, Hermann Kumbong, Rom N. Parnichkun, Aman Timalsina, David W. Romero, Quinn McIntyre, Beidi Chen, Atri Rudra, Ce Zhang, Christopher Ré, Stefano Ermon, Yoshua Bengio:
Laughing Hyena Distillery: Extracting Compact Recurrences From Convolutions. CoRR abs/2310.18780 (2023) - [i62]Simran Arora, Sabri Eyuboglu, Aman Timalsina, Isys Johnson, Michael Poli, James Zou, Atri Rudra, Christopher Ré:
Zoology: Measuring and Improving Recall in Efficient Language Models. CoRR abs/2312.04927 (2023) - 2022
- [j25]Kenneth Joseph, Huei-Yen Winnie Chen, Stefania Ionescu, Yuhao Du, Pranav Sankhe, Aniko Hannak, Atri Rudra:
A qualitative, network-centric method for modeling socio-technical systems, with applications to evaluating interventions on social media platforms to increase social equality. Appl. Netw. Sci. 7(1): 49 (2022) - [j24]Jaroslaw Blasiok, Venkatesan Guruswami, Preetum Nakkiran, Atri Rudra, Madhu Sudan:
General Strong Polarization. J. ACM 69(2): 11:1-11:67 (2022) - [c70]Beidi Chen, Tri Dao, Kaizhao Liang, Jiaming Yang, Zhao Song, Atri Rudra, Christopher Ré:
Pixelated Butterfly: Simple and Efficient Sparse training for Neural Network Models. ICLR 2022 - [c69]Tri Dao, Beidi Chen, Nimit Sharad Sohoni, Arjun D. Desai, Michael Poli, Jessica Grogan, Alexander Liu, Aniruddh Rao, Atri Rudra, Christopher Ré:
Monarch: Expressive Structured Matrices for Efficient and Accurate Training. ICML 2022: 4690-4721 - [c68]Tri Dao, Daniel Y. Fu, Stefano Ermon, Atri Rudra, Christopher Ré:
FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awareness. NeurIPS 2022 - [i61]Tri Dao, Beidi Chen, Nimit Sharad Sohoni, Arjun D. Desai, Michael Poli, Jessica Grogan, Alexander Liu, Aniruddh Rao, Atri Rudra, Christopher Ré:
Monarch: Expressive Structured Matrices for Efficient and Accurate Training. CoRR abs/2204.00595 (2022) - [i60]Su Feng, Boris Glavic, Aaron Huber, Oliver Kennedy, Atri Rudra:
Computing expected multiplicities for bag-TIDBs with bounded multiplicities. CoRR abs/2204.02758 (2022) - [i59]Tri Dao, Daniel Y. Fu, Stefano Ermon, Atri Rudra, Christopher Ré:
FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awareness. CoRR abs/2205.14135 (2022) - [i58]Albert Gu, Isys Johnson, Aman Timalsina, Atri Rudra, Christopher Ré:
How to Train Your HiPPO: State Space Models with Generalized Orthogonal Basis Projections. CoRR abs/2206.12037 (2022) - [i57]Atri Rudra:
Arithmetic Circuits, Structured Matrices and (not so) Deep Learning. CoRR abs/2206.12490 (2022) - [i56]Tri Dao, Daniel Y. Fu, Khaled Kamal Saab, Armin W. Thomas, Atri Rudra, Christopher Ré:
Hungry Hungry Hippos: Towards Language Modeling with State Space Models. CoRR abs/2212.14052 (2022) - 2021
- [c67]Albert Gu, Isys Johnson, Karan Goel, Khaled Saab, Tri Dao, Atri Rudra, Christopher Ré:
Combining Recurrent, Convolutional, and Continuous-time Models with Linear State Space Layers. NeurIPS 2021: 572-585 - [c66]Beidi Chen, Tri Dao, Eric Winsor, Zhao Song, Atri Rudra, Christopher Ré:
Scatterbrain: Unifying Sparse and Low-rank Attention. NeurIPS 2021: 17413-17426 - [i55]Albert Gu, Isys Johnson, Karan Goel, Khaled Saab, Tri Dao, Atri Rudra, Christopher Ré:
Combining Recurrent, Convolutional, and Continuous-time Models with Linear State-Space Layers. CoRR abs/2110.13985 (2021) - [i54]Beidi Chen, Tri Dao, Eric Winsor, Zhao Song, Atri Rudra, Christopher Ré:
Scatterbrain: Unifying Sparse and Low-rank Attention Approximation. CoRR abs/2110.15343 (2021) - [i53]Beidi Chen, Tri Dao, Kaizhao Liang, Jiaming Yang, Zhao Song, Atri Rudra, Christopher Ré:
Pixelated Butterfly: Simple and Efficient Sparse training for Neural Network Models. CoRR abs/2112.00029 (2021) - [i52]Sai Vikneshwar Mani Jayaraman, Corey Ropell, Atri Rudra:
Worst-case Optimal Binary Join Algorithms under General 𝓁p Constraints. CoRR abs/2112.01003 (2021) - 2020
- [c65]Anna C. Gilbert, Albert Gu, Christopher Ré, Atri Rudra, Mary Wootters:
Sparse Recovery for Orthogonal Polynomial Transforms. ICALP 2020: 58:1-58:16 - [c64]Tri Dao, Nimit Sharad Sohoni, Albert Gu, Matthew Eichhorn, Amit Blonder, Megan Leszczynski, Atri Rudra, Christopher Ré:
Kaleidoscope: An Efficient, Learnable Representation For All Structured Linear Maps. ICLR 2020 - [c63]Albert Gu, Tri Dao, Stefano Ermon, Atri Rudra, Christopher Ré:
HiPPO: Recurrent Memory with Optimal Polynomial Projections. NeurIPS 2020 - [i51]Michael Langberg, Shi Li, Sai Vikneshwar Mani Jayaraman, Atri Rudra:
Topology Dependent Bounds For FAQs. CoRR abs/2003.05575 (2020) - [i50]Shi Li, Sai Vikneshwar Mani Jayaraman, Atri Rudra:
Covering the Relational Join. CoRR abs/2003.09537 (2020) - [i49]Albert Gu, Tri Dao, Stefano Ermon, Atri Rudra, Christopher Ré:
HiPPO: Recurrent Memory with Optimal Polynomial Projections. CoRR abs/2008.07669 (2020) - [i48]Tri Dao, Nimit Sharad Sohoni, Albert Gu, Matthew Eichhorn, Amit Blonder, Megan Leszczynski, Atri Rudra, Christopher Ré:
Kaleidoscope: An Efficient, Learnable Representation For All Structured Linear Maps. CoRR abs/2012.14966 (2020)
2010 – 2019
- 2019
- [c62]Tri Dao, Albert Gu, Matthew Eichhorn, Atri Rudra, Christopher Ré:
Learning Fast Algorithms for Linear Transforms Using Butterfly Factorizations. ICML 2019: 1517-1527 - [c61]Michael Langberg, Shi Li, Sai Vikneshwar Mani Jayaraman, Atri Rudra:
Topology Dependent Bounds For FAQs. PODS 2019: 432-449 - [i47]Tri Dao, Albert Gu, Matthew Eichhorn, Atri Rudra, Christopher Ré:
Learning Fast Algorithms for Linear Transforms Using Butterfly Factorizations. CoRR abs/1903.05895 (2019) - [i46]Anna C. Gilbert, Albert Gu, Christopher Ré, Atri Rudra, Mary Wootters:
Sparse Recovery for Orthogonal Polynomial Transforms. CoRR abs/1907.08362 (2019) - 2018
- [j23]Hung Q. Ngo, Ely Porat, Christopher Ré, Atri Rudra:
Worst-case Optimal Join Algorithms. J. ACM 65(3): 16:1-16:40 (2018) - [c60]Anna T. Thomas, Albert Gu, Tri Dao, Atri Rudra, Christopher Ré:
Learning Invariance with Compact Transforms. ICLR (Workshop) 2018 - [c59]Anna T. Thomas, Albert Gu, Tri Dao, Atri Rudra, Christopher Ré:
Learning Compressed Transforms with Low Displacement Rank. NeurIPS 2018: 9066-9078 - [c58]Atri Rudra, Mary Wootters:
Average-radius list-recoverability of random linear codes. SODA 2018: 644-662 - [c57]Christopher De Sa, Albert Gu, Rohan Puttagunta, Christopher Ré, Atri Rudra:
A Two-pronged Progress in Structured Dense Matrix Vector Multiplication. SODA 2018: 1060-1079 - [c56]Jaroslaw Blasiok, Venkatesan Guruswami, Preetum Nakkiran, Atri Rudra, Madhu Sudan:
General strong polarization. STOC 2018: 485-492 - [i45]Jaroslaw Blasiok, Venkatesan Guruswami, Preetum Nakkiran, Atri Rudra, Madhu Sudan:
General Strong Polarization. CoRR abs/1802.02718 (2018) - [i44]Aarthy Shivram Arun, Sai Vikneshwar Mani Jayaraman, Christopher Ré, Atri Rudra:
Hypertree Decompositions Revisited for PGMs. CoRR abs/1804.01640 (2018) - [i43]Aarthy Shivram Arun, Sai Vikneshwar Mani Jayaraman, Christopher Ré, Atri Rudra:
Hypertree Decompositions Revisited for PGMs. CoRR abs/1807.00886 (2018) - [i42]Anna T. Thomas, Albert Gu, Tri Dao, Atri Rudra, Christopher Ré:
Learning Compressed Transforms with Low Displacement Rank. CoRR abs/1810.02309 (2018) - [i41]Jaroslaw Blasiok, Venkatesan Guruswami, Preetum Nakkiran, Atri Rudra, Madhu Sudan:
General Strong Polarization. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j22]Mahmoud Abo Khamis, Hung Q. Ngo, Atri Rudra:
Juggling Functions Inside a Database. SIGMOD Rec. 46(1): 6-13 (2017) - [c55]Arkadev Chattopadhyay, Michael Langberg, Shi Li, Atri Rudra:
Tight Network Topology Dependent Bounds on Rounds of Communication. SODA 2017: 2524-2539 - [c54]Atri Rudra:
Answering FAQs in CSPs, probabilistic graphical models, databases, logic and matrix operations (invited talk). STOC 2017: 4 - [i40]Jimmy Dobler, Atri Rudra:
Implementation of Tetris as a Model Counter. CoRR abs/1701.07473 (2017) - [i39]Mahmoud Abo Khamis, Hung Q. Ngo, Atri Rudra:
Juggling Functions Inside a Database. CoRR abs/1703.03147 (2017) - [i38]Atri Rudra, Mary Wootters:
Average-radius list-recovery of random linear codes: it really ties the room together. CoRR abs/1704.02420 (2017) - 2016
- [j21]Mahmoud Abo Khamis, Hung Q. Ngo, Christopher Ré, Atri Rudra:
Joins via Geometric Resolutions: Worst Case and Beyond. ACM Trans. Database Syst. 41(4): 22:1-22:45 (2016) - [c53]Mahmoud Abo Khamis, Hung Q. Ngo, Atri Rudra:
FAQ: Questions Asked Frequently. PODS 2016: 13-28 - [r3]Hung Q. Ngo, Atri Rudra:
Efficient Decodable Group Testing. Encyclopedia of Algorithms 2016: 614-618 - [r2]Atri Rudra:
List Decoding near Capacity: Folded RS Codes. Encyclopedia of Algorithms 2016: 1114-1117 - [i37]Arkadev Chattopadhyay, Michael Langberg, Shi Li, Atri Rudra:
Tight Network Topology Dependent Bounds on Rounds of Communication. CoRR abs/1608.03313 (2016) - [i36]Albert Gu, Rohan Puttagunta, Christopher Ré, Atri Rudra:
Recurrence Width for Structured Dense Matrix Vector Multiplication. CoRR abs/1611.01569 (2016) - [i35]Arkadev Chattopadhyay, Michael Langberg, Shi Li, Atri Rudra:
Tight Network Topology Dependent Bounds on Rounds of Communication. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c52]Jesse Hartloff, Matthew Morse, Bingsheng Zhang, Thomas Effland, Jennifer Cordaro, Jim Schuler, Sergey Tulyakov, Atri Rudra, Venu Govindaraju:
A multiple server scheme for fingerprint fuzzy vaults. CVPR Workshops 2015: 119-127 - [c51]Arkadev Chattopadhyay, Atri Rudra:
The Range of Topological Effects on Communication. ICALP (2) 2015: 540-551 - [c50]Atri Rudra, Mary Wootters:
It'll Probably Work Out: Improved List-Decoding Through Random Operations. ITCS 2015: 287-296 - [c49]Mahmoud Abo Khamis, Hung Q. Ngo, Christopher Ré, Atri Rudra:
Joins via Geometric Resolutions: Worst-case and Beyond. PODS 2015: 213-228 - [c48]Dung T. Nguyen, Molham Aref, Martin Bravenboer, George Kollias, Hung Q. Ngo, Christopher Ré, Atri Rudra:
Join Processing for Graph Patterns: An Old Dog with New Tricks. GRADES@SIGMOD/PODS 2015: 2:1-2:8 - [i34]Dung T. Nguyen, Molham Aref, Martin Bravenboer, George Kollias, Hung Q. Ngo, Christopher Ré, Atri Rudra:
Join Processing for Graph Patterns: An Old Dog with New Tricks. CoRR abs/1503.04169 (2015) - [i33]Mahmoud Abo Khamis, Hung Q. Ngo, Atri Rudra:
FAQ: Questions Asked Frequently. CoRR abs/1504.04044 (2015) - [i32]Arkadev Chattopadhyay, Atri Rudra:
The Range of Topological Effects on Communication. CoRR abs/1504.06602 (2015) - 2014
- [j20]Mohammad Iftekhar Husain, Steven Y. Ko, Steve Uurtamo, Atri Rudra, Ramalingam Sridhar:
Bidirectional data verification for cloud storage. J. Netw. Comput. Appl. 45: 96-107 (2014) - [c47]Matthew Morse, Jesse Hartloff, Thomas Effland, Jim Schuler, Jennifer Cordaro, Sergey Tulyakov, Atri Rudra, Venu Govindaraju:
Secure Fingerprint Matching with Generic Local Structures. CVPR Workshops 2014: 84-89 - [c46]Arkadev Chattopadhyay, Jaikumar Radhakrishnan, Atri Rudra:
Topology Matters in Communication. FOCS 2014: 631-640 - [c45]Swapnoneel Roy, Atri Rudra, Akshat Verma:
Energy Aware Algorithmic Engineering. MASCOTS 2014: 321-330 - [c44]Hung Q. Ngo, Dung T. Nguyen, Christopher Ré, Atri Rudra:
Beyond worst-case analysis for joins with minesweeper. PODS 2014: 234-245 - [c43]Atri Rudra, Mary Wootters:
Every list-decodable code for high noise has abundant near-optimal rate puncturings. STOC 2014: 764-773 - [i31]Mahmoud Abo Khamis, Hung Q. Ngo, Christopher Ré, Atri Rudra:
Joins via Geometric Resolutions: Worst-case and Beyond. CoRR abs/1404.0703 (2014) - [i30]Mahmoud Abo Khamis, Anna C. Gilbert, Hung Q. Ngo, Atri Rudra:
Sparse Approximation, List Decoding, and Uncertainty Principles. CoRR abs/1404.5190 (2014) - [i29]Atri Rudra, Mary Wootters:
It'll probably work out: improved list-decoding through random operations. CoRR abs/1408.2237 (2014) - [i28]Arkadev Chattopadhyay, Jaikumar Radhakrishnan, Atri Rudra:
Topology matters in communication. Electron. Colloquium Comput. Complex. TR14 (2014) - [i27]Atri Rudra, Mary Wootters:
It'll probably work out: improved list-decoding through random operations. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j19]Ning Chen, Roee Engelberg, C. Thach Nguyen, Prasad Raghavendra, Atri Rudra, Gyanit Singh:
Improved Approximation Algorithms for the Spanning Star Forest Problem. Algorithmica 65(3): 498-516 (2013) - [j18]Hung Q. Ngo, Christopher Ré, Atri Rudra:
Skew strikes back: new developments in the theory of join algorithms. SIGMOD Rec. 42(4): 5-16 (2013) - [j17]Alexandr Andoni, Atri Rudra:
Special Issue: APPROX-RANDOM 2012: Guest Editors' Foreword. Theory Comput. 9: 437-439 (2013) - [c42]Anna C. Gilbert, Hung Q. Ngo, Ely Porat, Atri Rudra, Martin J. Strauss:
ℓ2/ℓ2-Foreach Sparse Recovery with Low Risk. ICALP (1) 2013: 461-472 - [c41]Jesse Hartloff, Jimmy Dobler, Sergey Tulyakov, Atri Rudra, Venu Govindaraju:
Towards fingerprints as strings: Secure indexing for fingerprint matching. ICB 2013: 1-6 - [c40]Swapnoneel Roy, Atri Rudra, Akshat Verma:
An energy complexity model for algorithms. ITCS 2013: 283-304 - [c39]Denisa Duma, Mary Wootters, Anna C. Gilbert, Hung Q. Ngo, Atri Rudra, Matthew Alpert, Timothy J. Close, Gianfranco Ciardo, Stefano Lonardi:
Accurate Decoding of Pooled Sequenced Data Using Compressed Sensing. WABI 2013: 70-84 - [i26]Hung Q. Ngo, Dung T. Nguyen, Christopher Ré, Atri Rudra:
Towards Instance Optimal Join Algorithms for Data in Indexes. CoRR abs/1302.0914 (2013) - [i25]Anna C. Gilbert, Hung Q. Ngo, Ely Porat, Atri Rudra, Martin J. Strauss:
L2/L2-foreach sparse recovery with low risk. CoRR abs/1304.6232 (2013) - [i24]Atri Rudra, Mary Wootters:
Every list-decodable code for high noise has abundant near-optimal rate puncturings. CoRR abs/1310.1891 (2013) - [i23]Hung Q. Ngo, Christopher Ré, Atri Rudra:
Skew Strikes Back: New Developments in the Theory of Join Algorithms. CoRR abs/1310.3314 (2013) - [i22]Atri Rudra, Mary Wootters:
Every list-decodable code for high noise has abundant near-optimal rate puncturings. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j16]Nikhil Bansal, Anupam Gupta, Jian Li, Julián Mestre, Viswanath Nagarajan, Atri Rudra:
When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings. Algorithmica 63(4): 733-762 (2012) - [c38]Anna C. Gilbert, Brett Hemenway, Atri Rudra, Martin J. Strauss, Mary Wootters:
Recovering simple signals. ITA 2012: 382-391 - [c37]Hung Q. Ngo, Ely Porat, Christopher Ré, Atri Rudra:
Worst-case optimal join algorithms: [extended abstract]. PODS 2012: 37-48 - [c36]Mohammad Iftekhar Husain, Steve Uurtamo, Steven Y. Ko, Atri Rudra, Ramalingam Sridhar:
PGV: A Storage Enforcing Remote Verification Scheme. SRDS 2012: 390-395 - [c35]Hung Q. Ngo, Ely Porat, Atri Rudra:
Efficiently Decodable Compressed Sensing by List-Recoverable Codes and Recursion. STACS 2012: 230-241 - [i21]Richard J. Lipton, Kenneth W. Regan, Atri Rudra:
Simulating Special but Natural Quantum Circuits. CoRR abs/1201.3306 (2012) - [i20]Hung Q. Ngo, Ely Porat, Christopher Ré, Atri Rudra:
Worst-case Optimal Join Algorithms. CoRR abs/1203.1952 (2012) - [i19]Hung Q. Ngo, Atri Rudra, Anh N. Le, Thanh-Nhan Nguyen:
Analyzing Nonblocking Switching Networks using Linear Programming (Duality). CoRR abs/1204.3180 (2012) - [i18]Mohammad Iftekhar Husain, Steven Y. Ko, Atri Rudra, Steve Uurtamo:
Almost Universal Hash Families are also Storage Enforcing. CoRR abs/1205.1462 (2012) - [i17]Charanjit S. Jutla, Vijay Kumar, Atri Rudra:
On the Circuit Complexity of Composite Galois Field Transformations. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j15]Xiaozhou Li, Atri Rudra, Ram Swaminathan:
Flexible coloring. Inf. Process. Lett. 111(11): 538-540 (2011) - [j14]Robert Krauthgamer, Aranyak Mehta, Atri Rudra:
Pricing commodities. Theor. Comput. Sci. 412(7): 602-613 (2011) - [j13]Venkatesan Guruswami, Atri Rudra:
Soft Decoding, Dual BCH Codes, and Better List-Decodable varepsilon-Biased Codes. IEEE Trans. Inf. Theory 57(2): 705-717 (2011) - [j12]Atri Rudra:
Limits to List Decoding of Random Codes. IEEE Trans. Inf. Theory 57(3): 1398-1408 (2011) - [c34]Hung Q. Ngo, Ely Porat, Atri Rudra:
Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications - (Extended Abstract). ICALP (1) 2011: 557-568 - [c33]Murat Demirbas, Serafettin Tasci, Hanifi Gunes, Atri Rudra:
Singlehop Collaborative Feedback Primitives for Threshold Querying in Wireless Sensor Networks. IPDPS 2011: 322-333 - [c32]Richard J. Lipton, Kenneth W. Regan, Atri Rudra:
Symmetric Functions Capture General Functions. MFCS 2011: 436-447 - [c31]Andrew McGregor, Atri Rudra, Steve Uurtamo:
Polynomial Fitting of Data Streams with Applications to Codeword Testing. STACS 2011: 428-439 - [i16]Atri Rudra, Swapnoneel Roy:
An FPTAS for the Lead-Based Multiple Video Transmission LMVT Problem. CoRR abs/1102.4129 (2011) - [i15]Mohammad Iftekhar Husain, Steven Y. Ko, Atri Rudra, Steve Uurtamo:
Storage Enforcement with Kolmogorov Complexity and List Decoding. CoRR abs/1104.3025 (2011) - [i14]Mohammad Iftekhar Husain, Steven Y. Ko, Atri Rudra, Steve Uurtamo:
Storage Enforcement with Kolmogorov Complexity and List Decoding. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [j11]Matthew Cary, Atri Rudra, Ashish Sabharwal, Erik Vee:
Floodlight illumination of infinite wedges. Comput. Geom. 43(1): 23-34 (2010) - [j10]Nikhil Bansal, Ning Chen, Neva Cherniavsky, Atri Rudra, Baruch Schieber, Maxim Sviridenko:
Dynamic pricing for impatient bidders. ACM Trans. Algorithms 6(2): 35:1-35:21 (2010) - [j9]Don Coppersmith, Lisa Fleischer, Atri Rudra:
Ordering by weighted number of wins gives a good ranking for weighted tournaments. ACM Trans. Algorithms 6(3): 55:1-55:13 (2010) - [j8]Venkatesan Guruswami, Atri Rudra:
The existence of concatenated codes list-decodable up to the hamming bound. IEEE Trans. Inf. Theory 56(10): 5195-5206 (2010) - [c30]James Aspnes, Eric Blais, Murat Demirbas, Ryan O'Donnell, Atri Rudra, Steve Uurtamo:
k + Decision Trees - (Extended Abstract). ALGOSENSORS 2010: 74-88 - [c29]Atri Rudra, Steve Uurtamo:
Two Theorems on List Decoding - (Extended Abstract). APPROX-RANDOM 2010: 696-709 - [c28]Nikhil Bansal, Anupam Gupta, Jian Li, Julián Mestre, Viswanath Nagarajan, Atri Rudra:
When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings - (Extended Abstract). ESA (2) 2010: 218-229 - [c27]Atri Rudra, Steve Uurtamo:
Data Stream Algorithms for Codeword Testing. ICALP (1) 2010: 629-640 - [c26]Hung Q. Ngo, Atri Rudra, Anh N. Le, Thanh-Nhan Nguyen:
Analyzing Nonblocking Switching Networks using Linear Programming (Duality). INFOCOM 2010: 2696-2704 - [c25]Piotr Indyk, Hung Q. Ngo, Atri Rudra:
Efficiently Decodable Non-adaptive Group Testing. SODA 2010: 1126-1142 - [i13]Atri Rudra, Steve Uurtamo:
Two Theorems in List Decoding. CoRR abs/1001.1781 (2010) - [i12]Atri Rudra, Steve Uurtamo:
Data Stream Algorithms for Codeword Testing. CoRR abs/1004.4601 (2010) - [i11]Nikhil Bansal, Anupam Gupta, Jian Li, Julián Mestre, Viswanath Nagarajan, Atri Rudra:
When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings. CoRR abs/1008.5356 (2010) - [i10]Atri Rudra, Steve Uurtamo:
Two Theorems in List Decoding. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j7]Venkatesan Guruswami, Atri Rudra:
Error correction up to the information-theoretic limit. Commun. ACM 52(3): 87-95 (2009) - [j6]Charanjit S. Jutla, Anindya C. Patthak, Atri Rudra, David Zuckerman:
Testing low-degree polynomials over prime fields. Random Struct. Algorithms 35(2): 163-193 (2009) - [j5]Venkatesan Guruswami, Atri Rudra:
Better Binary List Decodable Codes Via Multilevel Concatenation. IEEE Trans. Inf. Theory 55(1): 19-26 (2009) - [c24]Atri Rudra:
Limits to List Decoding Random Codes. COCOON 2009: 27-36 - [c23]Ning Chen, Nicole Immorlica, Anna R. Karlin, Mohammad Mahdian, Atri Rudra:
Approximating Matches Made in Heaven. ICALP (1) 2009: 266-278 - [c22]Murat Demirbas, Carole Rudra, Atri Rudra, Murat Ali Bayir:
iMAP: Indirect Measurement of Air Pollution with Cellphones. PerCom Workshops 2009: 1-6 - [i9]Atri Rudra:
Limits to List Decoding Random Codes. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j4]Ning Chen, Atri Rudra:
Walrasian Equilibrium: Hardness, Approximations and Tractable Instances. Algorithmica 52(1): 44-64 (2008) - [j3]Venkatesan Guruswami, Atri Rudra:
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy. IEEE Trans. Inf. Theory 54(1): 135-150 (2008) - [c21]Venkatesan Guruswami, Atri Rudra:
Soft Decoding, Dual BCH Codes, and Better List-Decodable e-Biased Codes. CCC 2008: 163-174 - [c20]Robert Krauthgamer, Aranyak Mehta, Vijayshankar Raman, Atri Rudra:
Greedy List Intersection. ICDE 2008: 1033-1042 - [c19]Venkatesan Guruswami, Atri Rudra:
Concatenated codes can achieve list-decoding capacity. SODA 2008: 258-267 - [r1]Atri Rudra:
List Decoding near Capacity: Folded RS Codes. Encyclopedia of Algorithms 2008 - [i8]Venkatesan Guruswami, Atri Rudra:
Soft decoding, dual BCH codes, and better list-decodable eps-biased codes. Electron. Colloquium Comput. Complex. TR08 (2008) - [i7]Venkatesan Guruswami, Atri Rudra:
Concatenated codes can achieve list-decoding capacity. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [c18]Atri Rudra:
Efficient List Decoding of Explicit Codes with Optimal Redundancy. AAECC 2007: 38-46 - [c17]Ning Chen, Roee Engelberg, C. Thach Nguyen, Prasad Raghavendra, Atri Rudra, Gyanit Singh:
Improved Approximation Algorithms for the Spanning Star Forest Problem. APPROX-RANDOM 2007: 44-58 - [c16]Venkatesan Guruswami, Atri Rudra:
Better Binary List-Decodable Codes Via Multilevel Concatenation. APPROX-RANDOM 2007: 554-568 - [c15]Matthew Cary, Atri Rudra, Ashish Sabharwal:
Paper Retraction: On the Hardness of Embeddings Between Two Finite Metrics. ICALP 2007: 949 - [c14]Nikhil Bansal, Ning Chen, Neva Cherniavsky, Atri Rudra, Baruch Schieber, Maxim Sviridenko:
Dynamic pricing for impatient bidders. SODA 2007: 726-735 - [c13]Paul Beame, T. S. Jayram, Atri Rudra:
Lower bounds for randomized read/write stream algorithms. STOC 2007: 689-698 - [c12]Robert Krauthgamer, Aranyak Mehta, Atri Rudra:
Pricing Commodities, or How to Sell When Buyers Have Restricted Valuations. WAOA 2007: 1-14 - [i6]Venkatesan Guruswami, Atri Rudra:
Better Binary List-Decodable Codes via Multilevel Concatenation. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j2]Venkatesan Guruswami, Atri Rudra:
Limits to List Decoding Reed-Solomon Codes. IEEE Trans. Inf. Theory 52(8): 3642-3649 (2006) - [c11]Don Coppersmith, Lisa Fleischer, Atri Rudra:
Ordering by weighted number of wins gives a good ranking for weighted tournaments. SODA 2006: 776-782 - [c10]Venkatesan Guruswami, Atri Rudra:
Explicit capacity-achieving list-decodable codes. STOC 2006: 1-10 - 2005
- [c9]Venkatesan Guruswami, Atri Rudra:
Tolerant Locally Testable Codes. APPROX-RANDOM 2005: 306-317 - [c8]Vijay Kumar, Atri Rudra:
Approximation Algorithms for Wavelength Assignment. FSTTCS 2005: 152-163 - [c7]Venkatesan Guruswami, Atri Rudra:
Limits to list decoding Reed-Solomon codes. STOC 2005: 602-609 - [c6]Ning Chen, Atri Rudra:
Walrasian Equilibrium: Hardness, Approximations and Tractable Instances. WINE 2005: 141-150 - [i5]Venkatesan Guruswami, Atri Rudra:
Explicit Codes Achieving List Decoding Capacity: Error-correction with Optimal Redundancy. CoRR abs/cs/0511072 (2005) - [i4]Venkatesan Guruswami, Atri Rudra:
Tolerant Locally Testable Codes. Electron. Colloquium Comput. Complex. TR05 (2005) - [i3]Don Coppersmith, Atri Rudra:
On the Robust Testability of Product of Codes. Electron. Colloquium Comput. Complex. TR05 (2005) - [i2]Don Coppersmith, Lisa Fleischer, Atri Rudra:
Ordering by weighted number of wins gives a good ranking for weighted tournaments. Electron. Colloquium Comput. Complex. TR05 (2005) - [i1]Venkatesan Guruswami, Atri Rudra:
Explicit Capacity-Achieving List-Decodable Codes. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j1]Avrim Blum, Vijay Kumar, Atri Rudra, Felix Wu:
Online learning in online auctions. Theor. Comput. Sci. 324(2-3): 137-146 (2004) - [c5]Charanjit S. Jutla, Anindya C. Patthak, Atri Rudra, David Zuckerman:
Testing Low-Degree Polynomials over Prime Fields. FOCS 2004: 423-432 - 2003
- [c4]Rahul Garg, Vijay Kumar, Atri Rudra, Akshat Verma:
Coalitional games on graphs: core structure, substitutes and frugality. EC 2003: 248-249 - [c3]Avrim Blum, Vijay Kumar, Atri Rudra, Felix Wu:
Online learning in online auctions. SODA 2003: 202-204 - [c2]Raghav Bhaskar, Pradeep K. Dubey, Vijay Kumar, Atri Rudra:
Efficient galois field arithmetic on SIMD architectures. SPAA 2003: 256-257 - 2001
- [c1]Atri Rudra, Pradeep K. Dubey, Charanjit S. Jutla, Vijay Kumar, Josyula R. Rao, Pankaj Rohatgi:
Efficient Rijndael Encryption Implementation with Composite Field Arithmetic. CHES 2001: 171-184
Coauthor Index
[c78] [c77] [i67] [i66] [c76] [c75] [c74] [c73] [c72] [i65] [i64] [i63] [i62] [c70] [c69] [c68] [i61] [i59] [i58] [i56] [c67] [c66] [i55] [i54] [i53] [c65] [c64] [c63] [i49] [i48] [c62] [i47] [i46] [j23] [c60] [c59] [c57] [i44] [i43] [i42] [j21] [i36] [c49] [c48] [i34] [c44] [i31] [j18] [i26] [i23] [c37] [i20]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
