| 2009 |
|---|
| 37 | EE | Venkatesan Guruswami,
Atri Rudra:
Error correction up to the information-theoretic limit.
Commun. ACM 52(3): 87-95 (2009) |
| 36 | EE | Venkatesan Guruswami,
Atri Rudra:
Better Binary List Decodable Codes Via Multilevel Concatenation.
IEEE Transactions on Information Theory 55(1): 19-26 (2009) |
| 2008 |
|---|
| 35 | EE | Robert Krauthgamer,
Aranyak Mehta,
Vijayshankar Raman,
Atri Rudra:
Greedy List Intersection.
ICDE 2008: 1033-1042 |
| 34 | EE | Venkatesan Guruswami,
Atri Rudra:
Soft Decoding, Dual BCH Codes, and Better List-Decodable e-Biased Codes.
IEEE Conference on Computational Complexity 2008: 163-174 |
| 33 | EE | Venkatesan Guruswami,
Atri Rudra:
Concatenated codes can achieve list-decoding capacity.
SODA 2008: 258-267 |
| 32 | EE | Atri Rudra:
List Decoding near Capacity: Folded RS Codes.
Encyclopedia of Algorithms 2008 |
| 31 | EE | Ning Chen,
Atri Rudra:
Walrasian Equilibrium: Hardness, Approximations and Tractable Instances.
Algorithmica 52(1): 44-64 (2008) |
| 30 | EE | Venkatesan Guruswami,
Atri Rudra:
Soft decoding, dual BCH codes, and better list-decodable eps-biased codes.
Electronic Colloquium on Computational Complexity (ECCC) 15(036): (2008) |
| 29 | EE | Venkatesan Guruswami,
Atri Rudra:
Concatenated codes can achieve list-decoding capacity.
Electronic Colloquium on Computational Complexity (ECCC) 15(054): (2008) |
| 28 | EE | Venkatesan Guruswami,
Atri Rudra:
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy.
IEEE Transactions on Information Theory 54(1): 135-150 (2008) |
| 2007 |
|---|
| 27 | EE | Atri Rudra:
Efficient List Decoding of Explicit Codes with Optimal Redundancy.
AAECC 2007: 38-46 |
| 26 | EE | 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 |
| 25 | EE | Venkatesan Guruswami,
Atri Rudra:
Better Binary List-Decodable Codes Via Multilevel Concatenation.
APPROX-RANDOM 2007: 554-568 |
| 24 | EE | Matthew Cary,
Atri Rudra,
Ashish Sabharwal:
Paper Retraction: On the Hardness of Embeddings Between Two Finite Metrics.
ICALP 2007: 949 |
| 23 | EE | Nikhil Bansal,
Ning Chen,
Neva Cherniavsky,
Atri Rudra,
Baruch Schieber,
Maxim Sviridenko:
Dynamic pricing for impatient bidders.
SODA 2007: 726-735 |
| 22 | EE | Paul Beame,
T. S. Jayram,
Atri Rudra:
Lower bounds for randomized read/write stream algorithms.
STOC 2007: 689-698 |
| 21 | EE | Robert Krauthgamer,
Aranyak Mehta,
Atri Rudra:
Pricing Commodities, or How to Sell When Buyers Have Restricted Valuations.
WAOA 2007: 1-14 |
| 20 | EE | Venkatesan Guruswami,
Atri Rudra:
Better Binary List-Decodable Codes via Multilevel Concatenation.
Electronic Colloquium on Computational Complexity (ECCC) 14(109): (2007) |
| 2006 |
|---|
| 19 | EE | Don Coppersmith,
Lisa Fleischer,
Atri Rudra:
Ordering by weighted number of wins gives a good ranking for weighted tournaments.
SODA 2006: 776-782 |
| 18 | EE | Venkatesan Guruswami,
Atri Rudra:
Explicit capacity-achieving list-decodable codes.
STOC 2006: 1-10 |
| 17 | EE | Venkatesan Guruswami,
Atri Rudra:
Limits to List Decoding Reed-Solomon Codes.
IEEE Transactions on Information Theory 52(8): 3642-3649 (2006) |
| 2005 |
|---|
| 16 | EE | Venkatesan Guruswami,
Atri Rudra:
Tolerant Locally Testable Codes.
APPROX-RANDOM 2005: 306-317 |
| 15 | EE | Vijay Kumar,
Atri Rudra:
Approximation Algorithms for Wavelength Assignment.
FSTTCS 2005: 152-163 |
| 14 | EE | Matthew Cary,
Atri Rudra,
Ashish Sabharwal:
On the Hardness of Embeddings Between Two Finite Metrics.
ICALP 2005: 1412-1423 |
| 13 | EE | Venkatesan Guruswami,
Atri Rudra:
Limits to list decoding Reed-Solomon codes.
STOC 2005: 602-609 |
| 12 | EE | Ning Chen,
Atri Rudra:
Walrasian Equilibrium: Hardness, Approximations and Tractable Instances.
WINE 2005: 141-150 |
| 11 | EE | Venkatesan Guruswami,
Atri Rudra:
Explicit Codes Achieving List Decoding Capacity: Error-correction with Optimal Redundancy
CoRR abs/cs/0511072: (2005) |
| 10 | EE | Venkatesan Guruswami,
Atri Rudra:
Tolerant Locally Testable Codes
Electronic Colloquium on Computational Complexity (ECCC)(019): (2005) |
| 9 | EE | Don Coppersmith,
Atri Rudra:
On the Robust Testability of Product of Codes
Electronic Colloquium on Computational Complexity (ECCC)(104): (2005) |
| 8 | EE | Don Coppersmith,
Lisa Fleischer,
Atri Rudra:
Ordering by weighted number of wins gives a good ranking for weighted tournaments
Electronic Colloquium on Computational Complexity (ECCC)(131): (2005) |
| 7 | EE | Venkatesan Guruswami,
Atri Rudra:
Explicit Capacity-Achieving List-Decodable Codes
Electronic Colloquium on Computational Complexity (ECCC)(133): (2005) |
| 2004 |
|---|
| 6 | EE | Charanjit S. Jutla,
Anindya C. Patthak,
Atri Rudra,
David Zuckerman:
Testing Low-Degree Polynomials over Prime Fields.
FOCS 2004: 423-432 |
| 5 | EE | Avrim Blum,
Vijay Kumar,
Atri Rudra,
Felix Wu:
Online learning in online auctions.
Theor. Comput. Sci. 324(2-3): 137-146 (2004) |
| 2003 |
|---|
| 4 | EE | Rahul Garg,
Vijay Kumar,
Atri Rudra,
Akshat Verma:
Coalitional games on graphs: core structure, substitutes and frugality.
ACM Conference on Electronic Commerce 2003: 248-249 |
| 3 | EE | Avrim Blum,
Vijay Kumar,
Atri Rudra,
Felix Wu:
Online learning in online auctions.
SODA 2003: 202-204 |
| 2 | EE | Raghav Bhaskar,
Pradeep K. Dubey,
Vijay Kumar,
Atri Rudra:
Efficient galois field arithmetic on SIMD architectures.
SPAA 2003: 256-257 |
| 2001 |
|---|
| 1 | EE | 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 |
