Venkatesan Guruswami

Citado por

	Todos	Desde 2019
Citações	14749	6117
Índice h	61	41
Índice i10	204	148

1200

600

300

900

200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202451 106 138 199 251 310 336 386 427 460 530 472 514 564 706 689 582 775 849 849 936 1062 1073 1063 1113

Acesso público

Ver todos

86 artigos

4 artigos

disponível

não disponível

Com base nas autorizações de financiamento

Coautores

Madhu SudanGordon McKay Professor of Computer Science, Harvard UniversityE-mail confirmado em cs.harvard.edu
Atri RudraKatherine Johnson Chair in AI, Professor, CSE, University at BuffaloE-mail confirmado em buffalo.edu
Joshua BrakensiekUniversity of California, BerkeleyE-mail confirmado em berkeley.edu
Chaoping XINGShanghai Jiaotong UniversityE-mail confirmado em sjtu.edu.cn
Moses CharikarProfessor of Computer Science, Stanford UniversityE-mail confirmado em cs.stanford.edu
Euiwoong LeeUniversity of MichiganE-mail confirmado em umich.edu
Piotr IndykProfessor of Electrical Engineering and Computer Science, MITE-mail confirmado em mit.edu
Johan HåstadProfessor i teoretisk datalogi, KTHE-mail confirmado em kth.se
Ali Kemal SinopGoogle ResearchE-mail confirmado em google.com
Mahdi CheraghchiAssociate Professor of Computer Science and Engineering, University of Michigan, Ann ArborE-mail confirmado em umich.edu
Ray LiUC BerkeleyE-mail confirmado em berkeley.edu
C.Pandu RanganProfessor, Department of Computer Science and Engg, IIT-Madras, India.E-mail confirmado em cse.iitm.ac.in
Mary WoottersStanford UniversityE-mail confirmado em stanford.edu
Sanjeev KhannaHenry Salvatori Professor of Computer Science, University of PennsylvaniaE-mail confirmado em cis.upenn.edu
Salil VadhanVicky Joseph Professor of Computer Science and Applied Mathematics, Harvard UniversityE-mail confirmado em g.harvard.edu
Amit SahaiSymantec Chair Professor of Computer Science; Professor of Mathematics (by courtesy), UCLAE-mail confirmado em cs.ucla.edu
Vijay BhattiproluPrinceton/IASE-mail confirmado em math.ias.edu
Sai SandeepPostdoc at UC BerkeleyE-mail confirmado em berkeley.edu
Jonathan MosheiffAssistant Professor, Ben-Gurion UniversityE-mail confirmado em bgu.ac.il
Omar AlrabiahUniversity of California, BerkeleyE-mail confirmado em berkeley.edu

Seguir

Venkatesan Guruswami

University of California, Berkeley

E-mail confirmado em berkeley.edu - Página inicial

Computational complexity theory Algorithms Coding Theory Algebra and computation


Título Ordenar por citações Ordenar por ano Ordenar por título	Citado por Citado por	Ano
Improved decoding of Reed-Solomon and algebraic-geometric codes V Guruswami, M Sudan Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat …, 1998	1634	1998
Clustering with qualitative information M Charikar, V Guruswami, A Wirth Journal of Computer and System Sciences 71 (3), 360-383, 2005	580	2005
Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes V Guruswami, C Umans, S Vadhan Journal of the ACM (JACM) 56 (4), 1-34, 2009	493	2009
Copycatch: stopping group attacks by spotting lockstep behavior in social networks A Beutel, W Xu, V Guruswami, C Palow, C Faloutsos Proceedings of the 22nd international conference on World Wide Web, 119-130, 2013	458	2013
On profit-maximizing envy-free pricing. V Guruswami, JD Hartline, AR Karlin, D Kempe, C Kenyon, F McSherry SODA 5, 1164-1173, 2005	418	2005
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems V Guruswami, S Khanna, R Rajaraman, B Shepherd, M Yannakakis Proceedings of the thirty-first Annual ACM Symposium on Theory of Computing …, 1999	345	1999
List decoding of error-correcting codes: winning thesis of the 2002 ACM doctoral dissertation competition V Guruswami Springer Science & Business Media, 2004	343	2004
Explicit codes achieving list decoding capacity: Error-correction with optimal redundancy V Guruswami, A Rudra IEEE Transactions on information theory 54 (1), 135-150, 2008	243	2008
Correlation clustering with a fixed number of clusters I Giotis, V Guruswami arXiv preprint cs/0504023, 2005	238	2005
Multiclass learning, boosting, and error-correcting codes V Guruswami, A Sahai Proceedings of the twelfth annual conference on Computational learning …, 1999	220	1999
A new multilayered PCP and the hardness of hypergraph vertex cover I Dinur, V Guruswami, S Khot, O Regev Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003	217	2003
Repairing reed-solomon codes V Guruswami, M Wootters Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016	212	2016
Hardness of learning halfspaces with noise V Guruswami, P Raghavendra SIAM Journal on Computing 39 (2), 742-765, 2009	203	2009
Agnostic learning of monomials by halfspaces is hard V Feldman, V Guruswami, P Raghavendra, Y Wu SIAM Journal on Computing 41 (6), 1558-1590, 2012	179	2012
Efficient low-redundancy codes for correcting multiple deletions J Brakensiek, V Guruswami, S Zbarsky IEEE Transactions on Information Theory 64 (5), 3403-3410, 2017	173	2017
Maximum-likelihood decoding of Reed-Solomon codes is NP-hard V Guruswami, A Vardy IEEE Transactions on Information Theory 51 (7), 2249-2256, 2005	156	2005
Optimal column-based low-rank matrix reconstruction V Guruswami, AK Sinop Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012	150	2012
Expander-based constructions of efficiently decodable codes V Guruswami, P Indyk Proceedings 42nd IEEE Symposium on Foundations of Computer Science, 658-667, 2001	139	2001
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph A Bhaskara, M Charikar, V Guruswami, A Vijayaraghavan, Y Zhou Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012	137	2012
Non-malleable coding against bit-wise and split-state tampering M Cheraghchi, V Guruswami Journal of Cryptology 30, 191-241, 2017	135	2017

O sistema não pode executar a operação agora. Tente novamente mais tarde.

Artigos 1–20

Citações por ano

Citações duplicadas

Citações mescladas

Adicionar coautoresCoautores

Seguir

Citado por

Coautores