×

zbMATH — the first resource for mathematics

Pettie, Seth

Compute Distance To:
Author ID: pettie.seth Recent zbMATH articles by "Pettie, Seth"
Published as: Pettie, Seth; Pettie, S.
Documents Indexed: 86 Publications since 2000

Publications by Year

Citations contained in zbMATH Open

74 Publications have been cited 448 times in 266 Documents Cited by Year
A new approach to all-pairs shortest paths on real-weighted graphs. Zbl 1071.68084
Pettie, Seth
30
2004
Additive spanners and \(({\alpha}, {\beta})\)-spanners. Zbl 1295.05094
Baswana, Surender; Kavitha, Telikepalli; Mehlhorn, Kurt; Pettie, Seth
22
2010
Linear-time approximation for maximum weight matching. Zbl 1295.68213
Duan, Ran; Pettie, Seth
21
2014
The locality of distributed symmetry breaking. Zbl 1426.68020
Barenboim, Leonid; Elkin, Michael; Pettie, Seth; Schneider, Johannes
19
2016
An optimal minimum spanning tree algorithm. Zbl 1323.05124
Pettie, Seth; Ramachandran, Vijaya
18
2002
A shortest path algorithm for real-weighted undirected graphs. Zbl 1078.05080
Pettie, Seth; Ramachandran, Vijaya
17
2005
Low distortion spanners. Zbl 1298.05307
Pettie, Seth
15
2009
A simpler linear time \( \frac{2}{3} - \varepsilon\) approximation for maximum weight matching. Zbl 1178.68686
Pettie, Seth; Sanders, Peter
14
2004
Improved distributed approximate matching. Zbl 1426.68292
Lotker, Zvi; Patt-Shamir, Boaz; Pettie, Seth
14
2015
Higher lower bounds from the 3SUM conjecture. Zbl 1410.68147
Kopelowitz, Tsvi; Pettie, Seth; Porat, Ely
13
2016
New constructions of \(({\alpha}, {\beta})\)-spanners and purely additive spanners. Zbl 1297.05066
Baswana, Surender; Kavitha, Telikepalli; Mehlhorn, Kurt; Pettie, Seth
13
2005
Degrees of nonlinearity in forbidden 0-1 matrix problems. Zbl 1239.05028
Pettie, Seth
13
2011
Sensitivity analysis of minimum spanning trees in sub-inverse-Ackermann time. Zbl 1175.68549
Pettie, Seth
11
2005
Generalized Davenport-Schinzel sequences and their 0-1 matrix counterparts. Zbl 1227.68087
Pettie, S.
11
2011
Brief announcement: An exponential separation between randomized and deterministic complexity in the LOCAL model. Zbl 1373.68258
Chang, Yi-Jun; Kopelowitz, Tsvi; Pettie, Seth
9
2016
Sharp bounds on Davenport-Schinzel sequences of every order. Zbl 1305.68093
Pettie, Seth
8
2013
Distributed algorithms for ultrasparse spanners and linear size skeletons. Zbl 1267.68314
Pettie, Seth
8
2010
Splay trees, Davenport-Schinzel sequences, and the Deque conjecture. Zbl 1192.68186
Pettie, Seth
8
2008
On the structure and composition of forbidden sequences, with geometric applications. Zbl 1283.68277
Pettie, Seth
7
2011
A randomized time-work optimal parallel algorithm for finding a minimum spanning forest. Zbl 1006.05053
Pettie, Seth; Ramachandran, Vijaya
7
2002
Threesomes, degenerates, and love triangles. Zbl 1422.68112
Grønlund, Allan; Pettie, Seth
7
2018
Distributed algorithms for the Lovász local lemma and graph coloring. Zbl 1321.68461
Chung, Kai-Min; Pettie, Seth; Su, Hsin-Hao
6
2014
Mind the gap: essentially optimal algorithms for online dictionary matching with one gap. Zbl 1398.68207
Amir, Amihood; Kopelowitz, Tsvi; Levy, Avivit; Pettie, Seth; Porat, Ely; Shalom, B. Riva
6
2016
A hierarchy of lower bounds for sublinear additive spanners. Zbl 1410.68265
Abboud, Amir; Bodwin, Greg; Pettie, Seth
6
2017
Low distortion spanners. Zbl 1171.68641
Pettie, Seth
6
2007
A faster all-pairs shortest path algorithm for real-weighted sparse graphs. Zbl 1056.68111
Pettie, Seth
6
2002
Computing shortest paths with comparisons and additions. Zbl 1258.90101
Pettie, Seth; Ramachandran, Vijaya
6
2002
Origins of nonlinearity in Davenport-Schinzel sequences. Zbl 1233.05019
Pettie, Seth
6
2011
Applications of forbidden 0-1 matrices to search tree and path compression-based data structures. Zbl 1288.68052
Pettie, Seth
6
2010
An optimal distributed \((\Delta+1)\)-coloring algorithm? Zbl 1427.68355
Chang, Yi-Jun; Li, Wenzheng; Pettie, Seth
6
2018
Distributed coloring algorithms for triangle-free graphs. Zbl 1327.68330
Pettie, Seth; Su, Hsin-Hao
5
2015
Scaling algorithms for weighted matching in general graphs. Zbl 1451.05227
Duan, Ran; Pettie, Seth; Su, Hsin-Hao
5
2018
Dynamic set intersection. Zbl 1451.68081
Kopelowitz, Tsvi; Pettie, Seth; Porat, Ely
4
2015
Three generalizations of Davenport-Schinzel sequences. Zbl 1329.05010
Pettie, Seth
4
2015
Faster worst case deterministic dynamic connectivity. Zbl 1397.68142
Kejlberg-Rasmussen, Casper; Kopelowitz, Tsvi; Pettie, Seth; Thorup, Mikkel
4
2016
Contention resolution with log-logstar channel accesses. Zbl 1373.68075
Bender, Michael A.; Kopelowitz, Tsvi; Pettie, Seth; Young, Maxwell
4
2016
\((2\Delta-1)\)-edge-coloring is much easier than maximal matching in the distributed setting. Zbl 1372.68210
Elkin, Michael; Pettie, Seth; Su, Hsin-Hao
4
2015
Fast algorithms for \((\max, \min)\)-matrix multiplication and bottleneck shortest paths. Zbl 1423.05167
Duan, Ran; Pettie, Seth
4
2009
Dual-failure distance and connectivity oracles. Zbl 1421.68121
Duan, Ran; Pettie, Seth
4
2009
Connectivity oracles for failure prone graphs. Zbl 1293.05188
Duan, Ran; Pettie, Seth
4
2010
Lower bounds on sparse spanners, emulators, and diameter-reducing shortcuts. Zbl 07238981
Huang, Shang-En; Pettie, Seth
4
2018
Thorup-Zwick emulators are universally optimal hopsets. Zbl 06989080
Huang, Shang-En; Pettie, Seth
4
2019
Connectivity oracles for graphs subject to vertex failures. Zbl 1410.68096
Duan, Ran; Pettie, Seth
3
2017
Mind the gap! Zbl 1412.68075
Amir, Amihood; Kopelowitz, Tsvi; Levy, Avivit; Pettie, Seth; Porat, Ely; Shalom, B. Riva
3
2019
An inverse-Ackermann type lower bound for online minimum spanning tree verification. Zbl 1121.05067
Pettie, Seth
3
2006
On nonlinear forbidden 0–1 matrices, a refutation of a Füredi-Hajnal conjecture. Zbl 1288.05033
Pettie, Seth
3
2010
Distributed triangle detection via expander decomposition. Zbl 1431.68129
Chang, Yi-Jun; Pettie, Seth; Zhang, Hengjie
3
2019
A linear-size logarithmic stretch path-reporting distance oracle for general graphs. Zbl 1446.68115
Elkin, Michael; Pettie, Seth
3
2016
Exponential separations in the energy complexity of leader election. Zbl 1369.68049
Chang, Yi-Jun; Kopelowitz, Tsvi; Pettie, Seth; Wang, Ruosong; Zhan, Wei
2
2017
Distributed algorithms for the Lovász local lemma and graph coloring. Zbl 1419.68213
Chung, Kai-Min; Pettie, Seth; Su, Hsin-Hao
2
2017
Distributed algorithms for ultrasparse spanners and linear size skeletons. Zbl 1301.68259
Pettie, Seth
2
2008
The complexity of distributed edge coloring with small palettes. Zbl 1403.68326
Chang, Yi-Jun; He, Qizheng; Li, Wenzheng; Pettie, Seth; Uitto, Jara
2
2018
Sharp bounds on formation-free sequences. Zbl 1371.68224
Pettie, Seth
2
2015
Lower bounds on Davenport-Schinzel sequences via rectangular Zarankiewicz matrices. Zbl 1387.05003
Wellman, Julian; Pettie, Seth
2
2018
Fully dynamic connectivity in \(O(\log n(\log\log n)^2)\) amortized expected time. Zbl 1410.68299
Huang, Shang-En; Huang, Dawei; Kopelowitz, Tsvi; Pettie, Seth
2
2017
Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms. Zbl 1093.68675
Pettie, Seth; Ramachandran, Vijaya
2
2002
Fast distributed coloring algorithms for triangle-free graphs. Zbl 1328.68292
Pettie, Seth; Su, Hsin-Hao
2
2013
Sharp bounds on Davenport-Schinzel sequences of every order. Zbl 1426.68232
Pettie, Seth
2
2015
A simple reduction from maximum weight matching to maximum cardinality matching. Zbl 1248.05161
Pettie, S.
2
2012
Distributed edge coloring and a special case of the constructive Lovász local lemma. Zbl 1454.68167
Chang, Yi-Jun; He, Qizheng; Li, Wenzheng; Pettie, Seth; Uitto, Jara
2
2020
An exponential separation between randomized and deterministic complexity in the LOCAL model. Zbl 1404.05203
Chang, Yi-Jun; Kopelowitz, Tsvi; Pettie, Seth
2
2019
A hierarchy of lower bounds for sublinear additive spanners. Zbl 1409.68197
Abboud, Amir; Bodwin, Greg; Pettie, Seth
2
2018
A time hierarchy theorem for the LOCAL model. Zbl 1405.68116
Chang, Yi-Jun; Pettie, Seth
2
2019
A linear-size logarithmic stretch path-reporting distance oracle for general graphs. Zbl 1372.68209
Elkin, Michael; Pettie, Seth
1
2015
Scaling algorithms for weighted matching in general graphs. Zbl 1410.05199
Duan, Ran; Pettie, Seth; Su, Hsin-Hao
1
2017
The dynamic vertex minimum problem and its application to clustering-type approximation algorithms. Zbl 1078.68827
Gabow, Harold N.; Pettie, Seth
1
2002
The complexity of implicit and space efficient priority queues. Zbl 1161.68403
Mortensen, Christian W.; Pettie, Seth
1
2005
An optimal minimum spanning tree algorithm. Zbl 0973.68534
Pettie, Seth; Ramachandran, Vijaya
1
2000
Experimental evaluation of a new shortest path algorithm. Zbl 1014.68674
Pettie, Seth; Ramachandran, Vijaya; Sridhar, Srinath
1
2002
On the comparison-addition complexity of all-pairs shortest paths. Zbl 1019.68081
Pettie, Seth
1
2002
Connectivity oracles for planar graphs. Zbl 1357.68015
Borradaile, Glencora; Pettie, Seth; Wulff-Nilsen, Christian
1
2012
The energy complexity of broadcast. Zbl 1428.68061
Chang, Yi-Jun; Dani, Varsha; Hayes, Thomas P.; He, Qizheng; Li, Wenzheng; Pettie, Seth
1
2018
Contention resolution without collision detection. Zbl 07298234
Bender, Michael A.; Kopelowitz, Tsvi; Kuszmaul, William; Pettie, Seth
1
2020
Randomized minimum spanning tree algorithms using exponentially fewer random bits. Zbl 1445.68344
Pettie, Seth; Ramachandran, Vijaya
1
2008
Distributed edge coloring and a special case of the constructive Lovász local lemma. Zbl 1454.68167
Chang, Yi-Jun; He, Qizheng; Li, Wenzheng; Pettie, Seth; Uitto, Jara
2
2020
Contention resolution without collision detection. Zbl 07298234
Bender, Michael A.; Kopelowitz, Tsvi; Kuszmaul, William; Pettie, Seth
1
2020
Thorup-Zwick emulators are universally optimal hopsets. Zbl 06989080
Huang, Shang-En; Pettie, Seth
4
2019
Mind the gap! Zbl 1412.68075
Amir, Amihood; Kopelowitz, Tsvi; Levy, Avivit; Pettie, Seth; Porat, Ely; Shalom, B. Riva
3
2019
Distributed triangle detection via expander decomposition. Zbl 1431.68129
Chang, Yi-Jun; Pettie, Seth; Zhang, Hengjie
3
2019
An exponential separation between randomized and deterministic complexity in the LOCAL model. Zbl 1404.05203
Chang, Yi-Jun; Kopelowitz, Tsvi; Pettie, Seth
2
2019
A time hierarchy theorem for the LOCAL model. Zbl 1405.68116
Chang, Yi-Jun; Pettie, Seth
2
2019
Threesomes, degenerates, and love triangles. Zbl 1422.68112
Grønlund, Allan; Pettie, Seth
7
2018
An optimal distributed \((\Delta+1)\)-coloring algorithm? Zbl 1427.68355
Chang, Yi-Jun; Li, Wenzheng; Pettie, Seth
6
2018
Scaling algorithms for weighted matching in general graphs. Zbl 1451.05227
Duan, Ran; Pettie, Seth; Su, Hsin-Hao
5
2018
Lower bounds on sparse spanners, emulators, and diameter-reducing shortcuts. Zbl 07238981
Huang, Shang-En; Pettie, Seth
4
2018
The complexity of distributed edge coloring with small palettes. Zbl 1403.68326
Chang, Yi-Jun; He, Qizheng; Li, Wenzheng; Pettie, Seth; Uitto, Jara
2
2018
Lower bounds on Davenport-Schinzel sequences via rectangular Zarankiewicz matrices. Zbl 1387.05003
Wellman, Julian; Pettie, Seth
2
2018
A hierarchy of lower bounds for sublinear additive spanners. Zbl 1409.68197
Abboud, Amir; Bodwin, Greg; Pettie, Seth
2
2018
The energy complexity of broadcast. Zbl 1428.68061
Chang, Yi-Jun; Dani, Varsha; Hayes, Thomas P.; He, Qizheng; Li, Wenzheng; Pettie, Seth
1
2018
A hierarchy of lower bounds for sublinear additive spanners. Zbl 1410.68265
Abboud, Amir; Bodwin, Greg; Pettie, Seth
6
2017
Connectivity oracles for graphs subject to vertex failures. Zbl 1410.68096
Duan, Ran; Pettie, Seth
3
2017
Exponential separations in the energy complexity of leader election. Zbl 1369.68049
Chang, Yi-Jun; Kopelowitz, Tsvi; Pettie, Seth; Wang, Ruosong; Zhan, Wei
2
2017
Distributed algorithms for the Lovász local lemma and graph coloring. Zbl 1419.68213
Chung, Kai-Min; Pettie, Seth; Su, Hsin-Hao
2
2017
Fully dynamic connectivity in \(O(\log n(\log\log n)^2)\) amortized expected time. Zbl 1410.68299
Huang, Shang-En; Huang, Dawei; Kopelowitz, Tsvi; Pettie, Seth
2
2017
Scaling algorithms for weighted matching in general graphs. Zbl 1410.05199
Duan, Ran; Pettie, Seth; Su, Hsin-Hao
1
2017
The locality of distributed symmetry breaking. Zbl 1426.68020
Barenboim, Leonid; Elkin, Michael; Pettie, Seth; Schneider, Johannes
19
2016
Higher lower bounds from the 3SUM conjecture. Zbl 1410.68147
Kopelowitz, Tsvi; Pettie, Seth; Porat, Ely
13
2016
Brief announcement: An exponential separation between randomized and deterministic complexity in the LOCAL model. Zbl 1373.68258
Chang, Yi-Jun; Kopelowitz, Tsvi; Pettie, Seth
9
2016
Mind the gap: essentially optimal algorithms for online dictionary matching with one gap. Zbl 1398.68207
Amir, Amihood; Kopelowitz, Tsvi; Levy, Avivit; Pettie, Seth; Porat, Ely; Shalom, B. Riva
6
2016
Faster worst case deterministic dynamic connectivity. Zbl 1397.68142
Kejlberg-Rasmussen, Casper; Kopelowitz, Tsvi; Pettie, Seth; Thorup, Mikkel
4
2016
Contention resolution with log-logstar channel accesses. Zbl 1373.68075
Bender, Michael A.; Kopelowitz, Tsvi; Pettie, Seth; Young, Maxwell
4
2016
A linear-size logarithmic stretch path-reporting distance oracle for general graphs. Zbl 1446.68115
Elkin, Michael; Pettie, Seth
3
2016
Improved distributed approximate matching. Zbl 1426.68292
Lotker, Zvi; Patt-Shamir, Boaz; Pettie, Seth
14
2015
Distributed coloring algorithms for triangle-free graphs. Zbl 1327.68330
Pettie, Seth; Su, Hsin-Hao
5
2015
Dynamic set intersection. Zbl 1451.68081
Kopelowitz, Tsvi; Pettie, Seth; Porat, Ely
4
2015
Three generalizations of Davenport-Schinzel sequences. Zbl 1329.05010
Pettie, Seth
4
2015
\((2\Delta-1)\)-edge-coloring is much easier than maximal matching in the distributed setting. Zbl 1372.68210
Elkin, Michael; Pettie, Seth; Su, Hsin-Hao
4
2015
Sharp bounds on formation-free sequences. Zbl 1371.68224
Pettie, Seth
2
2015
Sharp bounds on Davenport-Schinzel sequences of every order. Zbl 1426.68232
Pettie, Seth
2
2015
A linear-size logarithmic stretch path-reporting distance oracle for general graphs. Zbl 1372.68209
Elkin, Michael; Pettie, Seth
1
2015
Linear-time approximation for maximum weight matching. Zbl 1295.68213
Duan, Ran; Pettie, Seth
21
2014
Distributed algorithms for the Lovász local lemma and graph coloring. Zbl 1321.68461
Chung, Kai-Min; Pettie, Seth; Su, Hsin-Hao
6
2014
Sharp bounds on Davenport-Schinzel sequences of every order. Zbl 1305.68093
Pettie, Seth
8
2013
Fast distributed coloring algorithms for triangle-free graphs. Zbl 1328.68292
Pettie, Seth; Su, Hsin-Hao
2
2013
A simple reduction from maximum weight matching to maximum cardinality matching. Zbl 1248.05161
Pettie, S.
2
2012
Connectivity oracles for planar graphs. Zbl 1357.68015
Borradaile, Glencora; Pettie, Seth; Wulff-Nilsen, Christian
1
2012
Degrees of nonlinearity in forbidden 0-1 matrix problems. Zbl 1239.05028
Pettie, Seth
13
2011
Generalized Davenport-Schinzel sequences and their 0-1 matrix counterparts. Zbl 1227.68087
Pettie, S.
11
2011
On the structure and composition of forbidden sequences, with geometric applications. Zbl 1283.68277
Pettie, Seth
7
2011
Origins of nonlinearity in Davenport-Schinzel sequences. Zbl 1233.05019
Pettie, Seth
6
2011
Additive spanners and \(({\alpha}, {\beta})\)-spanners. Zbl 1295.05094
Baswana, Surender; Kavitha, Telikepalli; Mehlhorn, Kurt; Pettie, Seth
22
2010
Distributed algorithms for ultrasparse spanners and linear size skeletons. Zbl 1267.68314
Pettie, Seth
8
2010
Applications of forbidden 0-1 matrices to search tree and path compression-based data structures. Zbl 1288.68052
Pettie, Seth
6
2010
Connectivity oracles for failure prone graphs. Zbl 1293.05188
Duan, Ran; Pettie, Seth
4
2010
On nonlinear forbidden 0–1 matrices, a refutation of a Füredi-Hajnal conjecture. Zbl 1288.05033
Pettie, Seth
3
2010
Low distortion spanners. Zbl 1298.05307
Pettie, Seth
15
2009
Fast algorithms for \((\max, \min)\)-matrix multiplication and bottleneck shortest paths. Zbl 1423.05167
Duan, Ran; Pettie, Seth
4
2009
Dual-failure distance and connectivity oracles. Zbl 1421.68121
Duan, Ran; Pettie, Seth
4
2009
Splay trees, Davenport-Schinzel sequences, and the Deque conjecture. Zbl 1192.68186
Pettie, Seth
8
2008
Distributed algorithms for ultrasparse spanners and linear size skeletons. Zbl 1301.68259
Pettie, Seth
2
2008
Randomized minimum spanning tree algorithms using exponentially fewer random bits. Zbl 1445.68344
Pettie, Seth; Ramachandran, Vijaya
1
2008
Low distortion spanners. Zbl 1171.68641
Pettie, Seth
6
2007
An inverse-Ackermann type lower bound for online minimum spanning tree verification. Zbl 1121.05067
Pettie, Seth
3
2006
A shortest path algorithm for real-weighted undirected graphs. Zbl 1078.05080
Pettie, Seth; Ramachandran, Vijaya
17
2005
New constructions of \(({\alpha}, {\beta})\)-spanners and purely additive spanners. Zbl 1297.05066
Baswana, Surender; Kavitha, Telikepalli; Mehlhorn, Kurt; Pettie, Seth
13
2005
Sensitivity analysis of minimum spanning trees in sub-inverse-Ackermann time. Zbl 1175.68549
Pettie, Seth
11
2005
The complexity of implicit and space efficient priority queues. Zbl 1161.68403
Mortensen, Christian W.; Pettie, Seth
1
2005
A new approach to all-pairs shortest paths on real-weighted graphs. Zbl 1071.68084
Pettie, Seth
30
2004
A simpler linear time \( \frac{2}{3} - \varepsilon\) approximation for maximum weight matching. Zbl 1178.68686
Pettie, Seth; Sanders, Peter
14
2004
An optimal minimum spanning tree algorithm. Zbl 1323.05124
Pettie, Seth; Ramachandran, Vijaya
18
2002
A randomized time-work optimal parallel algorithm for finding a minimum spanning forest. Zbl 1006.05053
Pettie, Seth; Ramachandran, Vijaya
7
2002
A faster all-pairs shortest path algorithm for real-weighted sparse graphs. Zbl 1056.68111
Pettie, Seth
6
2002
Computing shortest paths with comparisons and additions. Zbl 1258.90101
Pettie, Seth; Ramachandran, Vijaya
6
2002
Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms. Zbl 1093.68675
Pettie, Seth; Ramachandran, Vijaya
2
2002
The dynamic vertex minimum problem and its application to clustering-type approximation algorithms. Zbl 1078.68827
Gabow, Harold N.; Pettie, Seth
1
2002
Experimental evaluation of a new shortest path algorithm. Zbl 1014.68674
Pettie, Seth; Ramachandran, Vijaya; Sridhar, Srinath
1
2002
On the comparison-addition complexity of all-pairs shortest paths. Zbl 1019.68081
Pettie, Seth
1
2002
An optimal minimum spanning tree algorithm. Zbl 0973.68534
Pettie, Seth; Ramachandran, Vijaya
1
2000
all top 5

