Seth Pettie
Seth Pettie
Professor of Computer Science and Engineering, University of Michigan
Η διεύθυνση ηλεκτρονικού ταχυδρομείου έχει επαληθευτεί στον τομέα umich.edu
Τίτλος
Παρατίθεται από
Παρατίθεται από
Έτος
An optimal minimum spanning tree algorithm
S Pettie, V Ramachandran
Journal of the ACM (JACM) 49 (1), 16-34, 2002
3272002
Linear-time approximation for maximum weight matching
R Duan, S Pettie
Journal of the ACM (JACM) 61 (1), 1-23, 2014
195*2014
A new approach to all-pairs shortest paths on real-weighted graphs
S Pettie
Theoretical Computer Science 312 (1), 47-74, 2004
195*2004
The locality of distributed symmetry breaking
L Barenboim, M Elkin, S Pettie, J Schneider
Journal of the ACM (JACM) 63 (3), 1-45, 2016
1912016
A shortest path algorithm for real-weighted undirected graphs
S Pettie, V Ramachandran
SIAM Journal on Computing 34 (6), 1398-1431, 2005
166*2005
Additive spanners and (α, β)-spanners
S Baswana, T Kavitha, K Mehlhorn, S Pettie
ACM Transactions on Algorithms (TALG) 7 (1), 1-26, 2010
150*2010
Improved distributed approximate matching
Z Lotker, B Patt-Shamir, S Pettie
Journal of the ACM (JACM) 62 (5), 1-17, 2015
117*2015
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
99*2016
Threesomes, degenerates, and love triangles
A Grønlund, S Pettie
Journal of the ACM (JACM) 65 (4), 1-25, 2018
93*2018
A simpler linear time 2/3− ε approximation for maximum weight matching
S Pettie, P Sanders
Information processing letters 91 (6), 271-276, 2004
932004
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
802019
Low distortion spanners
S Pettie
ACM Transactions on Algorithms (TALG) 6 (1), 1-22, 2009
802009
Dual-failure distance and connectivity oracles
R Duan, S Pettie
Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009
752009
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
672002
Distributed algorithms for the Lovász local lemma and graph coloring
KM Chung, S Pettie, HH Su
Distributed Computing 30 (4), 261-280, 2017
652017
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
652009
Towards a final analysis of pairing heaps
S Pettie
46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 174-183, 2005
592005
Randomized minimum spanning tree algorithms using exponentially fewer random bits
S Pettie, V Ramachandran
ACM Transactions on Algorithms (TALG) 4 (1), 1-27, 2008
53*2008
Distributed algorithms for ultrasparse spanners and linear size skeletons
S Pettie
Distributed Computing 22 (3), 147-166, 2010
472010
Distributed -Coloring via Ultrafast Graph Shattering
YJ Chang, W Li, S Pettie
SIAM Journal on Computing 49 (3), 497-539, 2020
46*2020
Δεν είναι δυνατή η εκτέλεση της ενέργειας από το σύστημα αυτή τη στιγμή. Προσπαθήστε ξανά αργότερα.
Άρθρα 1–20