Uri Zwick

Sitert av

	Alle	Siden 2020
Sitater	13767	3657
h-indeks	54	29
i10-indeks	112	67

760

380

190

570

199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202534 45 58 76 77 117 145 199 173 321 404 369 450 485 515 554 531 673 611 712 590 654 698 685 659 631 705 698 753 696 172

Offentlig tilgang

Vis alle

18 artikler

0 artikler

tilgjengelige

ikke tilgjengelige

Basert på finansieringsmandater

Medforfattere

Haim KaplanSchool of Computer Science, Tel Aviv UniversityVerifisert e-postadresse på post.tau.ac.il
Mikkel ThorupUniversity of CopenhagenVerifisert e-postadresse på diku.dk
Raphael YusterUniversity of HaifaVerifisert e-postadresse på math.haifa.ac.il
Mike PatersonEmeritus Professor of Computer Science, University of WarwickVerifisert e-postadresse på warwick.ac.uk
Liam RodittyBar Ilan UniversityVerifisert e-postadresse på biu.ac.il
Noga AlonPrinceton University and Tel Aviv UniversityVerifisert e-postadresse på tau.ac.il
Edith CohenGoogle, Tel Aviv UniversityVerifisert e-postadresse på alumni.stanford.edu
Eran HalperinUniversity of California, Los AngelesVerifisert e-postadresse på cs.ucla.edu
Thomas Dueholm HansenFormer Associate professor, University of CopenhagenVerifisert e-postadresse på di.ku.dk
Robert TarjanProfessor of Computer Science, Princeton UniversityVerifisert e-postadresse på cs.princeton.edu
Or ZamirTel Aviv UniversityVerifisert e-postadresse på tauex.tau.ac.il
Oliver FriedmannUniversity of MunichVerifisert e-postadresse på ifi.lmu.de
Virginia Vassilevska WilliamsMITVerifisert e-postadresse på mit.edu
Stephen AlstrupUniversity of Copenhagen (in start-ups on/off since 2003 )Verifisert e-postadresse på di.ku.dk
Marcin JurdzińskiUniversity of Warwick, Department of Computer ScienceVerifisert e-postadresse på warwick.ac.uk
Roded SharanTel Aviv UniversityVerifisert e-postadresse på post.tau.ac.il
Nicholas PippengerEmeritus Professor of Mathematics, Harvey Mudd CollegeVerifisert e-postadresse på math.hmc.edu
Peter Bro MiltersenFormer Professor of Computer Science at Aarhus UniversityVerifisert e-postadresse på cs.au.dk
Yuval PeresBeijing Institute of Mathematical Sciences and Applications (BIMSA)Verifisert e-postadresse på yuvalperes.com
László KozmaFreie Universität Berlin, Department of Mathematics and Computer ScienceVerifisert e-postadresse på cs.uni-saarland.de

Følg

Uri Zwick

Tel Aviv University

Verifisert e-postadresse på tau.ac.il


Tittel Sorter etter sitater Sorter etter år Sorter etter tittel	Sitert av Sitert av	År
Color-coding N Alon, R Yuster, U Zwick Journal of the ACM (JACM) 42 (4), 844-856, 1995	1365	1995
Approximate distance oracles M Thorup, U Zwick Journal of the ACM (JACM) 52 (1), 1-24, 2005	964	2005
Reachability and distance queries via 2-hop labels E Cohen, E Halperin, H Kaplan, U Zwick SIAM Journal on Computing 32 (5), 1338-1355, 2003	888	2003
Finding and counting given length cycles N Alon, R Yuster, U Zwick Algorithmica 17 (3), 209-223, 1997	735	1997
Compact routing schemes M Thorup, U Zwick Proceedings of the thirteenth annual ACM symposium on Parallel algorithms …, 2001	708	2001
The complexity of mean payoff games on graphs U Zwick, M Paterson Theoretical Computer Science 158, 1-2, 1995	684	1995
All pairs shortest paths using bridging sets and rectangular matrix multiplication U Zwick Journal of the ACM (JACM) 49 (3), 289-317, 2002	417	2002
Fast sparse matrix multiplication R Yuster, U Zwick ACM Transactions On Algorithms (TALG) 1 (1), 2-13, 2005	368	2005
All-pairs almost shortest paths D Dor, S Halperin, U Zwick SIAM Journal on Computing 29 (5), 1740-1759, 2000	349	2000
A deterministic subexponential algorithm for solving parity games M Jurdziński, M Paterson, U Zwick SIAM Journal on Computing 38 (4), 1519-1532, 2008	307	2008
A 7/8-approximation algorithm for MAX 3SAT? H Karloff, U Zwick Proceedings 38th Annual Symposium on Foundations of Computer Science, 406-415, 1997	297	1997
Exact and approximate distances in graphs—a survey U Zwick European Symposium on Algorithms, 33-48, 2001	263	2001
Improved rounding techniques for the MAX 2-SAT and MAX DI-CUT problems M Lewin, D Livnat, U Zwick International Conference on Integer Programming and Combinatorial …, 2002	191	2002
All pairs shortest paths in undirected graphs with integer weights A Shoshan, U Zwick 40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039 …, 1999	186	1999
Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems U Zwick Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999	186	1999
Approximation Algorithms for Constraint Satisfaction Problems Involving at Most Three Variables per Constraint. U Zwick SODA 98, 201-210, 1998	184	1998
Deterministic constructions of approximate distance oracles and spanners L Roditty, M Thorup, U Zwick International Colloquium on Automata, Languages, and Programming, 261-272, 2005	183	2005
A fully dynamic reachability algorithm for directed graphs with an almost linear update time L Roditty, U Zwick Proceedings of the thirty-sixth annual ACM symposium on Theory of computing …, 2004	182	2004
Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor TD Hansen, PB Miltersen, U Zwick Journal of the ACM (JACM) 60 (1), 1-16, 2013	179	2013
On dynamic shortest paths problems L Roditty, U Zwick Algorithms–ESA 2004: 12th Annual European Symposium, Bergen, Norway …, 2004	162	2004

Systemet kan ikke utføre handlingen. Prøv på nytt senere.

Artikler 1–20

Sitater per år

Duplikatsitater

Sammenslåtte sitater

Legg til medforfattereMedforfattere

Følg

Sitert av

Medforfattere