☰

Atri Rudra, Ph.D. - Publications

Affiliations: 
2007 University of Washington, Seattle, Seattle, WA 
Area:
Computer Science
Tree Info Similar researchers PubMed Report error

20 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2015 Khamis MA, Ngo HQ, Ré C, Rudra A. Joins via Geometric Resolutions: Worst-case and beyond Proceedings of the Acm Sigact-Sigmod-Sigart Symposium On Principles of Database Systems. 31: 213-228. DOI: 10.1145/2967101  0.307
2015 Operations R, Rudra A, Wootters M. It'll probably work out: Improved list-decoding through Itcs 2015 - Proceedings of the 6th Innovations in Theoretical Computer Science. 287-296. DOI: 10.1145/2688073.2688092  0.46
2014 Rudra A, Wootters M. Every list-decodable code for high noise has abundant near-optimal rate puncturings Proceedings of the Annual Acm Symposium On Theory of Computing. 764-773. DOI: 10.1145/2591796.2591797  0.353
2012 Ngo HQ, Porat E, Rudra A. Efficiently decodable compressed sensing by list-recoverable codes and recursion Leibniz International Proceedings in Informatics, Lipics. 14: 230-241. DOI: 10.4230/LIPIcs.STACS.2012.230  0.501
2011 Guruswami V, Rudra A. Soft decoding, dual BCH codes, and better list-decodable ε-biased codes Ieee Transactions On Information Theory. 57: 705-717. DOI: 10.1109/Tit.2010.2095193  0.633
2011 Rudra A. Limits to list decoding of Random codes Ieee Transactions On Information Theory. 57: 1398-1408. DOI: 10.1109/Tit.2010.2054750  0.518
2011 Ngo HQ, Porat E, Rudra A. Efficiently decodable error-correcting list disjunct matrices and applications Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6755: 557-568. DOI: 10.1007/978-3-642-22006-7_47  0.302
2010 Guruswami V, Rudra A. The existence of concatenated codes list-decodable up to the Hamming bound Ieee Transactions On Information Theory. 56: 5195-5206. DOI: 10.1109/Tit.2010.2059572  0.707
2010 Rudra A, Uurtamo S. Two theorems on list decoding (extended abstract) Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6302: 696-709. DOI: 10.1007/978-3-642-15369-3_52  0.322
2009 Guruswami V, Rudra A. Error correction up to the information-theoretic limit Communications of the Acm. 52: 87-95. DOI: 10.1145/1467247.1467269  0.648
2009 Guruswami V, Rudra A. Better binary list decodable codes via multilevel concatenation Ieee Transactions On Information Theory. 55: 19-26. DOI: 10.1109/Tit.2008.2008124  0.716
2009 Rudra A. Limits to list decoding random codes Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5609: 27-36. DOI: 10.1007/978-3-642-02882-3_4  0.52
2008 Guruswami V, Rudra A. Explicit codes achieving list decoding capacity: Error-correction with optimal redundancy Ieee Transactions On Information Theory. 54: 135-150. DOI: 10.1109/Tit.2007.911222  0.705
2008 Guruswami V, Rudra A. Concatenated codes can achieve list-decoding capacity Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 258-267.  0.684
2007 Rudra A. Efficient list decoding of explicit codes with optimal redundancy Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4851: 38-46. DOI: 10.1007/978-3-540-77224-8_6  0.503
2007 Guruswami V, Rudra A. Better binary list-decodable codes via multilevel concatenation Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4627: 554-568.  0.686
2006 Guruswami V, Rudra A. Limits to list decoding reed-solomon codes Ieee Transactions On Information Theory. 52: 3642-3649. DOI: 10.1109/Tit.2006.878164  0.683
2006 Guruswami V, Rudra A. Explicit capacity-achieving list-decodable codes or decoding up to the singleton bound using folded Reed-Solomon codes Proceedings of the Annual Acm Symposium On Theory of Computing. 2006: 1-10.  0.692
2006 Guruswami V, Rudra A. Achieving list decoding capacity using folded reed-solomon codes 44th Annual Allerton Conference On Communication, Control, and Computing 2006. 3: 1180-1186.  0.68
2005 Guruswami V, Rudra A. Tolerant locally testable codes Lecture Notes in Computer Science. 3624: 306-317.  0.643
Show low-probability matches.