| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Leonid Barenboim, Michael Elkin, Seth Pettie, Johannes Schneider |
Fast Distributed Algorithms for Maximal Matching and Maximal Independent Set  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Seth Pettie |
Tightish Bounds on Davenport-Schinzel Sequences |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Glencora Borradaile, Seth Pettie, Christian Wulff-Nilsen |
Connectivity Oracles for Planar Graphs |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Seth Pettie |
Generalized Davenport-Schinzel sequences and their 0-1 matrix counterparts. |
J. Comb. Theory, Ser. A |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Seth Pettie |
Degrees of nonlinearity in forbidden 0-1 matrix problems. |
Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Duan, Seth Pettie, Hsin-Hao Su |
Scaling algorithms for approximate and exact maximum weight matching |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Seth Pettie |
Origins of Nonlinearity in Davenport-Schinzel Sequences. |
SIAM J. Discrete Math. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Seth Pettie |
On the structure and composition of forbidden sequences, with geometric applications. |
Symposium on Computational Geometry |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie |
Additive spanners and (alpha, beta)-spanners. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Seth Pettie |
Distributed algorithms for ultrasparse spanners and linear size skeletons. |
Distributed Computing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Seth Pettie |
Applications of Forbidden 0-1 Matrices to Search Tree and Path Compression-Based Data Structures. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Seth Pettie |
On Nonlinear Forbidden 0-1 Matrices: A Refutation of a Füredi-Hajnal Conjecture. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Ran Duan, Seth Pettie |
Approximating Maximum Weight Matching in Near-Linear Time. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Duan, Seth Pettie |
Connectivity oracles for failure prone graphs. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
connectivity |
| 1 | Seth Pettie |
Low distortion spanners. |
ACM Transactions on Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Duan, Seth Pettie |
Dual-failure distance and connectivity oracles. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Duan, Seth Pettie |
Fast algorithms for (max, min)-matrix multiplication and bottleneck shortest paths. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Seth Pettie, Vijaya Ramachandran |
Randomized minimum spanning tree algorithms using exponentially fewer random bits. |
ACM Transactions on Algorithms |
2008 |
DBLP DOI BibTeX RDF |
Graph algorithms, minimum spanning trees, random sampling |
| 1 | Seth Pettie |
Minimum Spanning Trees. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Seth Pettie |
All Pairs Shortest Paths in Sparse Graphs. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Seth Pettie |
Single-Source Shortest Paths. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Duan, Seth Pettie |
Bounded-leg distance and reachability oracles. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Seth Pettie |
Splay trees, Davenport-Schinzel sequences, and the deque conjecture. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph L. Greathouse, Ilya Wagner, David A. Ramos, Gautam Bhatnagar, Todd M. Austin, Valeria Bertacco, Seth Pettie |
Testudo: Heavyweight security analysis via statistical sampling. |
MICRO |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Zvi Lotker, Boaz Patt-Shamir, Seth Pettie |
Improved distributed approximate matching. |
SPAA |
2008 |
DBLP DOI BibTeX RDF |
matching |
| 1 | Seth Pettie |
Distributed algorithms for ultrasparse spanners and linear size skeletons. |
PODC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Seth Pettie |
Sources of Superlinearity in Davenport-Schinzel Sequences |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Seth Pettie |
Splay Trees, Davenport-Schinzel Sequences, and the Deque Conjecture |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Seth Pettie |
Low Distortion Spanners. |
ICALP |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Seth Pettie |
An Inverse-Ackermann Type Lower Bound For Online Minimum Spanning Tree Verification. |
Combinatorica |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C38, 68W01, 68R10 |
| 1 | Seth Pettie |
Towards a Final Analysis of Pairing Heaps. |
Data Structures |
2006 |
DBLP BibTeX RDF |
|
| 1 | Seth Pettie, Vijaya Ramachandran |
A Shortest Path Algorithm for Real-Weighted Undirected Graphs. |
SIAM J. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie |
New constructions of (alpha, beta)-spanners and purely additive spanners. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Worm Mortensen, Seth Pettie |
The Complexity of Implicit and Space Efficient Priority Queues. |
WADS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Seth Pettie |
Towards a Final Analysis of Pairing Heaps. |
FOCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Seth Pettie |
Sensitivity Analysis of Minimum Spanning Trees in Sub-inverse-Ackermann Time. |
ISAAC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Seth Pettie, Peter Sanders |
A simpler linear time 2/3-epsilon approximation for maximum weight matching. |
Inf. Process. Lett. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Seth Pettie |
A new approach to all-pairs shortest paths on real-weighted graphs. |
Theor. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Seth Pettie, Vijaya Ramachandran |
An optimal minimum spanning tree algorithm. |
J. ACM |
2002 |
DBLP DOI BibTeX RDF |
optimal complexity, Graph algorithms, minimum spanning tree |
| 1 | Seth Pettie, Vijaya Ramachandran |
A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest. |
SIAM J. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Seth Pettie, Vijaya Ramachandran |
Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Seth Pettie, Vijaya Ramachandran |
Computing shortest paths with comparisons and additions. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Seth Pettie |
A Faster All-Pairs Shortest Path Algorithm for Real-Weighted Sparse Graphs. |
ICALP |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Seth Pettie, Vijaya Ramachandran, Srinath Sridhar |
Experimental Evaluation of a New Shortest Path Algorithm. |
ALENEX |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Harold N. Gabow, Seth Pettie |
The Dynamic Vertex Minimum Problem and Its Application to Clustering-Type Approximation Algorithms. |
SWAT |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Seth Pettie |
An Inverse-Ackermann Style Lower Bound for the Online Minimum Spanning Tree. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Seth Pettie |
On the Comparison-Addition Complexity of All-Pairs Shortest Paths. |
ISAAC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Seth Pettie, Vijaya Ramachandran |
An Optimal Minimum Spanning Tree Algorithm. |
ICALP |
2000 |
DBLP DOI BibTeX RDF |
optimal complexity, Graph algorithms, minimum spanning tree |
| 1 | Seth Pettie, Vijaya Ramachandran |
A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest. |
RANDOM-APPROX |
1999 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")