The SCEAS System
| |||||||

## Search the dblp DataBase
Atri Rudra:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Venkatesan Guruswami, Atri Rudra
**Tolerant Locally Testable Codes.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2005, pp:306-317 [Conf] - Atri Rudra, Pradeep K. Dubey, Charanjit S. Jutla, Vijay Kumar, Josyula R. Rao, Pankaj Rohatgi
**Efficient Rijndael Encryption Implementation with Composite Field Arithmetic.**[Citation Graph (0, 0)][DBLP] CHES, 2001, pp:171-184 [Conf] - Charanjit S. Jutla, Anindya C. Patthak, Atri Rudra, David Zuckerman
**Testing Low-Degree Polynomials over Prime Fields.**[Citation Graph (0, 0)][DBLP] FOCS, 2004, pp:423-432 [Conf] - Vijay Kumar, Atri Rudra
**Approximation Algorithms for Wavelength Assignment.**[Citation Graph (0, 0)][DBLP] FSTTCS, 2005, pp:152-163 [Conf] - Matthew Cary, Atri Rudra, Ashish Sabharwal
**On the Hardness of Embeddings Between Two Finite Metrics.**[Citation Graph (0, 0)][DBLP] ICALP, 2005, pp:1412-1423 [Conf] - Rahul Garg, Vijay Kumar, Atri Rudra, Akshat Verma
**Coalitional games on graphs: core structure, substitutes and frugality.**[Citation Graph (0, 0)][DBLP] ACM Conference on Electronic Commerce, 2003, pp:248-249 [Conf] - Avrim Blum, Vijay Kumar, Atri Rudra, Felix Wu
**Online learning in online auctions.**[Citation Graph (0, 0)][DBLP] SODA, 2003, pp:202-204 [Conf] - Don Coppersmith, Lisa Fleischer, Atri Rudra
**Ordering by weighted number of wins gives a good ranking for weighted tournaments.**[Citation Graph (0, 0)][DBLP] SODA, 2006, pp:776-782 [Conf] - Raghav Bhaskar, Pradeep K. Dubey, Vijay Kumar, Atri Rudra
**Efficient galois field arithmetic on SIMD architectures.**[Citation Graph (0, 0)][DBLP] SPAA, 2003, pp:256-257 [Conf] - Venkatesan Guruswami, Atri Rudra
**Limits to list decoding Reed-Solomon codes.**[Citation Graph (0, 0)][DBLP] STOC, 2005, pp:602-609 [Conf] - Venkatesan Guruswami, Atri Rudra
**Explicit capacity-achieving list-decodable codes.**[Citation Graph (0, 0)][DBLP] STOC, 2006, pp:1-10 [Conf] - Ning Chen, Atri Rudra
**Walrasian Equilibrium: Hardness, Approximations and Tractable Instances.**[Citation Graph (0, 0)][DBLP] WINE, 2005, pp:141-150 [Conf] - Venkatesan Guruswami, Atri Rudra
**Tolerant Locally Testable Codes**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:019, pp:- [Journal] - Don Coppersmith, Atri Rudra
**On the Robust Testability of Product of Codes**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:104, pp:- [Journal] - Don Coppersmith, Lisa Fleischer, Atri Rudra
**Ordering by weighted number of wins gives a good ranking for weighted tournaments**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:131, pp:- [Journal] - Venkatesan Guruswami, Atri Rudra
**Explicit Capacity-Achieving List-Decodable Codes**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:133, pp:- [Journal] - Avrim Blum, Vijay Kumar, Atri Rudra, Felix Wu
**Online learning in online auctions.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2004, v:324, n:2-3, pp:137-146 [Journal] - Venkatesan Guruswami, Atri Rudra
**Limits to List Decoding Reed-Solomon Codes.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2006, v:52, n:8, pp:3642-3649 [Journal] - Ning Chen, Roee Engelberg, C. Thach Nguyen, Prasad Raghavendra, Atri Rudra, Gyanit Singh
**Improved Approximation Algorithms for the Spanning Star Forest Problem.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2007, pp:44-58 [Conf] - Venkatesan Guruswami, Atri Rudra
**Better Binary List-Decodable Codes Via Multilevel Concatenation.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2007, pp:554-568 [Conf] - Matthew Cary, Atri Rudra, Ashish Sabharwal
**Paper Retraction: On the Hardness of Embeddings Between Two Finite Metrics.**[Citation Graph (0, 0)][DBLP] ICALP, 2007, pp:949- [Conf] - Nikhil Bansal, Ning Chen, Neva Cherniavsky, Atri Rudra, Baruch Schieber, Maxim Sviridenko
**Dynamic pricing for impatient bidders.**[Citation Graph (0, 0)][DBLP] SODA, 2007, pp:726-735 [Conf] - Paul Beame, T. S. Jayram, Atri Rudra
**Lower bounds for randomized read/write stream algorithms.**[Citation Graph (0, 0)][DBLP] STOC, 2007, pp:689-698 [Conf] **Efficient List Decoding of Explicit Codes with Optimal Redundancy.**[Citation Graph (, )][DBLP]**Two Theorems on List Decoding - (Extended Abstract).**[Citation Graph (, )][DBLP]**Soft Decoding, Dual BCH Codes, and Better List-Decodable e-Biased Codes.**[Citation Graph (, )][DBLP]**Limits to List Decoding Random Codes.**[Citation Graph (, )][DBLP]**When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings - (Extended Abstract).**[Citation Graph (, )][DBLP]**Approximating Matches Made in Heaven.**[Citation Graph (, )][DBLP]**Data Stream Algorithms for Codeword Testing.**[Citation Graph (, )][DBLP]**Greedy List Intersection.**[Citation Graph (, )][DBLP]**Analyzing Nonblocking Switching Networks using Linear Programming (Duality).**[Citation Graph (, )][DBLP]**iMAP: Indirect Measurement of Air Pollution with Cellphones.**[Citation Graph (, )][DBLP]**Concatenated codes can achieve list-decoding capacity.**[Citation Graph (, )][DBLP]**Efficiently Decodable Non-adaptive Group Testing.**[Citation Graph (, )][DBLP]**Pricing Commodities, or How to Sell When Buyers Have Restricted Valuations.**[Citation Graph (, )][DBLP]**Walrasian Equilibrium: Hardness, Approximations and Tractable Instances.**[Citation Graph (, )][DBLP]**Error correction up to the information-theoretic limit.**[Citation Graph (, )][DBLP]**Floodlight illumination of infinite wedges.**[Citation Graph (, )][DBLP]**Explicit Codes Achieving List Decoding Capacity: Error-correction with Optimal Redundancy**[Citation Graph (, )][DBLP]**Two Theorems in List Decoding**[Citation Graph (, )][DBLP]**When LP is the Cure for Your Matching Woes: Approximating Stochastic Matchings**[Citation Graph (, )][DBLP]**Data Stream Algorithms for Codeword Testing**[Citation Graph (, )][DBLP]**When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings**[Citation Graph (, )][DBLP]**Soft decoding, dual BCH codes, and better list-decodable eps-biased codes.**[Citation Graph (, )][DBLP]**Concatenated codes can achieve list-decoding capacity.**[Citation Graph (, )][DBLP]**Better Binary List-Decodable Codes via Multilevel Concatenation.**[Citation Graph (, )][DBLP]
Search in 0.023secs, Finished in 0.026secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |