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="Guruswami, Venkatesan"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Optimal rate algebraic list decoding using narrow ray class fields
Venkatesan Guruswami
,
Chaoping Xing
Journal of Combinatorial Theory Series A
129
, 2015, pp. 160-183
Restricted isometry of Fourier matrices and list decodability of random linear codes
Mahdi Cheraghchi
,
Venkatesan Guruswami
,
Ameya Velingker
SIAM Journal on Computing
42
(5), 2013, pp. 1888-1914
List decoding Reed-Solomon, algebraic-geometric, and Gabidulin subcodes up to the singleton bound
Venkatesan Guruswami
,
Chaoping Xing
Proceedings of the 45th ACM Symposium on Theory of Computing, STOC'2013 (Palo Alto, California, USA, June 1-4, 2013)
, 2013, pp. 843-852
Polar codes: Reliable communication with complexity polynomial in the gap to Shannon capacity
Venkatesan Guruswami
Leibniz International Proceedings in Informatics (LIPIcs)
24
, 2013, pp. 1-1
Agnostic learning of monomials by halfspaces is hard
Vitaly Feldman
,
Venkatesan Guruswami
,
Prasad Raghavendra
,
Yi Wu
SIAM Journal on Computing
41
(6), 2012, pp. 1558-1590
Folded codes from function field towers and improved optimal rate list decoding
Venkatesan Guruswami
,
Chaoping Xing
Proceedings of the 44th ACM Symposium on Theory of Computing, STOC'2012 (New York, NY, USA, May 19-22, 2012)
, 2012, pp. 339-350
The query complexity of estimating weighted averages
Amit Chakrabarti
,
Venkatesan Guruswami
,
Andrew Wirth
,
Anthony Wirth
Acta Informatica
48
(7-8), 2011, pp. 417-426
List decoding tensor products and interleaved codes
Parikshit Gopalan
,
Venkatesan Guruswami
,
Prasad Raghavendra
SIAM Journal on Computing
40
(5), 2011, pp. 1432-1462
Hardness amplification within
NP
against deterministic algorithms
Parikshit Gopalan
,
Venkatesan Guruswami
Journal of Computer and System Sciences
77
(1), 2011, pp. 107-121
Beating the random ordering is hard: Every ordering CSP is approximation resistant
Venkatesan Guruswami
,
Johan Håstad
,
Rajsekar Manokaran
,
Prasad Raghavendra
,
Moses Charikar
SIAM Journal on Computing
40
(3), 2011, pp. 878-914
Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
Matthew Andrews
,
Julia Chuzhoy
,
Venkatesan Guruswami
,
Sanjeev Khanna
,
Kunal Talwar
,
Lisa Zhang
Combinatorica
30
(5), 2010, pp. 485-520
Locally testable codes require redundant testers
Eli Ben-Sasson
,
Venkatesan Guruswami
,
Tali Kaufman
,
Madhu Sudan
,
Michael Viderman
SIAM Journal on Computing
39
(7), 2010, pp. 3230-3247
On the list-decodability of random linear codes
Venkatesan Guruswami
,
Johan Håstad
,
Swastik Kopparty
Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC'2010 (Cambridge, Massachusetts, June 5-8, 2010)
, 2010, pp. 409-416
SDP gaps for 2-to-1 and other Label-Cover variants
Venkatesan Guruswami
,
Subhash Khot
,
Ryan O'Donnell
,
Preyas Popat
,
Madhur Tulsiani
,
Yi Wu
Lecture Notes in Computer Science
6198
, 2010, pp. 617-628
Almost Euclidean subspaces of
\ell_{1}^{N}
via expander codes
Venkatesan Guruswami
,
James R. Lee
,
Alexander Razborov
Combinatorica
30
(1), 2010, pp. 47-68
On the inapproximability of vertex cover on
k
-partite
k
-uniform hypergraphs
Venkatesan Guruswami
,
Rishi Saket
Lecture Notes in Computer Science
6198
, 2010, pp. 360-371
MaxMin allocation via degree lower-bounded arborescences
MohammadHossein Bateni
,
Moses Charikar
,
Venkatesan Guruswami
Proceedings of the 41st International ACM Symposium on Theory of Computing, STOC'2009 (Bethesda, Maryland, USA, May 31 - June 2, 2009)
, 2009, pp. 543-552
List decoding tensor products and interleaved codes
Parikshit Gopalan
,
Venkatesan Guruswami
,
Prasad Raghavendra
Proceedings of the 41st International ACM Symposium on Theory of Computing, STOC'2009 (Bethesda, Maryland, USA, May 31 - June 2, 2009)
, 2009, pp. 13-22
Hardness of learning halfspaces with noise
Venkatesan Guruswami
,
Prasad Raghavendra
SIAM Journal on Computing
39
(2), 2009, pp. 742-765
Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes
Venkatesan Guruswami
,
Christopher Umans
,
Salil Vadhan
Journal of the ACM
56
(4), 2009, pp. 20: 1-34
Artin automorphisms, cyclotomic function fields, and folded list-decodable codes
Venkatesan Guruswami
Proceedings of the 41st International ACM Symposium on Theory of Computing, STOC'2009 (Bethesda, Maryland, USA, May 31 - June 2, 2009)
, 2009, pp. 23-32
Algorithms for modular counting of roots of multivariate polynomials
Parikshit Gopalan
,
Venkatesan Guruswami
,
Richard J. Lipton
Algorithmica
50
(4), 2008, pp. 479-496
Hardness of routing with congestion in directed graphs
Julia Chuzhoy
,
Venkatesan Guruswami
,
Sanjeev Khanna
,
Kunal Talwar
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007)
, 2007, pp. 165-178
A 3-query PCP over integers
Venkatesan Guruswami
,
Prasad Raghavendra
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007)
, 2007, pp. 198-206
List decoding and pseudorandom constructions
Venkatesan Guruswami
Lecture Notes in Computer Science
4851
, 2007, pp. 1-6
Seiten 1
2
3
>