×
Author ID: zwick.uri Recent zbMATH articles by "Zwick, Uri"
Published as: Zwick, Uri; Zwick, U.
all top 5

Co-Authors

15 single-authored
20 Kaplan, Haim
19 Thorup, Mikkel
15 Paterson, Mike S.
11 Halperin, Eran
11 Hansen, Thomas Dueholm
11 Roditty, Liam
10 Yuster, Raphael
8 Cohen, Edith
7 Dor, Dorit
6 Alon, Noga
6 Tarjan, Robert Endre
5 Zamir, Or
4 Alstrup, Stephen
4 Avidor, Adi
4 Halperin, Shay
3 Dorfman, Dani
3 Dubiner, Moshe
3 Livnat, Dror
3 Mendelson, Ran
3 Peres, Yuval
3 Sudakov, Benny
2 Armon, Amitai
2 Chockler, Hana
2 Fischer, Orr
2 Friedmann, Oliver
2 Gørtz, Inge Li
2 Hirata, Tomio
2 Jurdziński, Marcin
2 Kozma, Laszlo
2 Madani, Omid
2 Nathaniel, Ram
2 Ono, Takao
2 Oshman, Rotem
2 Rauhe, Theis
2 Shalita, Alon
2 Shapira, Asaf
2 Ta-Shma, Amnon
2 Vassilevska Williams, Virginia
2 Winkler, Peter M.
2 Xie, Xuzhen
2 Yagiura, Mutsunori
1 Bafna, Vineet
1 Ben-Amram, Amir M.
1 Berkovitch, Ido
1 Björklund, Andreas
1 Brakensiek, Joshua
1 Bro Miltersen, Peter
1 Chechik, Shiri
1 Cole, Richard John
1 Di Battista, Giuseppe
1 Díaz, Josep
1 Elberfeld, Michael
1 Epstein, David Bernard Alper
1 Gamzu, Iftah
1 Goldberg, Tal
1 Hariharan, Ramesh
1 Håstad, Johan Torkel
1 Huang, Neng
1 Iano-Fletcher, Anthony R.
1 Jansen, Klaus
1 Julstrom, Bryant A.
1 Kadria, Avi
1 Levy, Hanoch
1 Lewin, Michael
1 Medvedovsky, Alexander
1 Naor, Zohar
1 Nayak, Ashwin
1 Pagh, Rasmus
1 Pettie, Seth
1 Pippenger, Nicholas J.
1 Potechin, Aaron Henry
1 Roditty, Iam
1 Rote, Günter
1 Segev, Danny
1 Sharan, Roded
1 Sidford, Aaron
1 Silverbush, Dana
1 Sinclair, Alistair
1 Sotnikov, Dmitry
1 Tassa, Shlomit
1 Ulfberg, Staffan
1 Wilson, David Bruce
1 Yuster, Raphy

Publications by Year

Citations contained in zbMATH Open

