Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Pettie, Seth"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Linear-time approximation for maximum weight matching
Ran Duan
,
Seth Pettie
Journal of the ACM
61
(1), 2014, pp. 1: 1-23
Fast distributed coloring algorithms for triangle-free graphs
Seth Pettie
,
Hsin-Hao Su
Lecture Notes in Computer Science
7966
, 2013, pp. 681-693
Sharp bounds on Davenport-Schinzel sequences of every order
Seth Pettie
Proceedings of the 29th Annual ACM Symposium on Computional Geometry, SoCG'2013 (Rio de Janeiro, Brazil, June 17-20, 2013)
, 2013, pp. 319-328
Connectivity oracles for planar graphs
Glencora Borradaile
,
Seth Pettie
,
Christian Wulff-Nilsen
Lecture Notes in Computer Science
7357
, 2012, pp. 316-327
Origins of nonlinearity in Davenport-Schinzel sequences
Seth Pettie
SIAM Journal on Discrete Mathematics
25
(1), 2011, pp. 211-233
Connectivity oracles for failure prone graphs
Ran Duan
,
Seth Pettie
Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC'2010 (Cambridge, Massachusetts, June 5-8, 2010)
, 2010, pp. 465-474
Improved distributed approximate matching
Zvi Lotker
,
Boaz Patt-Shamir
,
Seth Pettie
Proceedings of the 20th Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2008 (Munich, Germany, June 14-16, 2008)
, 2008, pp. 129-136
Low distortion spanners
Seth Pettie
Lecture Notes in Computer Science
4596
, 2007, pp. 78-89
An inverse-Ackermann type lower bound for online minimum spanning tree verification
Seth Pettie
Combinatorica
26
(2), 2006, pp. 207-230
The complexity of implicit and space efficient priority queues
Christian W. Mortensen
,
Seth Pettie
Lecture Notes in Computer Science
3608
, 2005, pp. 49-60
A shortest path algorithm for real-weighted undirected graphs
Seth Pettie
,
Vijaya Ramachandran
SIAM Journal on Computing
34
(6), 2005, pp. 1398-1431
Sensitivity analysis of minimum spanning trees in sub-inverse-Ackermann time
Seth Pettie
Lecture Notes in Computer Science
3827
, 2005, pp. 964-973
A simpler linear time
2/3 - \varepsilon
approximation for maximum weight matching
Seth Pettie
,
Peter Sanders
Information Processing Letters
91
(6), 2004, pp. 271-276
A new approach to all-pairs shortest paths on real-weighted graphs
Seth Pettie
Theoretical Computer Science
312
(1), 2004, pp. 47-74
The dynamic vertex minimum problem and its application to clustering-type approximation algorithms
Harold N. Gabow
,
Seth Pettie
Lecture Notes in Computer Science
2368
, 2002, pp. 190-199
Experimental evaluation of a new shortest path algorithm
Seth Pettie
,
Vijaya Ramachandran
,
Srinath Sridhar
Lecture Notes in Computer Science
2409
, 2002, pp. 126-142
An optimal minimum spanning tree algorithm
Seth Pettie
,
Vijaya Ramachandran
Journal of the ACM
49
(1), 2002, pp. 16-34
A randomized time-work optimal parallel algorithm for finding a minimum spanning forest
Seth Pettie
,
Vijaya Ramachandran
SIAM Journal on Computing
31
(6), 2002, pp. 1879-1895
An inverse-Ackermann style lower bound for the online minimum spanning tree verification problem
Seth Pettie
Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'2002 (Vancouver, BC, Canada, November 16-19, 2002)
, 2002, pp. 155-163
A faster all-pairs shortest path algorithm for real-weighted sparse graphs
Seth Pettie
Lecture Notes in Computer Science
2380
, 2002, pp. 85-97
On the comparison-addition complexity of all-pairs shortest paths
Seth Pettie
Lecture Notes in Computer Science
2518
, 2002, pp. 32-43
An optimal minimum spanning tree algorithm
Seth Pettie
,
Vijaya Ramachandran
Lecture Notes in Computer Science
1853
, 2000, pp. 49-60
A randomized time-work optimal parallel algorithm for finding a minimum spanning forest
Seth Pettie
,
Vijaya Ramachandran
Lecture Notes in Computer Science
1671
, 1999, pp. 233-244
A randomized time-work optimal parallel algorithm for finding a minimum spanning forest
Seth Pettie
,
Vijaya Ramachandran
Technical Report (TR99-13), 1999, April
An optimal minimum spanning tree algorithm
Seth Pettie
,
Vijaya Ramachandran
Technical Report (TR99-17), 1999, August