Experimental Evaluation of a New Shortest Path Algorithm. - Seth Pettie; Vijaya Ramachandran; Srinath Sridhar 001 (ALENEX, 2002)

An Inverse-Ackermann Style Lower Bound for the Online Minimum Spanning Tree. - Seth Pettie (FOCS, 2002)

A Faster All-Pairs Shortest Path Algorithm for Real-Weighted Sparse Graphs. - Seth Pettie (ICALP, 2002)

On the Comparison-Addition Complexity of All-Pairs Shortest Paths. - Seth Pettie (ISAAC, 2002)

Computing shortest paths with comparisons and additions. - Seth Pettie; Vijaya Ramachandran (SODA, 2002)

Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms. - Seth Pettie; Vijaya Ramachandran (SODA, 2002)

The Dynamic Vertex Minimum Problem and Its Application to Clustering-Type Approximation Algorithms. - Harold N. Gabow; Seth Pettie (SWAT, 2002)

An optimal minimum spanning tree algorithm. - Seth Pettie; Vijaya Ramachandran (J. ACM, 2002)

A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest. - Seth Pettie; Vijaya Ramachandran (SIAM J. Comput., 2002)

A simpler linear time 2/3-epsilon approximation for maximum weight matching. - Seth Pettie; Peter Sanders 001 (Inf. Process. Lett., 2004)

A new approach to all-pairs shortest paths on real-weighted graphs. - Seth Pettie (Theor. Comput. Sci., 2004)

New constructions of (alpha, beta)-spanners and purely additive spanners. - Surender Baswana; Telikepalli Kavitha; Kurt Mehlhorn; Seth Pettie (SODA, 2005)

The Complexity of Implicit and Space Efficient Priority Queues. - Christian Worm Mortensen; Seth Pettie (WADS, 2005)

A Shortest Path Algorithm for Real-Weighted Undirected Graphs. - Seth Pettie; Vijaya Ramachandran (SIAM J. Comput., 2005)

Towards a Final Analysis of Pairing Heaps. - Seth Pettie (Data Structures, 2006)

An Inverse-Ackermann Type Lower Bound For Online Minimum Spanning Tree Verification. - Seth Pettie (Comb., 2006)

Sources of Superlinearity in Davenport-Schinzel Sequences. - Seth Pettie (Data Structures, 2008)

Testudo: Heavyweight security analysis via statistical sampling. - Joseph L. Greathouse; Ilya Wagner; David A. Ramos; Gautam Bhatnagar; Todd M. Austin; Valeria Bertacco; Seth Pettie (MICRO, 2008)

Bounded-leg distance and reachability oracles. - Ran Duan; Seth Pettie (SODA, 2008)

Splay trees, Davenport-Schinzel sequences, and the deque conjecture. - Seth Pettie (SODA, 2008)

Randomized minimum spanning tree algorithms using exponentially fewer random bits. - Seth Pettie; Vijaya Ramachandran (ACM Trans. Algorithms, 2008)

All Pairs Shortest Paths in Sparse Graphs. - Seth Pettie (Encyclopedia of Algorithms, 2008)

Minimum Spanning Trees. - Seth Pettie (Encyclopedia of Algorithms, 2008)

Single-Source Shortest Paths. - Seth Pettie (Encyclopedia of Algorithms, 2008)

Fast algorithms for (max, min)-matrix multiplication and bottleneck shortest paths. - Ran Duan; Seth Pettie (SODA, 2009)

Dual-failure distance and connectivity oracles. - Ran Duan; Seth Pettie (SODA, 2009)

Low distortion spanners. - Seth Pettie (ACM Trans. Algorithms, 2009)

Approximating Maximum Weight Matching in Near-Linear Time. - Ran Duan; Seth Pettie (FOCS, 2010)

On Nonlinear Forbidden 0-1 Matrices: A Refutation of a Füredi-Hajnal Conjecture. - Seth Pettie (SODA, 2010)

Applications of Forbidden 0-1 Matrices to Search Tree and Path Compression-Based Data Structures. - Seth Pettie (SODA, 2010)

Connectivity oracles for failure prone graphs. - Ran Duan; Seth Pettie (STOC, 2010)