120 Publications have been cited 2,159 times in 1,527 Documents Cited by Year
Color-coding. Zbl 0885.68116
Alon, Noga; Yuster, Raphael; Zwick, Uri
317
1995
Approximate distance oracles. Zbl 1175.68303
Thorup, Mikkel; Zwick, Uri
220
2005
The complexity of mean payoff games on graphs. Zbl 0871.68138
Zwick, Uri; Paterson, Mike
184
1996
Deterministic constructions of approximate distance oracles and spanners. Zbl 1082.68087
Roditty, Liam; Thorup, Mikkel; Zwick, Uri
142
2005
Finding and counting given length cycles. Zbl 0865.68093
Alon, N.; Yuster, R.; Zwick, U.
109
1997
All pairs shortest paths using bridging sets and rectangular matrix multiplication. Zbl 1326.05157
Zwick, Uri
70
2002
All-pairs almost shortest paths. Zbl 0948.05047
Dor, Dorit; Halperin, Shay; Zwick, Uri
62
2000
Spanners and emulators with sublinear distance errors. Zbl 1192.05041
Thorup, Mikkel; Zwick, Uri
35
2006
Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to max cut and other problems. Zbl 1345.90064
Zwick, Uri
34
1999
Exact and approximate distances in graphs – a survey. Zbl 1006.68543
Zwick, Uri
33
2001
Improved rounding techniques for the MAX 2-SAT and MAX DI-CUT problems. Zbl 1049.90535
Lewin, Michael; Livnat, Dror; Zwick, Uri
33
2002
A deterministic subexponential algorithm for solving parity games. Zbl 1192.91013
Jurdziński, Marcin; Paterson, Mike; Zwick, Uri
33
2006
A deterministic subexponential algorithm for solving parity games. Zbl 1173.91326
Jurdziński, Marcin; Paterson, Mike; Zwick, Uri
32
2008
Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences. Zbl 1333.68216
Ta-Shma, Amnon; Zwick, Uri
30
2014
Subexponential lower bounds for randomized pivoting rules for the simplex algorithm. Zbl 1288.68090
Friedmann, Oliver; Hansen, Thomas Dueholm; Zwick, Uri
28
2011
Finding even cycles even faster. Zbl 0867.05065
Yuster, Raphael; Zwick, Uri
25
1997
A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems. Zbl 1017.68089
Halperin, Eran; Zwick, Uri
24
2002
Approximate distance oracles. Zbl 1323.05126
Thorup, Mikkel; Zwick, Uri
24
2001
Dynamic approximate all-pairs shortest paths in undirected graphs. Zbl 1247.68340
Roditty, Liam; Zwick, Uri
23
2012
Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint. Zbl 0930.68142
Zwick, Uri
22
1998
Improved dynamic reachability algorithms for directed graphs. Zbl 1225.68276
Roditty, Liam; Zwick, Uri
21
2008
Listing triangles. Zbl 1410.05191
Björklund, Andreas; Pagh, Rasmus; Williams, Virginia Vassilevska; Zwick, Uri
21
2014
Reachability and distance queries via 2-hop labels. Zbl 1026.68165
Cohen, Edith; Halperin, Eran; Kaplan, Haim; Zwick, Uri
20
2003
On dynamic shortest paths problems. Zbl 1111.68599
Roditty, Liam; Zwick, Uri
20
2004
Shrinkage of De Morgan formulae under restriction. Zbl 0771.68067
Paterson, Michael S.; Zwick, Uri
19
1993
Fast sparse matrix multiplication. Zbl 1321.65073
Yuster, Raphael; Zwick, Uri
18
2005
Selecting the median. Zbl 0933.68062
Dor, Dorit; Zwick, Uri
18
1999
Deterministic rendezvous, treasure hunts and strongly universal exploration sequences. Zbl 1302.68220
Ta-Shma, Amnon; Zwick, Uri
18
2007
Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor. Zbl 1281.91019
Hansen, Thomas Dueholm; Miltersen, Peter Bro; Zwick, Uri
18
2013
On dynamic shortest paths problems. Zbl 1244.68091
Roditty, Liam; Zwick, Uri
18
2011
All-pairs small-stretch paths. Zbl 0974.68150
Cohen, Edith; Zwick, Uri
16
2001
Multicriteria global minimum cuts. Zbl 1100.90043
Armon, Amitai; Zwick, Uri
15
2006
Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs (extended abstract). Zbl 1344.68092
Alon, Noga; Yuster, Raphy; Zwick, Uri
14
1994
Improved approximation algorithms for MAX NAE-SAT and MAX SAT. Zbl 1125.68426
Avidor, Adi; Berkovitch, Ido; Zwick, Uri
14
2006
Optimal carry save networks. Zbl 0770.94010
Paterson, Michael S.; Pippenger, Nicholas; Zwick, Uri
12
1992
An improved version of the random-facet pivoting rule for the simplex algorithm. Zbl 1321.90080
Hansen, Thomas Dueholm; Zwick, Uri
12
2015
Adjacency labeling schemes and induced-universal graphs. Zbl 1321.05226
Alstrup, Stephen; Kaplan, Haim; Thorup, Mikkel; Zwick, Uri
12
2015
Roundtrip spanners and roundtrip routing in directed graphs. Zbl 1093.68627
Roditty, Liam; Thorup, Mikkel; Zwick, Uri
12
2002
Growth functions and automatic groups. Zbl 0892.20022
Epstein, David B. A.; Iano-Fletcher, Anthony R.; Zwick, Uri
12
1996
A fully dynamic reachability algorithm for directed graphs with an almost linear update time. Zbl 1192.90238
Roditty, Liam; Zwick, Uri
12
2004
Approximating MIN 2-SAT and MIN 3-SAT. Zbl 1101.68603
Avidor, Adi; Zwick, Uri
11
2005
Combinatorial approximation algorithms for the maximum directed cut problem. Zbl 1018.90039
Halperin, Eran; Zwick, Uri
11
2001
A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths. Zbl 1116.68564
Zwick, Uri
11
2004
A 4n lower bound on the combinational complexity of certain symmetric Boolean functions over the basis of unate dyadic Boolean functions. Zbl 0734.68041
Zwick, Uri
11
1991
Median selection requires \((2+\varepsilon)n\) comparisons. Zbl 0977.68041
Dor, Dorit; Zwick, Uri
10
2001
Coloring \(k\)-colorable graphs using relatively small palettes. Zbl 1030.68067
Halperin, Eran; Nathaniel, Ram; Zwick, Uri
10
2002
SOKOBAN and other motion planning problems. Zbl 0948.68205
Dor, Dorit; Zwick, Uri
10
1999
Maximum matching in graphs with an excluded minor. Zbl 1302.05198
Yuster, Raphael; Zwick, Uri
10
2007
Reachability and distance queries via 2-hop labels. Zbl 1093.68575
Cohen, Edith; Halperin, Eran; Kaplan, Haim; Zwick, Uri
9
2002
Roundtrip spanners and roundtrip routing in directed graphs. Zbl 1420.68159
Roditty, Iam; Thorup, Mikkel; Zwick, Uri
9
2008
Replacement paths and \(k\) simple shortest paths in unweighted directed graphs. Zbl 1082.68594
Roditty, Liam; Zwick, Uri
9
2005
Replacement paths and \(k\) simple shortest paths in unweighted directed graphs. Zbl 1295.05237
Roditty, Liam; Zwick, Uri
9
2012
Computer assisted proof of optimal approximability results. Zbl 1093.68640
Zwick, Uri
8
2002
Improved upper bounds for random-edge and random-jump on abstract cubes. Zbl 1421.68084
Hansen, Thomas Dueholm; Paterson, Mike; Zwick, Uri
8
2014
Finding the \(\alpha n\)-th largest element. Zbl 0847.68048
Dor, Dorit; Zwick, Uri
8
1996
All-pairs bottleneck paths in vertex weighted graphs. Zbl 1302.05196
Shapira, Asaf; Yuster, Raphael; Zwick, Uri
8
2007
A subexponential lower bound for the random facet algorithm for parity games. Zbl 1377.68091
Friedmann, Oliver; Hansen, Thomas Dueholm; Zwick, Uri
8
2011
Maximum overhang. Zbl 1229.00005
Paterson, Mike; Peres, Yuval; Thorup, Mikkel; Winkler, Peter; Zwick, Uri
8
2009
Detecting short directed cycles using rectangular matrix multiplication and dynamic programming. Zbl 1318.05084
Yuster, Raphael; Zwick, Uri
8
2004
Finding almost-satisfying assignments. Zbl 1028.68066
Zwick, Uri
7
1998
Selecting the median. Zbl 0853.68082
Dor, Dorit; Zwick, Uri
7
1995
Adjacency labeling schemes and induced-universal graphs. Zbl 1403.05123
Alstrup, Stephen; Kaplan, Haim; Thorup, Mikkel; Zwick, Uri
7
2019
On lower bounds for selecting the median. Zbl 0977.68042
Dor, Dorit; Håstad, Johan; Ulfberg, Staffan; Zwick, Uri
7
2001
Shallow circuits and concise formulae for multiple addition and multiplication. Zbl 0801.68092
Paterson, Michael; Zwick, Uri
6
1993
All-pairs bottleneck paths in vertex weighted graphs. Zbl 1211.05168
Shapira, Asaf; Yuster, Raphael; Zwick, Uri
6
2011
All-pairs shortest paths in \(O(n^2)\) time with high probability. Zbl 1281.05126
Peres, Yuval; Sotnikov, Dmitry; Sudakov, Benny; Zwick, Uri
6
2013
A faster deterministic exponential time algorithm for energy games and mean payoff games. Zbl 1522.91066
Dorfman, Dani; Kaplan, Haim; Zwick, Uri
5
2019
The smallest networks on which the Ford-Fulkerson maximum flow procedure may fail to terminate. Zbl 0873.68159
Zwick, Uri
5
1995
Faster \(k\)-SAT algorithms using biased-PPSZ. Zbl 1433.68602
Hansen, Thomas Dueholm; Kaplan, Haim; Zamir, Or; Zwick, Uri
5
2019
Approximating MIN \(k\)-SAT. Zbl 1019.68816
Avidor, Adi; Zwick, Uri
5
2002
Fast sparse matrix multiplication. Zbl 1111.65301
Yuster, Raphael; Zwick, Uri
5
2004
A fully dynamic reachability algorithm for directed graphs with an almost linear update time. Zbl 1342.05187
Roditty, Liam; Zwick, Uri
4
2016
MAX CUT in cubic graphs. Zbl 1089.68077
Halperin, Eran; Livnat, Dror; Zwick, Uri
4
2004
Tighter lower bounds on the exact complexity of string matching. Zbl 0828.68100
Cole, Richard; Hariharan, Ramesh; Paterson, Mike; Zwick, Uri
4
1995
Optimal randomized EREW PRAM algorithms for finding spanning forests and for other basic graph connectivity problems. Zbl 0847.68077
Halperin, Shay; Zwick, Uri
4
1996
Amplification and percolation. Zbl 1115.94309
Dubiner, Moshe; Zwick, Uri
4
1992
A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems. Zbl 0989.90126
Halperin, Eran; Zwick, Uri
4
2001
A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths. Zbl 1101.68071
Zwick, Uri
4
2006
Overhang. Zbl 1168.40001
Paterson, Mike; Zwick, Uri
4
2009
An optimal randomised logarithmic time connectivity algorithm for the EREW PRAM. Zbl 0870.68113
Halperin, Shay; Zwick, Uri
3
1996
How do read-once formulae shrink? Zbl 0815.06013
Dubiner, Moshe; Zwick, Uri
3
1994
Finding even cycles even faster. Zbl 1422.05098
Yuster, Raphael; Zwick, Uri
3
1994
All pairs lightest shortest paths. Zbl 1345.05106
Zwick, Uri
3
1999
Connection caching. Zbl 1345.68013
Cohen, Edith; Kaplan, Haim; Zwick, Uri
3
1999
Approximation algorithms for MAX-4-SAT and rounding procedures for semidefinite programs. Zbl 0999.90026
Halperin, Eran; Zwick, Uri
3
2001
Optimal randomized EREW PRAM algorithms for finding spanning forests. Zbl 0974.68147
Halperin, Shay; Zwick, Uri
3
2001
Spatial codes and the hardness of string folding problems. (Extended abstract). Zbl 0929.68128
Nayak, Ashwin; Sinclair, Alistair; Zwick, Uri
3
1998
Union-find with constant time deletions. Zbl 1084.68026
Alstrup, Stephen; Gørtz, Inge Li; Rauhe, Theis; Thorup, Mikkel; Zwick, Uri
3
2005
Amplification by read-once formulas. Zbl 0868.94059
Dubiner, Moshe; Zwick, Uri
3
1997
Lower bounds for Howard’s algorithm for finding minimum mean-cost cycles. Zbl 1311.90171
Hansen, Thomas Dueholm; Zwick, Uri
3
2010
On the approximability of reachability-preserving network orientations. Zbl 1245.68105
Elberfeld, Michael; Bafna, Vineet; Gamzu, Iftah; Medvedovsky, Alexander; Segev, Danny; Silverbush, Dana; Zwick, Uri; Sharan, Roded
3
2011
An extension of Khrapchenko’s theorem. Zbl 0716.94016
Zwick, Uri
3
1991
Rounding two and three dimensional solutions of the SDP relaxation of MAX CUT. Zbl 1122.90396
Avidor, Adi; Zwick, Uri
3
2005
Faster parallel string matching via larger deterministic samples. Zbl 0797.68083
Goldberg, Tal; Zwick, Uri
2
1994
Union-find with constant time deletions. Zbl 1398.68101
Alstrup, Stephen; Thorup, Mikkel; Gørtz, Inge Li; Rauhe, Theis; Zwick, Uri
2
2014
A note on busy beavers and other creatures. Zbl 0848.68036
Ben-Amram, A. M.; Julstrom, B. A.; Zwick, U.
2
1996
Public vs. private randomness in simultaneous multi-party communication complexity. Zbl 1437.68065
Fischer, Orr; Oshman, Rotem; Zwick, Uri
2
2016
Which bases admit non-trivial shrinkage of formulae? Zbl 0988.06009
Chockler, Hana; Zwick, Uri
2
2001
Constructing worst case instances for semidefinite programming based approximation algorithms. Zbl 0992.68237
Alon, Noga; Sudakov, Benny; Zwick, Uri
2
2001
Discounted deterministic Markov decision processes and discounted all-pairs shortest paths. Zbl 1300.05303
Madani, Omid; Thorup, Mikkel; Zwick, Uri
2
2010
Adjacency labeling schemes and induced-universal graphs. Zbl 1403.05123
Alstrup, Stephen; Kaplan, Haim; Thorup, Mikkel; Zwick, Uri
7
2019
A faster deterministic exponential time algorithm for energy games and mean payoff games. Zbl 1522.91066
Dorfman, Dani; Kaplan, Haim; Zwick, Uri
5
2019
Faster \(k\)-SAT algorithms using biased-PPSZ. Zbl 1433.68602
Hansen, Thomas Dueholm; Kaplan, Haim; Zamir, Or; Zwick, Uri
5
2019
Pairing heaps: the forward variant. Zbl 1510.68016
Dorfman, Dani; Kaplan, Haim; Kozma, László; Zwick, Uri
1
2018
Improved bounds for multipass pairing heaps and path-balanced binary search trees. Zbl 1522.68169
Dorfman, Dani; Kaplan, Haim; Kozma, László; Pettie, Seth; Zwick, Uri
1
2018
Hollow heaps. Zbl 1440.68051
Hansen, Thomas Dueholm; Kaplan, Haim; Tarjan, Robert E.; Zwick, Uri
1
2017
A fully dynamic reachability algorithm for directed graphs with an almost linear update time. Zbl 1342.05187
Roditty, Liam; Zwick, Uri
4
2016
Public vs. private randomness in simultaneous multi-party communication complexity. Zbl 1437.68065
Fischer, Orr; Oshman, Rotem; Zwick, Uri
2
2016
Bottleneck paths and trees and deterministic graphical games. Zbl 1388.68109
Chechik, Shiri; Kaplan, Haim; Thorup, Mikkel; Zamir, Or; Zwick, Uri
1
2016
Random-edge is slower than random-facet on abstract cubes. Zbl 1388.90086
Hansen, Thomas Dueholm; Zwick, Uri
1
2016
An improved version of the random-facet pivoting rule for the simplex algorithm. Zbl 1321.90080
Hansen, Thomas Dueholm; Zwick, Uri
12
2015
Adjacency labeling schemes and induced-universal graphs. Zbl 1321.05226
Alstrup, Stephen; Kaplan, Haim; Thorup, Mikkel; Zwick, Uri
12
2015
Hollow heaps. Zbl 1440.68050
Hansen, Thomas Dueholm; Kaplan, Haim; Tarjan, Robert E.; Zwick, Uri
1
2015
Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences. Zbl 1333.68216
Ta-Shma, Amnon; Zwick, Uri
30
2014
Listing triangles. Zbl 1410.05191
Björklund, Andreas; Pagh, Rasmus; Williams, Virginia Vassilevska; Zwick, Uri
21
2014
Improved upper bounds for random-edge and random-jump on abstract cubes. Zbl 1421.68084
Hansen, Thomas Dueholm; Paterson, Mike; Zwick, Uri
8
2014
Union-find with constant time deletions. Zbl 1398.68101
Alstrup, Stephen; Thorup, Mikkel; Gørtz, Inge Li; Rauhe, Theis; Zwick, Uri
2
2014
Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor. Zbl 1281.91019
Hansen, Thomas Dueholm; Miltersen, Peter Bro; Zwick, Uri
18
2013
All-pairs shortest paths in \(O(n^2)\) time with high probability. Zbl 1281.05126
Peres, Yuval; Sotnikov, Dmitry; Sudakov, Benny; Zwick, Uri
6
2013
Soft heaps simplified. Zbl 1276.68063
Kaplan, Haim; Tarjan, Robert E.; Zwick, Uri
1
2013
Dynamic approximate all-pairs shortest paths in undirected graphs. Zbl 1247.68340
Roditty, Liam; Zwick, Uri
23
2012
Replacement paths and \(k\) simple shortest paths in unweighted directed graphs. Zbl 1295.05237
Roditty, Liam; Zwick, Uri
9
2012
Subexponential lower bounds for randomized pivoting rules for the simplex algorithm. Zbl 1288.68090
Friedmann, Oliver; Hansen, Thomas Dueholm; Zwick, Uri
28
2011
On dynamic shortest paths problems. Zbl 1244.68091
Roditty, Liam; Zwick, Uri
18
2011
A subexponential lower bound for the random facet algorithm for parity games. Zbl 1377.68091
Friedmann, Oliver; Hansen, Thomas Dueholm; Zwick, Uri
8
2011
All-pairs bottleneck paths in vertex weighted graphs. Zbl 1211.05168
Shapira, Asaf; Yuster, Raphael; Zwick, Uri
6
2011
On the approximability of reachability-preserving network orientations. Zbl 1245.68105
Elberfeld, Michael; Bafna, Vineet; Gamzu, Iftah; Medvedovsky, Alexander; Segev, Danny; Silverbush, Dana; Zwick, Uri; Sharan, Roded
3
2011
Lower bounds for Howard’s algorithm for finding minimum mean-cost cycles. Zbl 1311.90171
Hansen, Thomas Dueholm; Zwick, Uri
3
2010
Discounted deterministic Markov decision processes and discounted all-pairs shortest paths. Zbl 1300.05303
Madani, Omid; Thorup, Mikkel; Zwick, Uri
2
2010
Efficient algorithms for the 2-gathering problem. Zbl 1300.05306
Shalita, Alon; Zwick, Uri
1
2010
Maximum overhang. Zbl 1229.00005
Paterson, Mike; Peres, Yuval; Thorup, Mikkel; Winkler, Peter; Zwick, Uri
8
2009
Overhang. Zbl 1168.40001
Paterson, Mike; Zwick, Uri
4
2009
A deterministic subexponential algorithm for solving parity games. Zbl 1173.91326
Jurdziński, Marcin; Paterson, Mike; Zwick, Uri
32
2008
Improved dynamic reachability algorithms for directed graphs. Zbl 1225.68276
Roditty, Liam; Zwick, Uri
21
2008
Roundtrip spanners and roundtrip routing in directed graphs. Zbl 1420.68159
Roditty, Iam; Thorup, Mikkel; Zwick, Uri
9
2008
An efficient algorithm for the nearly equitable edge coloring problem. Zbl 1161.68702
Xie, Xuzhen; Yagiura, Mutsunori; Ono, Takao; Hirata, Tomio; Zwick, Uri
1
2008
Deterministic rendezvous, treasure hunts and strongly universal exploration sequences. Zbl 1302.68220
Ta-Shma, Amnon; Zwick, Uri
18
2007
Maximum matching in graphs with an excluded minor. Zbl 1302.05198
Yuster, Raphael; Zwick, Uri
10
2007
All-pairs bottleneck paths in vertex weighted graphs. Zbl 1302.05196
Shapira, Asaf; Yuster, Raphael; Zwick, Uri
8
2007
Spanners and emulators with sublinear distance errors. Zbl 1192.05041
Thorup, Mikkel; Zwick, Uri
35
2006
A deterministic subexponential algorithm for solving parity games. Zbl 1192.91013
Jurdziński, Marcin; Paterson, Mike; Zwick, Uri
33
2006
Multicriteria global minimum cuts. Zbl 1100.90043
Armon, Amitai; Zwick, Uri
15
2006
Improved approximation algorithms for MAX NAE-SAT and MAX SAT. Zbl 1125.68426
Avidor, Adi; Berkovitch, Ido; Zwick, Uri
14
2006
A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths. Zbl 1101.68071
Zwick, Uri
4
2006
Melding priority queues. Zbl 1321.68228
Mendelson, Ran; Tarjan, Robert E.; Thorup, Mikkel; Zwick, Uri
1
2006
Approximation, randomization and combinatorial optimization. Algorithms and techniques. 9th international workshop on approximation algorithms for combinatorial optimization problems, APPROX 2006, and 10th international workshop on randomization and computation, RANDOM 2006, Barcelona, Spain, August 28–30, 2006. Proceedings. Zbl 1114.68006
1
2006
Overhang. Zbl 1192.40002
Paterson, Mike; Zwick, Uri
1
2006
Approximate distance oracles. Zbl 1175.68303
Thorup, Mikkel; Zwick, Uri
220
2005
Deterministic constructions of approximate distance oracles and spanners. Zbl 1082.68087
Roditty, Liam; Thorup, Mikkel; Zwick, Uri
142
2005
Fast sparse matrix multiplication. Zbl 1321.65073
Yuster, Raphael; Zwick, Uri
18
2005
Approximating MIN 2-SAT and MIN 3-SAT. Zbl 1101.68603
Avidor, Adi; Zwick, Uri
11
2005
Replacement paths and \(k\) simple shortest paths in unweighted directed graphs. Zbl 1082.68594
Roditty, Liam; Zwick, Uri
9
2005
Union-find with constant time deletions. Zbl 1084.68026
Alstrup, Stephen; Gørtz, Inge Li; Rauhe, Theis; Thorup, Mikkel; Zwick, Uri
3
2005
Rounding two and three dimensional solutions of the SDP relaxation of MAX CUT. Zbl 1122.90396
Avidor, Adi; Zwick, Uri
3
2005
On dynamic shortest paths problems. Zbl 1111.68599
Roditty, Liam; Zwick, Uri
20
2004
A fully dynamic reachability algorithm for directed graphs with an almost linear update time. Zbl 1192.90238
Roditty, Liam; Zwick, Uri
12
2004
A slightly improved sub-cubic algorithm for the all pairs shortest paths problem with real edge lengths. Zbl 1116.68564
Zwick, Uri
11
2004
Detecting short directed cycles using rectangular matrix multiplication and dynamic programming. Zbl 1318.05084
Yuster, Raphael; Zwick, Uri
8
2004
Fast sparse matrix multiplication. Zbl 1111.65301
Yuster, Raphael; Zwick, Uri
5
2004
MAX CUT in cubic graphs. Zbl 1089.68077
Halperin, Eran; Livnat, Dror; Zwick, Uri
4
2004
Melding priority queues. Zbl 1095.68577
Mendelson, Ran; Tarjan, Robert E.; Thorup, Mikkel; Zwick, Uri
2
2004
Multicriteria global minimum cuts. Zbl 1116.68545
Armon, Amitai; Zwick, Uri
1
2004
Reachability and distance queries via 2-hop labels. Zbl 1026.68165
Cohen, Edith; Halperin, Eran; Kaplan, Haim; Zwick, Uri
20
2003
Connection caching: Model and algorithms. Zbl 1055.68018
Cohen, Edith; Kaplan, Haim; Zwick, Uri
1
2003
All pairs shortest paths using bridging sets and rectangular matrix multiplication. Zbl 1326.05157
Zwick, Uri
70
2002
Improved rounding techniques for the MAX 2-SAT and MAX DI-CUT problems. Zbl 1049.90535
Lewin, Michael; Livnat, Dror; Zwick, Uri
33
2002
A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems. Zbl 1017.68089
Halperin, Eran; Zwick, Uri
24
2002
Roundtrip spanners and roundtrip routing in directed graphs. Zbl 1093.68627
Roditty, Liam; Thorup, Mikkel; Zwick, Uri
12
2002
Coloring \(k\)-colorable graphs using relatively small palettes. Zbl 1030.68067
Halperin, Eran; Nathaniel, Ram; Zwick, Uri
10
2002
Reachability and distance queries via 2-hop labels. Zbl 1093.68575
Cohen, Edith; Halperin, Eran; Kaplan, Haim; Zwick, Uri
9
2002
Computer assisted proof of optimal approximability results. Zbl 1093.68640
Zwick, Uri
8
2002
Approximating MIN \(k\)-SAT. Zbl 1019.68816
Avidor, Adi; Zwick, Uri
5
2002
Jenga. Zbl 1092.91504
Zwick, Uri
1
2002
MAX CUT in cubic graphs. Zbl 1254.68186
Halperin, Eran; Livnat, Dror; Zwick, Uri
1
2002
Exact and approximate distances in graphs – a survey. Zbl 1006.68543
Zwick, Uri
33
2001
Approximate distance oracles. Zbl 1323.05126
Thorup, Mikkel; Zwick, Uri
24
2001
All-pairs small-stretch paths. Zbl 0974.68150
Cohen, Edith; Zwick, Uri
16
2001
Combinatorial approximation algorithms for the maximum directed cut problem. Zbl 1018.90039
Halperin, Eran; Zwick, Uri
11
2001
Median selection requires \((2+\varepsilon)n\) comparisons. Zbl 0977.68041
Dor, Dorit; Zwick, Uri
10
2001
On lower bounds for selecting the median. Zbl 0977.68042
Dor, Dorit; Håstad, Johan; Ulfberg, Staffan; Zwick, Uri
7
2001
A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems. Zbl 0989.90126
Halperin, Eran; Zwick, Uri
4
2001
Approximation algorithms for MAX-4-SAT and rounding procedures for semidefinite programs. Zbl 0999.90026
Halperin, Eran; Zwick, Uri
3
2001
Optimal randomized EREW PRAM algorithms for finding spanning forests. Zbl 0974.68147
Halperin, Shay; Zwick, Uri
3
2001
Which bases admit non-trivial shrinkage of formulae? Zbl 0988.06009
Chockler, Hana; Zwick, Uri
2
2001
Constructing worst case instances for semidefinite programming based approximation algorithms. Zbl 0992.68237
Alon, Noga; Sudakov, Benny; Zwick, Uri
2
2001
All-pairs almost shortest paths. Zbl 0948.05047
Dor, Dorit; Halperin, Shay; Zwick, Uri
62
2000
Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to max cut and other problems. Zbl 1345.90064
Zwick, Uri
34
1999
Selecting the median. Zbl 0933.68062
Dor, Dorit; Zwick, Uri
18
1999
SOKOBAN and other motion planning problems. Zbl 0948.68205
Dor, Dorit; Zwick, Uri
10
1999
All pairs lightest shortest paths. Zbl 1345.05106
Zwick, Uri
3
1999
Connection caching. Zbl 1345.68013
Cohen, Edith; Kaplan, Haim; Zwick, Uri
3
1999
Approximation algorithms for MAX 4-SAT and rounding procedures for semidefinite programs. Zbl 0948.90154
Halperin, Eran; Zwick, Uri
2
1999
Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint. Zbl 0930.68142
Zwick, Uri
22
1998
Finding almost-satisfying assignments. Zbl 1028.68066
Zwick, Uri
7
1998
Spatial codes and the hardness of string folding problems. (Extended abstract). Zbl 0929.68128
Nayak, Ashwin; Sinclair, Alistair; Zwick, Uri
3
1998
Finding and counting given length cycles. Zbl 0865.68093
Alon, N.; Yuster, R.; Zwick, U.
109
1997
Finding even cycles even faster. Zbl 0867.05065
Yuster, Raphael; Zwick, Uri
25
1997
Amplification by read-once formulas. Zbl 0868.94059
Dubiner, Moshe; Zwick, Uri
3
1997
The complexity of mean payoff games on graphs. Zbl 0871.68138
Zwick, Uri; Paterson, Mike
184
1996
Growth functions and automatic groups. Zbl 0892.20022
Epstein, David B. A.; Iano-Fletcher, Anthony R.; Zwick, Uri
12
1996
...and 20 more Documents
all top 5

