Venkatesan Guruswami

Navedeno

	Vse	Od leta 2020
Navedbe	15032	5519
indeks h	62	38
indeks i10	207	143

1300

650

325

975

2000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202553 106 137 195 260 312 340 387 430 465 535 477 515 559 708 693 578 779 849 850 935 1049 1065 1042 1212 206

Javni dostop

Prikaži vse

85 člankov

4 članki

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Madhu SudanGordon McKay Professor of Computer Science, Harvard UniversityPreverjeni e-poštni naslov na cs.harvard.edu
Atri RudraKatherine Johnson Chair in AI, Professor, CSE, University at BuffaloPreverjeni e-poštni naslov na buffalo.edu
Joshua BrakensiekUniversity of California, BerkeleyPreverjeni e-poštni naslov na berkeley.edu
Chaoping XINGShanghai Jiaotong UniversityPreverjeni e-poštni naslov na sjtu.edu.cn
Moses CharikarProfessor of Computer Science, Stanford UniversityPreverjeni e-poštni naslov na cs.stanford.edu
Euiwoong LeeUniversity of MichiganPreverjeni e-poštni naslov na umich.edu
Piotr IndykProfessor of Electrical Engineering and Computer Science, MITPreverjeni e-poštni naslov na mit.edu
Johan HåstadProfessor i teoretisk datalogi, KTHPreverjeni e-poštni naslov na kth.se
Ali Kemal SinopGoogle ResearchPreverjeni e-poštni naslov na google.com
Mahdi CheraghchiAssociate Professor of Computer Science and Engineering, University of Michigan, Ann ArborPreverjeni e-poštni naslov na umich.edu
C.Pandu RanganProfessor, Department of Computer Science and Engg, IIT-Madras, India.Preverjeni e-poštni naslov na cse.iitm.ac.in
Ray LiUC BerkeleyPreverjeni e-poštni naslov na berkeley.edu
Sanjeev KhannaHenry Salvatori Professor of Computer Science, University of PennsylvaniaPreverjeni e-poštni naslov na cis.upenn.edu
Salil VadhanVicky Joseph Professor of Computer Science and Applied Mathematics, Harvard UniversityPreverjeni e-poštni naslov na g.harvard.edu
Amit SahaiSymantec Chair Professor of Computer Science; Professor of Mathematics (by courtesy), UCLAPreverjeni e-poštni naslov na cs.ucla.edu
Mary WoottersStanford UniversityPreverjeni e-poštni naslov na stanford.edu
Vijay BhattiproluPrinceton/IASPreverjeni e-poštni naslov na math.ias.edu
Sai SandeepPostdoc at UC BerkeleyPreverjeni e-poštni naslov na berkeley.edu
Omar AlrabiahUniversity of California, BerkeleyPreverjeni e-poštni naslov na berkeley.edu
Yuan ZhouDepartment of ISE, University of Illinois Urbana-ChampaignPreverjeni e-poštni naslov na illinois.edu

Spremljaj

Venkatesan Guruswami

University of California, Berkeley

Preverjeni e-poštni naslov na berkeley.edu - Domača stran

Computational complexity theory Algorithms Coding Theory Algebra and computation


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
Improved decoding of Reed-Solomon and algebraic-geometric codes V Guruswami, M Sudan Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat …, 1998	1655	1998
Clustering with qualitative information M Charikar, V Guruswami, A Wirth Journal of Computer and System Sciences 71 (3), 360-383, 2005	591	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	500	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	473	2013
On profit-maximizing envy-free pricing. V Guruswami, JD Hartline, AR Karlin, D Kempe, C Kenyon, F McSherry SODA 5, 1164-1173, 2005	420	2005
List decoding of error-correcting codes: winning thesis of the 2002 ACM doctoral dissertation competition V Guruswami Springer Science & Business Media, 2004	351	2004
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	344	1999
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	249	2008
Correlation clustering with a fixed number of clusters I Giotis, V Guruswami arXiv preprint cs/0504023, 2005	242	2005
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	224	2003
Multiclass learning, boosting, and error-correcting codes V Guruswami, A Sahai Proceedings of the twelfth annual conference on Computational learning …, 1999	224	1999
Repairing reed-solomon codes V Guruswami, M Wootters Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016	217	2016
Hardness of learning halfspaces with noise V Guruswami, P Raghavendra SIAM Journal on Computing 39 (2), 742-765, 2009	210	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	183	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	179	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	157	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
Non-malleable coding against bit-wise and split-state tampering M Cheraghchi, V Guruswami Journal of Cryptology 30, 191-241, 2017	139	2017
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	139	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

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji