| 2008 |
|---|
| 26 | EE | Seth Pettie:
Splay trees, Davenport-Schinzel sequences, and the deque conjecture.
SODA 2008: 1115-1124 |
| 25 | EE | Ran Duan,
Seth Pettie:
Bounded-leg distance and reachability oracles.
SODA 2008: 436-445 |
| 24 | EE | Zvi Lotker,
Boaz Patt-Shamir,
Seth Pettie:
Improved distributed approximate matching.
SPAA 2008: 129-136 |
| 23 | EE | Seth Pettie,
Vijaya Ramachandran:
Randomized minimum spanning tree algorithms using exponentially fewer random bits.
ACM Transactions on Algorithms 4(1): (2008) |
| 2007 |
|---|
| 22 | EE | Seth Pettie:
Low Distortion Spanners.
ICALP 2007: 78-89 |
| 21 | EE | Seth Pettie:
Sources of Superlinearity in Davenport-Schinzel Sequences
CoRR abs/0707.1715: (2007) |
| 20 | EE | Seth Pettie:
Splay Trees, Davenport-Schinzel Sequences, and the Deque Conjecture
CoRR abs/0707.2160: (2007) |
| 2006 |
|---|
| 19 | EE | Seth Pettie:
Towards a Final Analysis of Pairing Heaps.
Data Structures 2006 |
| 18 | EE | Seth Pettie:
An Inverse-Ackermann Type Lower Bound For Online Minimum Spanning Tree Verification.
Combinatorica 26(2): 207-230 (2006) |
| 2005 |
|---|
| 17 | EE | Seth Pettie:
Towards a Final Analysis of Pairing Heaps.
FOCS 2005: 174-183 |
| 16 | EE | Seth Pettie:
Sensitivity Analysis of Minimum Spanning Trees in Sub-inverse-Ackermann Time.
ISAAC 2005: 964-973 |
| 15 | EE | Surender Baswana,
Telikepalli Kavitha,
Kurt Mehlhorn,
Seth Pettie:
New constructions of (alpha, beta)-spanners and purely additive spanners.
SODA 2005: 672-681 |
| 14 | EE | Christian Worm Mortensen,
Seth Pettie:
The Complexity of Implicit and Space Efficient Priority Queues.
WADS 2005: 49-60 |
| 2004 |
|---|
| 13 | EE | Seth Pettie,
Peter Sanders:
A simpler linear time 2/3-epsilon approximation for maximum weight matching.
Inf. Process. Lett. 91(6): 271-276 (2004) |
| 12 | EE | Seth Pettie:
A new approach to all-pairs shortest paths on real-weighted graphs.
Theor. Comput. Sci. 312(1): 47-74 (2004) |
| 2002 |
|---|
| 11 | EE | Seth Pettie,
Vijaya Ramachandran,
Srinath Sridhar:
Experimental Evaluation of a New Shortest Path Algorithm.
ALENEX 2002: 126-142 |
| 10 | EE | Seth Pettie:
An Inverse-Ackermann Style Lower Bound for the Online Minimum Spanning Tree.
FOCS 2002: 155- |
| 9 | EE | Seth Pettie:
A Faster All-Pairs Shortest Path Algorithm for Real-Weighted Sparse Graphs.
ICALP 2002: 85-97 |
| 8 | EE | Seth Pettie:
On the Comparison-Addition Complexity of All-Pairs Shortest Paths.
ISAAC 2002: 32-43 |
| 7 | EE | Seth Pettie,
Vijaya Ramachandran:
Computing shortest paths with comparisons and additions.
SODA 2002: 267-276 |
| 6 | EE | Seth Pettie,
Vijaya Ramachandran:
Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms.
SODA 2002: 713-722 |
| 5 | EE | Harold N. Gabow,
Seth Pettie:
The Dynamic Vertex Minimum Problem and Its Application to Clustering-Type Approximation Algorithms.
SWAT 2002: 190-199 |
| 4 | EE | Seth Pettie,
Vijaya Ramachandran:
An optimal minimum spanning tree algorithm.
J. ACM 49(1): 16-34 (2002) |
| 3 | EE | Seth Pettie,
Vijaya Ramachandran:
A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest.
SIAM J. Comput. 31(6): 1879-1895 (2002) |
| 2000 |
|---|
| 2 | EE | Seth Pettie,
Vijaya Ramachandran:
An Optimal Minimum Spanning Tree Algorithm.
ICALP 2000: 49-60 |
| 1999 |
|---|
| 1 | | Seth Pettie,
Vijaya Ramachandran:
A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest.
RANDOM-APPROX 1999: 233-244 |