Distributed algorithms for ultrasparse spanners and linear size skeletons. - Seth Pettie (Distributed Comput., 2010)

Additive spanners and (alpha, beta)-spanners. - Surender Baswana; Telikepalli Kavitha; Kurt Mehlhorn; Seth Pettie (ACM Trans. Algorithms, 2010)

On the structure and composition of forbidden sequences, with geometric applications. - Seth Pettie (SCG, 2011)

Scaling algorithms for approximate and exact maximum weight matching - Ran Duan; Seth Pettie; Hsin-Hao Su (CoRR, 2011)

Degrees of nonlinearity in forbidden 0-1 matrix problems. - Seth Pettie (Discret. Math., 2011)

Generalized Davenport-Schinzel sequences and their 0-1 matrix counterparts. - Seth Pettie (J. Comb. Theory A, 2011)

Origins of Nonlinearity in Davenport-Schinzel Sequences. - Seth Pettie (SIAM J. Discret. Math., 2011)

Connectivity Oracles for Planar Graphs. - Glencora Borradaile; Seth Pettie; Christian Wulff-Nilsen (SWAT, 2012)

Fast Distributed Algorithms for Maximal Matching and Maximal Independent Set - Leonid Barenboim; Michael Elkin; Seth Pettie; Johannes Schneider 002 (CoRR, 2012)

Tightish Bounds on Davenport-Schinzel Sequences - Seth Pettie (CoRR, 2012)

A simple reduction from maximum weight matching to maximum cardinality matching. - Seth Pettie (Inf. Process. Lett., 2012)

Special Section on the Forty-Third Annual ACM Symposium on Theory of Computing (STOC 2011). - Kousha Etessami; Dieter van Melkebeek; Seth Pettie; John Watrous; Salil P. Vadhan (SIAM J. Comput., 2012)

Fast Distributed Coloring Algorithms for Triangle-Free Graphs. - Seth Pettie; Hsin-Hao Su (ICALP (2), 2013)

(Near) optimal resource-competitive broadcast with jamming. - Seth Gilbert; Valerie King; Seth Pettie; Ely Porat; Jared Saia; Maxwell Young (SPAA, 2014)

Word-packing Algorithms for Dynamic Connectivity and Dynamic Sets. - Casper Kejlberg-Rasmussen; Tsvi Kopelowitz; Seth Pettie; Ely Porat (CoRR, 2014)

3SUM Hardness in (Dynamic) Data Structures. - Tsvi Kopelowitz; Seth Pettie; Ely Porat (CoRR, 2014)

Linear-Time Approximation for Maximum Weight Matching. - Ran Duan; Seth Pettie (J. ACM, 2014)

(2Δ - l)-Edge-Coloring is Much Easier than Maximal Matching in the Distributed Setting. - Michael Elkin; Seth Pettie; Hsin-Hao Su (SODA, 2015)

Sharp Bounds on Formation-free Sequences. - Seth Pettie (SODA, 2015)

Dynamic Set Intersection. - Tsvi Kopelowitz; Seth Pettie; Ely Porat (WADS, 2015)

Online Dictionary Matching with One Gap. - Amihood Amir; Tsvi Kopelowitz; Avivit Levy; Seth Pettie; Ely Porat; B. Riva Shalom (CoRR, 2015)

Deterministic Worst Case Dynamic Connectivity: Simpler and Faster. - Casper Kejlberg-Rasmussen; Tsvi Kopelowitz; Seth Pettie; Mikkel Thorup (CoRR, 2015)

Distributed coloring algorithms for triangle-free graphs. - Seth Pettie; Hsin-Hao Su (Inf. Comput., 2015)

Improved Distributed Approximate Matching. - Zvi Lotker; Boaz Patt-Shamir; Seth Pettie (J. ACM, 2015)

Sharp Bounds on Davenport-Schinzel Sequences of Every Order. - Seth Pettie (J. ACM, 2015)

Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time. - Seth Pettie (J. Graph Algorithms Appl., 2015)

Three Generalizations of Davenport-Schinzel Sequences. - Seth Pettie (SIAM J. Discret. Math., 2015)