Cited by 2,252 Authors

37 Saurabh, Saket
35 Fomin, Fedor V.
33 Pelc, Andrzej
30 Zehavi, Meirav
27 Golovach, Petr A.
25 Chatterjee, Krishnendu
18 Dieudonné, Yoann
18 Dondi, Riccardo
18 Lingas, Andrzej
18 Zwick, Uri
17 Henzinger, Thomas A.
17 Roditty, Liam
16 Lokshtanov, Daniel
16 Marx, Dániel
15 Neiman, Ofer
14 Elkin, Michael
14 Gaubert, Stéphane
14 Yuster, Raphael
13 Peleg, David
13 Rauch Henzinger, Monika
12 Baswana, Surender
12 Gawrychowski, Paweł
12 Vassilevska Williams, Virginia
11 Boros, Endre
11 Makino, Kazuhisa
11 Schewe, Sven
10 Bouchard, Sébastien
10 Elbassioni, Khaled M.
10 Filtser, Arnold
10 Gurvich, Vladimir A.
10 Pettie, Seth
10 Raskin, Jean-François
10 Xu, Dachuan
9 Abboud, Amir
9 Alon, Noga
9 Dragan, Feodor F.
9 Gavoille, Cyril
9 Niedermeier, Rolf
9 Sikora, Florian
9 Thilikos, Dimitrios M.
8 Censor-Hillel, Keren
8 Chen, Jian-er
8 Kaplan, Haim
8 Kavitha, Telikepalli
8 Kratsch, Stefan
8 Raman, Venkatesh
8 Randour, Mickael
8 Rizzi, Romeo
8 Sergeev, Igor’ Sergeevich
8 Takaoka, Tadao
8 Vialette, Stéphane
8 Weimann, Oren
7 Akian, Marianne
7 Benerecetti, Massimo
7 Bonnet, Edouard
7 Dell’Erba, Daniele
7 Du, Donglei
7 Ducoffe, Guillaume
7 Fertin, Guillaume
7 Friedmann, Oliver
7 Italiano, Giuseppe Francesco
7 Komusiewicz, Christian
7 Markey, Nicolas
7 Mogavero, Fabio
7 Mozes, Shay
7 Nanongkai, Danupon
7 Naor, Assaf
7 Panolan, Fahad
7 Pilipczuk, Michał
7 Wang, Jianxin
7 Ye, Yinyu
6 Abraham, Ittai
6 Bazgan, Cristina
6 Bodlaender, Hans L.
6 Bouyer, Patricia
6 Chan, Timothy Moon-Yew
6 Chechik, Shiri
6 Chen, Ruiwen
6 Doyen, Laurent
6 Dumitrescu, Adrian
6 Fellows, Michael Ralph
6 Friedrich, Tobias
6 Guruswami, Venkatesan
6 Habib, Michel
6 Hermelin, Danny
6 Kabanets, Valentine
6 Kawarabayashi, Ken-ichi
6 Kosowski, Adrian
6 Krinninger, Sebastian
6 Kulikov, Alexander S.
6 Lampis, Michael
6 Larsen, Kim Guldstrand
6 Lozovanu, Dmitrii
6 Misra, Neeldhara
6 Mulzer, Wolfgang Johann Heinrich
6 Murano, Aniello
6 Perelli, Giuseppe
6 Pickl, Stefan Wolfgang
6 Pilipczuk, Marcin L.
6 Shachnai, Hadas
...and 2,152 more Authors
all top 5

