An optimal minimum spanning tree algorithm S Pettie, V Ramachandran
Journal of the ACM (JACM) 49 (1), 16-34, 2002
437 2002 Linear-time approximation for maximum weight matching R Duan, S Pettie
Journal of the ACM (JACM) 61 (1), 1-23, 2014
355 * 2014 The locality of distributed symmetry breaking L Barenboim, M Elkin, S Pettie, J Schneider
Journal of the ACM (JACM) 63 (3), 1-45, 2016
294 2016 A new approach to all-pairs shortest paths on real-weighted graphs S Pettie
Theoretical Computer Science 312 (1), 47-74, 2004
262 * 2004 A shortest path algorithm for real-weighted undirected graphs S Pettie, V Ramachandran
SIAM Journal on Computing 34 (6), 1398-1431, 2005
209 * 2005 Additive spanners and (α, β)-spanners S Baswana, T Kavitha, K Mehlhorn, S Pettie
ACM Transactions on Algorithms (TALG) 7 (1), 1-26, 2010
204 * 2010 Higher lower bounds from the 3SUM conjecture T Kopelowitz, S Pettie, E Porat
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
192 2016 An exponential separation between randomized and deterministic complexity in the LOCAL model YJ Chang, T Kopelowitz, S Pettie
SIAM Journal on Computing 48 (1), 122-143, 2019
165 2019 Improved distributed approximate matching Z Lotker, B Patt-Shamir, S Pettie
Journal of the ACM (JACM) 62 (5), 1-17, 2015
163 2015 Threesomes, degenerates, and love triangles A Grønlund, S Pettie
Journal of the ACM (JACM) 65 (4), 1-25, 2018
147 * 2018 A simpler linear time 2/3− ε approximation for maximum weight matching S Pettie, P Sanders
Information processing letters 91 (6), 271-276, 2004
110 2004 Low distortion spanners S Pettie
ACM Transactions on Algorithms (TALG) 6 (1), 1-22, 2009
107 2009 A time hierarchy theorem for the LOCAL model YJ Chang, S Pettie
SIAM Journal on Computing 48 (1), 33-69, 2019
103 2019 Dual-failure distance and connectivity oracles R Duan, S Pettie
Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009
99 2009 Fast algorithms for (max, min)-matrix multiplication and bottleneck shortest paths R Duan, S Pettie
Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009
95 2009 A randomized time-work optimal parallel algorithm for finding a minimum spanning forest S Pettie, V Ramachandran
SIAM Journal on Computing 31 (6), 1879-1895, 2002
93 2002 Distributed YJ Chang, W Li, S Pettie
SIAM Journal on Computing 49 (3), 497-539, 2020
92 * 2020 Distributed algorithms for the Lovász local lemma and graph coloring KM Chung, S Pettie, HH Su
Proceedings of the 2014 ACM symposium on Principles of distributed computing …, 2014
90 2014 A hierarchy of lower bounds for sublinear additive spanners A Abboud, G Bodwin, S Pettie
SIAM Journal on Computing 47 (6), 2203-2236, 2018
87 2018 Distributed edge coloring and a special case of the constructive Lovász local lemma YJ Chang, Q He, W Li, S Pettie, J Uitto
ACM Transactions on Algorithms (TALG) 16 (1), 1-51, 2019
76 * 2019 
Tsvi KopelowitzBar Ilan Universityכתובת אימייל מאומתת בדומיין biu.ac.il
