Vijay Vazirani

Citata da

	Tutte	Dal 2020
Citazioni	31265	8090
Indice H	58	31
i10-index	134	71

1700

850

425

1275

1988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202586 94 111 117 117 153 176 205 166 183 205 196 215 331 299 446 573 718 798 921 1021 1162 1297 1363 1431 1399 1439 1370 1423 1373 1622 1531 1483 1601 1556 1464 1599 380

Accesso pubblico

Visualizza tutto

19 articoli

2 articoli

Disponibili

Non disponibili

In base ai mandati di finanziamento

Coautori

Mihalis YannakakisPercy K. and Vida L. W. Hudson Professor of Computer Science, Columbia UniversityEmail verificata su cs.columbia.edu
Aranyak MehtaGoogle ResearchEmail verificata su google.com
nikhil r. devanurAmazonEmail verificata su nikhildevanur.com
Amin SaberiProfessor, Stanford UniversityEmail verificata su stanford.edu
Naveen GargComputer Science and Engineering, IIT DelhiEmail verificata su cse.iitd.ac.in
Tung MaiAdobe ResearchEmail verificata su adobe.com
Ruta MehtaDept. of Computer Science, University of Illinois at Urbana-ChampaignEmail verificata su cs.illinois.edu
Jugal GargAssociate Professor, University of Illinois at Urbana-ChampaignEmail verificata su illinois.edu
Sadra YazdanbodGoogleEmail verificata su google.com
samir khullerBarris Professor and Chair of Computer Science, Northwestern UniversityEmail verificata su northwestern.edu
Nick FeamsterNeubauer Professor of Computer Science, University of ChicagoEmail verificata su uchicago.edu
Deeparnab ChakrabartyDartmouth CollegeEmail verificata su dartmouth.edu
Ion MandoiuUniversity of ConnecticutEmail verificata su engr.uconn.edu
Ramesh JohariProfessor, Management Science and Engineering, Stanford UniversityEmail verificata su stanford.edu
Mohammad MahdianResearch Scientist, GoogleEmail verificata su alum.mit.edu
Evangelos MarkakisAthens University of Economics and BusinessEmail verificata su aueb.gr
Christos H PAPADIMITRIOUColumbia UniversityEmail verificata su columbia.edu
Valas ValanciusGeorgia TechEmail verificata su gatech.edu
Nima AnariStanford UniversityEmail verificata su cs.stanford.edu
Adam Paul ArkinDepartment of Bioengineering, University of California, Berkeley, Physical Biosciences Division, E.OEmail verificata su lbl.gov

Segui

Vijay Vazirani

Distinguished Professor, Dept. of Computer Science, University of California, Irvine.

Email verificata su ics.uci.edu - Home page

Algorithms Complexity Theory Theory of Computing


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
Approximation algorithms VV Vazirani springer, 2001	6243	2001
Algorithmic game theory T Roughgarden Communications of the ACM 53 (7), 78-86, 2010	5665	2010
An O (v\| v\| c\| E\|) algoithm for finding maximum matching in general graphs S Micali, VV Vazirani 21st Annual symposium on foundations of computer science (Sfcs 1980), 17-27, 1980	1470	1980
Random generation of combinatorial structures from a uniform distribution MR Jerrum, LG Valiant, VV Vazirani Theoretical computer science 43, 169-188, 1986	1372	1986
Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation K Jain, VV Vazirani Journal of the ACM (JACM) 48 (2), 274-296, 2001	1365*	2001
Adwords and generalized online matching A Mehta, A Saberi, U Vazirani, V Vazirani Journal of the ACM (JACM) 54 (5), 22-es, 2007	1087	2007
An optimal algorithm for on-line bipartite matching RM Karp, UV Vazirani, VV Vazirani Proceedings of the twenty-second annual ACM symposium on Theory of computing …, 1990	1053	1990
Matching is as easy as matrix inversion K Mulmuley, UV Vazirani, VV Vazirani Proceedings of the nineteenth annual ACM symposium on Theory of computing …, 1987	992	1987
NP is as easy as detecting unique solutions LG Valiant, VV Vazirani Proceedings of the seventeenth annual ACM symposium on Theory of computing …, 1985	979	1985
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP K Jain, M Mahdian, E Markakis, A Saberi, VV Vazirani Journal of the ACM (JACM) 50 (6), 795-824, 2003	657*	2003
Approximate max-flow min-(multi) cut theorems and their applications N Garg, VV Vazirani, M Yannakakis SIAM Journal on Computing 25 (2), 235-251, 1996	577	1996
Primal-dual approximation algorithms for integral flow and multicut in trees N Garg, VV Vazirani, M Yannakakis Algorithmica 18, 3-20, 1997	559*	1997
Market equilibrium via a primal-dual-type algorithm NR Devanur, CH Papadimitriou, A Saberi, VV Vazirani The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002 …, 2002	460*	2002
Diversity in times of adversity: probabilistic strategies in microbial survival games DM Wolf, VV Vazirani, AP Arkin Journal of theoretical biology 234 (2), 227-253, 2005	369	2005
Finding k cuts within twice the optimal H Saran, VV Vazirani SIAM Journal on Computing 24 (1), 101-108, 1995	338	1995
Multiway cuts in directed and node weighted graphs N Garg, VV Vazirani, M Yannakakis International Colloquium on Automata, Languages, and Programming, 487-498, 1994	303*	1994
A primal-dual approximation algorithm for generalized Steiner network problems DP Williamson, MX Goemans, M Mihail, VV Vazirani Proceedings of the twenty-fifth annual ACM symposium on Theory of computing …, 1993	265	1993
NP-completeness of some generalizations of the maximum matching problem LJ Stockmeyer, VV Vazirani Information Processing Letters 15 (1), 14-19, 1982	264	1982
Efficient and secure pseudo-random number generation UV Vazirani, VV Vazirani Workshop on the Theory and Application of Cryptographic Techniques, 193-202, 1984	249	1984
A graph theoretic approach to software watermarking R Venkatesan, V Vazirani, S Sinha Information Hiding: 4th International Workshop, IH 2001 Pittsburgh, PA, USA …, 2001	246	2001

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Segui

Citata da

Coautori