Cited by 457 Authors

19 Pettie, Seth
10 Proietti, Guido
9 Gualà, Luciano
8 Bilò, Davide
7 Censor-Hillel, Keren
7 Takaoka, Tadao
6 Kavitha, Telikepalli
6 Porat, Ely
6 Roditty, Liam
5 Italiano, Giuseppe Francesco
5 Leucci, Stefano
5 Nichterlein, André
5 Niedermeier, Rolf
4 Baswana, Surender
4 Bernstein, Aaron
4 Gavoille, Cyril
4 Geneson, Jesse T.
4 Kopelowitz, Tsvi
4 Peleg, David
4 Rauch Henzinger, Monika
4 Rubinfeld, Ronitt
4 Shalom, B. Riva
3 Abboud, Amir
3 Ausiello, Giorgio
3 Bodwin, Greg
3 Chan, Timothy Moon-Yew
3 Chang, Yi-Jun
3 Colella, Feliciano
3 Ding, Wei
3 Dragan, Feodor F.
3 Elkin, Michael
3 Franciosa, Paolo Giulio
3 Halldórsson, Magnús Mar
3 Han, Yijie
3 Iacono, John
3 Konrad, Christian
3 Łącki, Jakub
3 Lam, Kam-Yiu
3 Langerman, Stefan
3 Levi, Reut
3 Levy, Avivit
3 Mehlhorn, Kurt
3 Mertzios, George B.
3 Parter, Merav
3 Patt-Shamir, Boaz
3 Paz, Ami
3 Pothen, Alex
3 Qiu, Ke
3 Ron, Dana
3 Sankowski, Piotr
3 Sen, Sandeep
3 Suk, Andrew
3 Vassilevska Williams, Virginia
3 Weimann, Oren
3 Zhu, Chun Jiang
2 Abam, Mohammad Ali
2 Amir, Amihood
2 Aronov, Boris
2 Barba, Luis Felipe
2 Barenboim, Leonid
2 Brandt, Sebastian F.
2 Chechik, Shiri
2 Choudhary, Keerti
2 Cibulka, Josef
2 Czumaj, Artur
2 Däubel, Karl
2 Demaine, Erik D.
2 Derbel, Bilel
2 Disser, Yann
2 Duan, Ran
2 Esperet, Louis
2 Fischer, Manuela
2 Halappanavar, Mahantesh
2 Harris, David G.
2 Hirvonen, Juho
2 Hougardy, Stefan
2 King, Valerie
2 Klimm, Max
2 Korándi, Dániel
2 Korman, Amos
2 Kowalski, Dariusz R.
2 Kozma, Laszlo
2 Kyncl, Jan
2 Lenzen, Christoph
2 Lewenstein, Moshe
2 Manne, Fredrik
2 Michail, Dimitrios
2 Müller-Hannemann, Matthias
2 Mütze, Torsten
2 Neiman, Ofer
2 Nivasch, Gabriel
2 Papoutsakis, Ioannis
2 Pardalos, Panos M.
2 Pequito, Sérgio
2 Rahmati, Zahed
2 Rawitz, Dror
2 Ribichini, Andrea
2 Saranurak, Thatchaphol
2 Schwartzman, Gregory
2 Shapira, Asaf
...and 357 more Authors
all top 5

