The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Atri Rudra: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Venkatesan Guruswami, Atri Rudra
    Tolerant Locally Testable Codes. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2005, pp:306-317 [Conf]
  2. 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]
  3. 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]
  4. Vijay Kumar, Atri Rudra
    Approximation Algorithms for Wavelength Assignment. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:152-163 [Conf]
  5. 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]
  6. 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]
  7. Avrim Blum, Vijay Kumar, Atri Rudra, Felix Wu
    Online learning in online auctions. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:202-204 [Conf]
  8. 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]
  9. 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]
  10. Venkatesan Guruswami, Atri Rudra
    Limits to list decoding Reed-Solomon codes. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:602-609 [Conf]
  11. Venkatesan Guruswami, Atri Rudra
    Explicit capacity-achieving list-decodable codes. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:1-10 [Conf]
  12. Ning Chen, Atri Rudra
    Walrasian Equilibrium: Hardness, Approximations and Tractable Instances. [Citation Graph (0, 0)][DBLP]
    WINE, 2005, pp:141-150 [Conf]
  13. 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]
  14. 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]
  15. 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]
  16. 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]
  17. 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]
  18. 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]
  19. 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]
  20. Venkatesan Guruswami, Atri Rudra
    Better Binary List-Decodable Codes Via Multilevel Concatenation. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:554-568 [Conf]
  21. 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]
  22. 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]
  23. 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]

  24. Efficient List Decoding of Explicit Codes with Optimal Redundancy. [Citation Graph (, )][DBLP]


  25. Two Theorems on List Decoding - (Extended Abstract). [Citation Graph (, )][DBLP]


  26. Soft Decoding, Dual BCH Codes, and Better List-Decodable e-Biased Codes. [Citation Graph (, )][DBLP]


  27. Limits to List Decoding Random Codes. [Citation Graph (, )][DBLP]


  28. When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings - (Extended Abstract). [Citation Graph (, )][DBLP]


  29. Approximating Matches Made in Heaven. [Citation Graph (, )][DBLP]


  30. Data Stream Algorithms for Codeword Testing. [Citation Graph (, )][DBLP]


  31. Greedy List Intersection. [Citation Graph (, )][DBLP]


  32. Analyzing Nonblocking Switching Networks using Linear Programming (Duality). [Citation Graph (, )][DBLP]


  33. iMAP: Indirect Measurement of Air Pollution with Cellphones. [Citation Graph (, )][DBLP]


  34. Concatenated codes can achieve list-decoding capacity. [Citation Graph (, )][DBLP]


  35. Efficiently Decodable Non-adaptive Group Testing. [Citation Graph (, )][DBLP]


  36. Pricing Commodities, or How to Sell When Buyers Have Restricted Valuations. [Citation Graph (, )][DBLP]


  37. Walrasian Equilibrium: Hardness, Approximations and Tractable Instances. [Citation Graph (, )][DBLP]


  38. Error correction up to the information-theoretic limit. [Citation Graph (, )][DBLP]


  39. Floodlight illumination of infinite wedges. [Citation Graph (, )][DBLP]


  40. Explicit Codes Achieving List Decoding Capacity: Error-correction with Optimal Redundancy [Citation Graph (, )][DBLP]


  41. Two Theorems in List Decoding [Citation Graph (, )][DBLP]


  42. When LP is the Cure for Your Matching Woes: Approximating Stochastic Matchings [Citation Graph (, )][DBLP]


  43. Data Stream Algorithms for Codeword Testing [Citation Graph (, )][DBLP]


  44. When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings [Citation Graph (, )][DBLP]


  45. Soft decoding, dual BCH codes, and better list-decodable eps-biased codes. [Citation Graph (, )][DBLP]


  46. Concatenated codes can achieve list-decoding capacity. [Citation Graph (, )][DBLP]


  47. Better Binary List-Decodable Codes via Multilevel Concatenation. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002