BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Australia
1 × France
1 × Greece
1 × Japan
1 × Latvia
1 × Poland
1 × Portugal
1 × Switzerland
6 × USA
Collaborated with:
H.Q.Ngo V.Guruswami E.Porat C.Ré M.Cary A.Sabharwal A.Chattopadhyay M.Wootters S.Uurtamo P.Beame T.S.Jayram M.A.Khamis D.T.Nguyen A.C.Gilbert M.J.Strauss N.Chen N.Immorlica A.R.Karlin M.Mahdian
Talks about:
decod (4) list (4) algorithm (3) worst (3) join (3) code (3) case (3) between (2) stream (2) metric (2)

Person: Atri Rudra

DBLP DBLP: Rudra:Atri

Contributed to:

ICALP (2) 20152015
PODS 20152015
PODS 20142014
STOC 20142014
ICALP (1) 20132013
PODS 20122012
ICALP (1) 20112011
ICALP (1) 20102010
ICALP (1) 20092009
ICALP 20072007
STOC 20072007
STOC 20062006
ICALP 20052005
STOC 20052005

Wrote 14 papers:

ICALP-v2-2015-ChattopadhyayR #communication
The Range of Topological Effects on Communication (AC, AR), pp. 540–551.
PODS-2015-KhamisNRR #geometry #worst-case
Joins via Geometric Resolutions: Worst-case and Beyond (MAK, HQN, CR, AR), pp. 213–228.
PODS-2014-NgoNRR #analysis #worst-case
Beyond worst-case analysis for joins with minesweeper (HQN, DTN, CR, AR), pp. 234–245.
STOC-2014-RudraW
Every list-decodable code for high noise has abundant near-optimal rate puncturings (AR, MW), pp. 764–773.
ICALP-v1-2013-GilbertNPRS
ℓ2/ℓ2-Foreach Sparse Recovery with Low Risk (ACG, HQN, EP, AR, MJS), pp. 461–472.
PODS-2012-NgoPRR #algorithm #worst-case
Worst-case optimal join algorithms: [extended abstract] (HQN, EP, CR, AR), pp. 37–48.
ICALP-v1-2011-NgoPR #matrix
Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications — (HQN, EP, AR), pp. 557–568.
ICALP-v1-2010-RudraU #algorithm #data type #testing
Data Stream Algorithms for Codeword Testing (AR, SU), pp. 629–640.
ICALP-v1-2009-ChenIKMR #approximate
Approximating Matches Made in Heaven (NC, NI, ARK, MM, AR), pp. 266–278.
ICALP-2007-CaryRS #finite #metric
Paper Retraction: On the Hardness of Embeddings Between Two Finite Metrics (MC, AR, AS), p. 949.
STOC-2007-BeameJR #algorithm #bound #random
Lower bounds for randomized read/write stream algorithms (PB, TSJ, AR), pp. 689–698.
STOC-2006-GuruswamiR
Explicit capacity-achieving list-decodable codes (VG, AR), pp. 1–10.
ICALP-2005-CaryRS #finite #metric #on the
On the Hardness of Embeddings Between Two Finite Metrics (MC, AR, AS), pp. 1412–1423.
STOC-2005-GuruswamiR
Limits to list decoding Reed-Solomon codes (VG, AR), pp. 602–609.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.