Cited in 183 Serials

158 Theoretical Computer Science
116 Algorithmica
57 Discrete Applied Mathematics
49 Information Processing Letters
48 SIAM Journal on Computing
45 Journal of Computer and System Sciences
37 Information and Computation
33 Distributed Computing
29 Theory of Computing Systems
26 SIAM Journal on Discrete Mathematics
18 Journal of Discrete Algorithms
16 Journal of Combinatorial Optimization
15 Mathematical Programming. Series A. Series B
11 Logical Methods in Computer Science
9 Acta Informatica
9 Artificial Intelligence
9 ACM Journal of Experimental Algorithmics
9 Discrete Optimization
7 Operations Research Letters
7 Graphs and Combinatorics
7 Random Structures & Algorithms
7 European Journal of Operational Research
6 Discrete Mathematics
6 Applied Mathematics and Computation
6 International Journal of Foundations of Computer Science
6 Computational Complexity
6 Journal of Scheduling
6 Journal of Graph Algorithms and Applications
5 Automatica
5 Information Sciences
5 Networks
5 Discrete & Computational Geometry
5 Computational Geometry
5 ACM Transactions on Algorithms
5 Computer Science Review
4 Combinatorica
4 Journal of Symbolic Computation
4 Formal Methods in System Design
4 Combinatorics, Probability and Computing
4 Optimization Methods & Software
4 ACM Transactions on Computational Logic
4 Algorithms
3 International Journal of Game Theory
3 Journal of Combinatorial Theory. Series A
3 Journal of Combinatorial Theory. Series B
3 Journal of Computational and Applied Mathematics
3 Journal of Graph Theory
3 Mathematics of Operations Research
3 Naval Research Logistics
3 Operations Research
3 Computers & Operations Research
3 Journal of Automated Reasoning
3 Annals of Operations Research
3 Discrete Event Dynamic Systems
3 Linear Algebra and its Applications
3 SIAM Journal on Optimization
3 Data Mining and Knowledge Discovery
3 RAIRO. Theoretical Informatics and Applications
3 Journal of Machine Learning Research (JMLR)
3 Natural Computing
3 4OR
3 Optimization Letters
2 American Mathematical Monthly
2 Israel Journal of Mathematics
2 Mathematical Proceedings of the Cambridge Philosophical Society
2 Moscow University Mathematics Bulletin
2 Moscow University Computational Mathematics and Cybernetics
2 European Journal of Combinatorics
2 Asia-Pacific Journal of Operational Research
2 Applied Mathematics Letters
2 International Journal of Algebra and Computation
2 MSCS. Mathematical Structures in Computer Science
2 Journal of Global Optimization
2 RAIRO. Informatique Théorique et Applications
2 Journal of Computer and Systems Sciences International
2 SIAM Journal on Scientific Computing
2 The Electronic Journal of Combinatorics
2 Top
2 The Journal of Artificial Intelligence Research (JAIR)
2 Buletinul Academiei de Științe a Republicii Moldova. Matematica
2 Annals of Mathematics and Artificial Intelligence
2 INFORMS Journal on Computing
2 Journal of the ACM
2 Journal of the European Mathematical Society (JEMS)
2 Internet Mathematics
2 Journal of Industrial and Management Optimization
2 Ars Mathematica Contemporanea
2 Acta Universitatis Sapientiae. Informatica
2 Central European Journal of Computer Science
2 Dynamic Games and Applications
2 Journal of Dynamics and Games
2 Prikladnaya Diskretnaya Matematika
1 ACM Computing Surveys
1 Communications in Algebra
1 Computers & Mathematics with Applications
1 Computer Physics Communications
1 Journal of Mathematical Analysis and Applications
1 Mathematical Notes
1 Physics Letters. A
1 Physics Reports
...and 83 more Serials
all top 5

