BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × Finland
1 × France
12 × USA
Collaborated with:
P.Indyk C.Xing A.Rudra P.Raghavendra J.Håstad R.Saket M.Charikar M.Sudan S.Khanna S.Khot S.Kopparty M.Bateni P.Gopalan J.Chuzhoy K.Talwar I.Dinur O.Regev P.Harsha S.Srinivasan G.Varma R.Rajaraman F.B.Shepherd M.Yannakakis R.O'Donnell P.Popat M.Tulsiani Y.Wu R.Fagin J.M.Kleinberg P.Raghavan A.Sahai
Talks about:
decod (13) code (13) list (12) linear (5) hard (4) hypergraph (3) optim (3) cover (3) time (3) algorithm (2)

Person: Venkatesan Guruswami

DBLP DBLP: Guruswami:Venkatesan

Contributed to:

STOC 20142014
STOC 20132013
STOC 20122012
ICALP (1) 20102010
STOC 20102010
STOC 20092009
STOC 20072007
STOC 20062006
STOC 20052005
ICALP 20042004
STOC 20042004
STOC 20032003
STOC 20022002
STOC 20002000
STOC 19991999

Wrote 22 papers:

Super-polylogarithmic hypergraph coloring hardness via low-degree long codes (VG, PH, JH, SS, GV), pp. 614–623.
STOC-2013-GuruswamiX #algebra #bound #geometry
List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound (VG, CX), pp. 843–852.
Folded codes from function field towers and improved optimal rate list decoding (VG, CX), pp. 339–350.
SDP Gaps for 2-to-1 and Other Label-Cover Variants (VG, SK, RO, PP, MT, YW), pp. 617–628.
ICALP-v1-2010-GuruswamiS #on the
On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs (VG, RS), pp. 360–371.
STOC-2010-GuruswamiHK #linear #on the #random
On the list-decodability of random linear codes (VG, JH, SK), pp. 409–416.
STOC-2009-BateniCG #bound
MaxMin allocation via degree lower-bounded arborescences (MB, MC, VG), pp. 543–552.
List decoding tensor products and interleaved codes (PG, VG, PR), pp. 13–22.
STOC-2009-Guruswami #morphism
Artin automorphisms, cyclotomic function fields, and folded list-decodable codes (VG), pp. 23–32.
STOC-2007-ChuzhoyGKT #graph
Hardness of routing with congestion in directed graphs (JC, VG, SK, KT), pp. 165–178.
STOC-2007-GuruswamiR #integer
A 3-query PCP over integers (VG, PR), pp. 198–206.
Explicit capacity-achieving list-decodable codes (VG, AR), pp. 1–10.
Limits to list decoding Reed-Solomon codes (VG, AR), pp. 602–609.
ICALP-2004-GuruswamiI #linear
Linear-Time List Decoding in Error-Free Settings: (VG, PI), pp. 695–707.
STOC-2004-Guruswami #question
Better extractors for better codes? (VG), pp. 436–444.
STOC-2003-DinurGKR #multi
A new multilayered PCP and the hardness of hypergraph vertex cover (ID, VG, SK, OR), pp. 595–601.
STOC-2003-GuruswamiI #linear
Linear time encodable and list decodable codes (VG, PI), pp. 126–135.
STOC-2002-Guruswami #linear
Limits to list decodability of linear codes (VG), pp. 802–811.
STOC-2002-GuruswamiI #linear
Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets (VG, PI), pp. 812–821.
STOC-2000-CharikarFGKRS #query
Query strategies for priced information (MC, RF, VG, JMK, PR, AS), pp. 582–591.
STOC-2000-GuruswamiS #algorithm
List decoding algorithms for certain concatenated codes (VG, MS), pp. 181–190.
STOC-1999-GuruswamiKRSY #algorithm #approximate #problem
Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint Paths and Related Problems (VG, SK, RR, FBS, MY), pp. 19–28.

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.