Resource-Competitive Algorithms. - Michael A. Bender; Jeremy T. Fineman; Mahnush Movahedi; Jared Saia; Varsha Dani; Seth Gilbert; Seth Pettie; Maxwell Young (SIGACT News, 2015)

Faster Worst Case Deterministic Dynamic Connectivity. - Casper Kejlberg-Rasmussen; Tsvi Kopelowitz; Seth Pettie; Mikkel Thorup (ESA, 2016)

Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap. - Amihood Amir; Tsvi Kopelowitz; Avivit Levy; Seth Pettie; Ely Porat; B. Riva Shalom (ISAAC, 2016)

Brief Announcement: An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model. - Yi-Jun Chang; Tsvi Kopelowitz; Seth Pettie (PODC, 2016)

Higher Lower Bounds from the 3SUM Conjecture. - Tsvi Kopelowitz; Seth Pettie; Ely Porat (SODA, 2016)

Contention resolution with log-logstar channel accesses. - Michael A. Bender; Tsvi Kopelowitz; Seth Pettie; Maxwell Young (STOC, 2016)

How to Elect a Low-energy Leader. - Yi-Jun Chang; Tsvi Kopelowitz; Seth Pettie; Ruosong Wang; Wei Zhan (CoRR, 2016)

Fully Dynamic Connectivity in O(log n(log log n)2) Amortized Expected Time. - Shang-En Huang; Dawei Huang; Tsvi Kopelowitz; Seth Pettie (CoRR, 2016)

Structure and Hardness in P (Dagstuhl Seminar 16451). - Moshe Lewenstein; Seth Pettie; Virginia Vassilevska Williams (Dagstuhl Reports, 2016)

The Locality of Distributed Symmetry Breaking. - Leonid Barenboim; Michael Elkin; Seth Pettie; Johannes Schneider 002 (J. ACM, 2016)

A Linear-Size Logarithmic Stretch Path-Reporting Distance Oracle for General Graphs. - Michael Elkin; Seth Pettie (ACM Trans. Algorithms, 2016)

All Pairs Shortest Paths in Sparse Graphs. - Seth Pettie (Encyclopedia of Algorithms, 2016)

Minimum Spanning Trees. - Seth Pettie (Encyclopedia of Algorithms, 2016)

Single-Source Shortest Paths. - Seth Pettie (Encyclopedia of Algorithms, 2016)

Simultaneously Load Balancing for Every p-norm, With Reassignments. - Aaron Bernstein; Tsvi Kopelowitz; Seth Pettie; Ely Porat; Clifford Stein 001 (ITCS, 2017)

Fully Dynamic Connectivity in O(log n(log log n)2) Amortized Expected Time. - Shang-En Huang; Dawei Huang; Tsvi Kopelowitz; Seth Pettie (SODA, 2017)

Approximate Generalized Matching: $f$-Factors and $f$-Edge Covers. - Dawei Huang; Seth Pettie (CoRR, 2017)

Distributed algorithms for the Lovász local lemma and graph coloring. - Kai-Min Chung; Seth Pettie; Hsin-Hao Su (Distributed Comput., 2017)

Fine-grained Lower Bounds on Cops and Robbers. - Sebastian Brandt 002; Seth Pettie; Jara Uitto (ESA, 2018)

Improved Bounds for Multipass Pairing Heaps and Path-Balanced Binary Search Trees. - Dani Dorfman; Haim Kaplan; László Kozma 002; Seth Pettie; Uri Zwick (ESA, 2018)

The Energy Complexity of Broadcast. - Yi-Jun Chang; Varsha Dani; Thomas P. Hayes; Qizheng He; Wenzheng Li; Seth Pettie (PODC, 2018)

The Complexity of Distributed Edge Coloring with Small Palettes. - Yi-Jun Chang; Qizheng He; Wenzheng Li; Seth Pettie; Jara Uitto (SODA, 2018)

An optimal distributed (Δ+1)-coloring algorithm? - Yi-Jun Chang; Wenzheng Li; Seth Pettie (STOC, 2018)