Cited in 42 Fields

1,201 Computer science (68-XX)
544 Combinatorics (05-XX)
262 Operations research, mathematical programming (90-XX)
187 Game theory, economics, finance, and other social and behavioral sciences (91-XX)
51 Information and communication theory, circuits (94-XX)
38 Mathematical logic and foundations (03-XX)
33 Numerical analysis (65-XX)
28 Linear and multilinear algebra; matrix theory (15-XX)
23 Biology and other natural sciences (92-XX)
17 Group theory and generalizations (20-XX)
15 Statistics (62-XX)
14 Order, lattices, ordered algebraic structures (06-XX)
12 Convex and discrete geometry (52-XX)
11 Quantum theory (81-XX)
10 Systems theory; control (93-XX)
9 Probability theory and stochastic processes (60-XX)
7 Number theory (11-XX)
7 Algebraic geometry (14-XX)
7 Functional analysis (46-XX)
5 Dynamical systems and ergodic theory (37-XX)
4 Functions of a complex variable (30-XX)
4 Operator theory (47-XX)
4 General topology (54-XX)
4 Statistical mechanics, structure of matter (82-XX)
3 History and biography (01-XX)
3 Category theory; homological algebra (18-XX)
3 Calculus of variations and optimal control; optimization (49-XX)
2 Field theory and polynomials (12-XX)
2 Associative rings and algebras (16-XX)
2 Sequences, series, summability (40-XX)
2 Harmonic analysis on Euclidean spaces (42-XX)
2 Geometry (51-XX)
2 Manifolds and cell complexes (57-XX)
2 Mechanics of particles and systems (70-XX)
1 General and overarching topics; collections (00-XX)
1 General algebraic systems (08-XX)
1 Commutative algebra (13-XX)
1 Measure and integration (28-XX)
1 Partial differential equations (35-XX)
1 Mechanics of deformable solids (74-XX)
1 Relativity and gravitational theory (83-XX)
1 Mathematics education (97-XX)

Citations by Year