The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Seth Pettie: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  22. Towards a Final Analysis of Pairing Heaps. [Citation Graph (, )][DBLP]


  23. Testudo: Heavyweight security analysis via statistical sampling. [Citation Graph (, )][DBLP]


  24. Distributed algorithms for ultrasparse spanners and linear size skeletons. [Citation Graph (, )][DBLP]


  25. Bounded-leg distance and reachability oracles. [Citation Graph (, )][DBLP]


  26. Splay trees, Davenport-Schinzel sequences, and the deque conjecture. [Citation Graph (, )][DBLP]


  27. Dual-failure distance and connectivity oracles. [Citation Graph (, )][DBLP]


  28. Fast algorithms for (max, min)-matrix multiplication and bottleneck shortest paths. [Citation Graph (, )][DBLP]


  29. Applications of Forbidden 0-1 Matrices to Search Tree and Path Compression-Based Data Structures. [Citation Graph (, )][DBLP]


  30. On Nonlinear Forbidden 0-1 Matrices: A Refutation of a Füredi-Hajnal Conjecture. [Citation Graph (, )][DBLP]


  31. Improved distributed approximate matching. [Citation Graph (, )][DBLP]


  32. Connectivity oracles for failure prone graphs. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.303secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002