A resource-competitive jamming defense. - Valerie King; Seth Pettie; Jared Saia; Maxwell Young (Distributed Comput., 2018)

Lower bounds on Davenport-Schinzel sequences via rectangular Zarankiewicz matrices. - Julian Wellman; Seth Pettie (Discret. Math., 2018)

Threesomes, Degenerates, and Love Triangles. - Allan Grønlund; Seth Pettie (J. ACM, 2018)

A Hierarchy of Lower Bounds for Sublinear Additive Spanners. - Amir Abboud; Greg Bodwin; Seth Pettie (SIAM J. Comput., 2018)

Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses. - Michael A. Bender; Tsvi Kopelowitz; Seth Pettie; Maxwell Young (SIAM J. Comput., 2018)

Scaling Algorithms for Weighted Matching in General Graphs. - Ran Duan; Seth Pettie; Hsin-Hao Su (ACM Trans. Algorithms, 2018)

Simple Contention Resolution via Multiplicative Weight Updates. - Yi-Jun Chang; Wenyu Jin 001; Seth Pettie (SOSA, 2019)

Distributed Triangle Detection via Expander Decomposition. - Yi-Jun Chang; Seth Pettie; Hengjie Zhang (SODA, 2019)

Mind the Gap! - Online Dictionary Matching with One Gap. - Amihood Amir; Tsvi Kopelowitz; Avivit Levy; Seth Pettie; Ely Porat; B. Riva Shalom (Algorithmica, 2019)

Joins on Samples: A Theoretical Guide for Practitioners. - Dawei Huang; Dong Young Yoon; Seth Pettie; Barzan Mozafari (CoRR, 2019)

Thorup-Zwick emulators are universally optimal hopsets. - Shang-En Huang; Seth Pettie (Inf. Process. Lett., 2019)

Join on Samples: A Theoretical Guide for Practitioners. - Dawei Huang; Dong Young Yoon; Seth Pettie; Barzan Mozafari (Proc. VLDB Endow., 2019)

An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model. - Yi-Jun Chang; Tsvi Kopelowitz; Seth Pettie (SIAM J. Comput., 2019)

A Time Hierarchy Theorem for the LOCAL Model. - Yi-Jun Chang; Seth Pettie (SIAM J. Comput., 2019)

Exponential Separations in the Energy Complexity of Leader Election. - Yi-Jun Chang; Tsvi Kopelowitz; Seth Pettie; Ruosong Wang; Wei Zhan (ACM Trans. Algorithms, 2019)

The Energy Complexity of BFS in Radio Networks. - Yi-Jun Chang; Varsha Dani; Thomas P. Hayes; Seth Pettie (PODC, 2020)

Contention resolution without collision detection. - Michael A. Bender; Tsvi Kopelowitz; William Kuszmaul; Seth Pettie (STOC, 2020)

Simple and Efficient Cardinality Estimation in Data Streams. - Seth Pettie; Dingyu Wang; Longhui Yin (CoRR, 2020)

Distributed (Δ+1)-Coloring via Ultrafast Graph Shattering. - Yi-Jun Chang; Wenzheng Li; Seth Pettie (SIAM J. Comput., 2020)

Connectivity Oracles for Graphs Subject to Vertex Failures. - Ran Duan; Seth Pettie (SIAM J. Comput., 2020)

Distributed Edge Coloring and a Special Case of the Constructive Lovász Local Lemma. - Yi-Jun Chang; Qizheng He; Wenzheng Li; Seth Pettie; Jara Uitto (ACM Trans. Algorithms, 2020)

Incremental SCC Maintenance in Sparse Graphs. - Aaron Bernstein; Aditi Dudeja; Seth Pettie (ESA, 2021)

Non-Mergeable Sketching for Cardinality Estimation. - Seth Pettie; Dingyu Wang; Longhui Yin (ICALP, 2021)

The Structure of Minimum Vertex Cuts. - Seth Pettie; Longhui Yin (ICALP, 2021)

Brief Announcement: Wake Up and Join Me! An Energy Efficient Algorithm for Maximal Matching in Radio Networks. - Varsha Dani; Aayush Gupta; Thomas P. Hayes; Seth Pettie (PODC, 2021)

