Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Rudra, Atri"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Improved approximation algorithms for the spanning star forest problem
Ning Chen
,
Roee Engelberg
,
C. Thach Nguyen
,
Prasad Raghavendra
,
Atri Rudra
Algorithmica
65
(3), 2013, pp. 498-516
\ell_2/\ell_2
-foreach sparse recovery with low risk
Anna C. Gilbert
,
Hung Q. Ngo
,
Ely Porat
,
Atri Rudra
,
Martin J. Strauss
Lecture Notes in Computer Science
7965
, 2013, pp. 461-472
When LP is the cure for your matching woes: Improved bounds for stochastic matchings
Nikhil Bansal
,
Anupam Gupta
,
Jian Li
,
Julián Mestre
,
Viswanath Nagarajan
,
Atri Rudra
Algorithmica
63
(4), 2012, pp. 733-762
Efficiently decodable compressed sensing by list-recoverable codes and recursion
Hung Q. Ngo
,
Ely Porat
,
Atri Rudra
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 230-241
Pricing commodities
Robert Krauthgamer
,
Aranyak Mehta
,
Atri Rudra
Theoretical Computer Science
412
(7), 2011, pp. 602-613
Flexible coloring
Xiaozhou Li
,
Atri Rudra
,
Ram Swaminathan
Information Processing Letters
111
(11), 2011, pp. 538-540
Symmetric functions capture general functions
Richard J. Lipton
,
Kenneth W. Regan
,
Atri Rudra
Lecture Notes in Computer Science
6907
, 2011, pp. 436-447
Polynomial fitting of data streams with applications to codeword testing
Andrew McGregor
,
Atri Rudra
,
Steve Uurtamo
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 428-439
Efficiently decodable error-correcting list disjunct matrices and applications
Hung Q. Ngo
,
Ely Porat
,
Atri Rudra
Lecture Notes in Computer Science
6755
, 2011, pp. 557-568
When LP is the cure for your matching woes: Improved bounds for stochastic matchings
Nikhil Bansal
,
Anupam Gupta
,
Jian Li
,
Julián Mestre
,
Viswanath Nagarajan
,
Atri Rudra
Lecture Notes in Computer Science
6347
, 2010, pp. 218-229
Data stream algorithms for codeword testing
Atri Rudra
,
Steve Uurtamo
Lecture Notes in Computer Science
6198
, 2010, pp. 629-640
Approximating matches made in heaven
Ning Chen
,
Nicole Immorlica
,
Anna R. Karlin
,
Mohammad Mahdian
,
Atri Rudra
Lecture Notes in Computer Science
5555
, 2009, pp. 266-278
Limits to list decoding random codes
Atri Rudra
Lecture Notes in Computer Science
5609
, 2009, pp. 27-36
Walrasian equilibrium: Hardness, approximations and tractable instances
Ning Chen
,
Atri Rudra
Algorithmica
52
(1), 2008, pp. 44-64
Lower bounds for randomized read/write stream algorithms
Paul Beame
,
T.S. Jayram
,
Atri Rudra
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007)
, 2007, pp. 689-698
Paper retraction: On the hardness of embeddings between two finite metrics
Matthew Cary
,
Atri Rudra
,
Ashish Sabharwal
Lecture Notes in Computer Science
4596
, 2007, pp. 949-949
Efficient list decoding of explicit codes with optimal redundancy
Atri Rudra
Lecture Notes in Computer Science
4851
, 2007, pp. 38-46
Explicit capacity-achieving list-decodable codes OR decoding up to the singleton bound using folded Reed-Solomon codes
Venkatesan Guruswami
,
Atri Rudra
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'2006 (Seattle, Washington, USA, May 21-23, 2006)
, 2006, pp. 1-10
On the hardness of embeddings between two finite metrics
Matthew Cary
,
Atri Rudra
,
Ashish Sabharwal
Lecture Notes in Computer Science
3580
, 2005, pp. 1412-1423
Limits to list decoding Reed-Solomon codes
Venkatesan Guruswami
,
Atri Rudra
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, STOC'2005 (Baltimore, Maryland, USA, May 22-24, 2005)
, 2005, pp. 602-609
Approximation algorithms for wavelength assignment
Vijay Kumar
,
Atri Rudra
Lecture Notes in Computer Science
3821
, 2005, pp. 152-163
Online learning in online auctions
Avrim Blum
,
Vijay Kumar
,
Atri Rudra
,
Felix Wu
Theoretical Computer Science
324
(2-3), 2004, pp. 137-146
Efficient Galois Field arithmetic on SIMD architectures
Raghav Bhaskar
,
Pradeep K. Dubey
,
Vijay Kumar
,
Atri Rudra
Proceedings of the 15th Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2003 (San Diego, California, June 7-9, 2003)
, 2003, pp. 256-257