Cited in 53 Serials

30 Theoretical Computer Science
27 SIAM Journal on Computing
26 Algorithmica
22 Distributed Computing
12 Information Processing Letters
8 Theory of Computing Systems
7 SIAM Journal on Discrete Mathematics
6 Discrete Mathematics
6 Journal of Computer and System Sciences
5 Discrete Applied Mathematics
5 Discrete & Computational Geometry
4 Computational Geometry
3 Journal of Combinatorial Theory. Series A
3 Information and Computation
3 Computers & Operations Research
3 SIAM Journal on Scientific Computing
3 The Electronic Journal of Combinatorics
3 Journal of Discrete Algorithms
3 Computer Science Review
2 Automatica
2 European Journal of Combinatorics
2 Random Structures & Algorithms
2 Journal of Global Optimization
2 Linear Algebra and its Applications
2 Mathematical Programming. Series A. Series B
2 Journal of Combinatorial Optimization
1 Communications in Mathematical Physics
1 Israel Journal of Mathematics
1 Computing
1 Information Sciences
1 Journal of Combinatorial Theory. Series B
1 Journal of Statistical Planning and Inference
1 Networks
1 Advances in Applied Mathematics
1 Operations Research Letters
1 Mathematical and Computer Modelling
1 Queueing Systems
1 Journal of Parallel and Distributed Computing
1 Annals of Operations Research
1 Machine Learning
1 International Journal of Computational Geometry & Applications
1 Automation and Remote Control
1 SIAM Review
1 Computational Optimization and Applications
1 Constraints
1 Mathematical Problems in Engineering
1 Journal of the ACM
1 OR Spectrum
1 ACM Journal of Experimental Algorithmics
1 Acta Numerica
1 Optimization Letters
1 Acta Universitatis Sapientiae. Informatica
1 Algorithms

Citations by Year