Planar Distance Oracles with Better Time-Space Tradeoffs. - Yaowei Long; Seth Pettie (SODA, 2021)

Information theoretic limits of cardinality estimation: Fisher meets Shannon. - Seth Pettie; Dingyu Wang (STOC, 2021)

Near-optimal Distributed Triangle Enumeration via Expander Decompositions. - Yi-Jun Chang; Seth Pettie; Thatchaphol Saranurak; Hengjie Zhang (J. ACM, 2021)

The Communication Complexity of Set Intersection and Multiple Equality Testing. - Dawei Huang; Seth Pettie; Yixiang Zhang; Zhijun Zhang 007 (SIAM J. Comput., 2021)

Lower Bounds on Sparse Spanners, Emulators, and Diameter-Reducing Shortcuts. - Shang-En Huang; Seth Pettie (SIAM J. Discret. Math., 2021)

Byzantine agreement in polynomial time with near-optimal resilience. - Shang-En Huang; Seth Pettie; Leqi Zhu (STOC, 2022)

Optimal vertex connectivity oracles. - Seth Pettie; Thatchaphol Saranurak; Longhui Yin (STOC, 2022)

Approximate Generalized Matching: f-Matchings and f-Edge Covers. - Dawei Huang; Seth Pettie (Algorithmica, 2022)

Simpler and Better Cardinality Estimators for HyperLogLog and PCSA. - Seth Pettie; Dingyu Wang (CoRR, 2022)

Better Cardinality Estimators for HyperLogLog, PCSA, and Beyond. - Dingyu Wang; Seth Pettie (PODS, 2023)

Connectivity Labeling for Multiple Vertex Failures. - Merav Parter; Asaf Petruschka; Seth Pettie (CoRR, 2023)

Fully Dynamic Connectivity in O(log n(loglog n)2) Amortized Expected Time. - Shang-En Huang; Dawei Huang; Tsvi Kopelowitz; Seth Pettie; Mikkel Thorup (TheoretiCS, 2023)

Almost Optimal Exact Distance Oracles for Planar Graphs. - Panagiotis Charalampopoulos; Pawel Gawrychowski; Yaowei Long; Shay Mozes; Seth Pettie; Oren Weimann; Christian Wulff-Nilsen (J. ACM, 2023)

Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks. - Varsha Dani; Aayush Gupta; Thomas P. Hayes; Seth Pettie (Distributed Comput., 2023)

Fraud Detection for Random Walks. - Varsha Dani; Thomas P. Hayes; Seth Pettie; Jared Saia (ITCS, 2024)

Sorting Pattern-Avoiding Permutations via 0-1 Matrices Forbidding Product Patterns. - Parinya Chalermsook; Seth Pettie; Sorrachai Yingchareonthawornchai (SODA, 2024)

On the Extremal Functions of Acyclic Forbidden 0-1 Matrices. - Seth Pettie; Gábor Tardos (SODA, 2024)

Connectivity Labeling and Routing with Multiple Vertex Failures. - Merav Parter; Asaf Petruschka; Seth Pettie (STOC, 2024)

Fourier Transform-based Estimators for Data Sketches. - Seth Pettie; Dingyu Wang (CoRR, 2024)

Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection. - Shang-En Huang; Seth Pettie; Leqi Zhu (J. ACM, 2024)

Sketching, Moment Estimation, and the Lévy-Khintchine Representation Theorem. - Seth Pettie; Dingyu Wang (ITCS, 2025)

Connectivity Labeling Schemes for Edge and Vertex Faults via Expander Hierarchies. - Yaowei Long; Seth Pettie; Thatchaphol Saranurak (SODA, 2025)

A Refutation of the Pach-Tardos Conjecture for 0-1 Matrices. - Seth Pettie; Gábor Tardos (SODA, 2025)

Universal Perfect Samplers for Incremental Streams. - Seth Pettie; Dingyu Wang (SODA, 2025)

The Squishy Grid Problem. - Zixi Cai; Kuowen Chen; Shengquan Du; Arnold Filtser; Seth Pettie; Daniel Skora (CoRR, 2025)