Seth Pettie

4.0k total citations
94 papers, 1.5k citations indexed

About

Seth Pettie is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Seth Pettie has authored 94 papers receiving a total of 1.5k indexed citations (citations by other indexed papers that have themselves been cited), including 68 papers in Computational Theory and Mathematics, 46 papers in Computer Networks and Communications and 44 papers in Artificial Intelligence. Recurrent topics in Seth Pettie's work include Complexity and Algorithms in Graphs (62 papers), Advanced Graph Theory Research (30 papers) and Optimization and Search Problems (28 papers). Seth Pettie is often cited by papers focused on Complexity and Algorithms in Graphs (62 papers), Advanced Graph Theory Research (30 papers) and Optimization and Search Problems (28 papers). Seth Pettie collaborates with scholars based in United States, Israel and Germany. Seth Pettie's co-authors include Vijaya Ramachandran, Ran Duan, Yi‐Jun Chang, Michael Elkin, Tsvi Kopelowitz, Leonid Barenboim, Johannes Schneider, Zvi Lotker, Boaz Patt-Shamir and Peter Sanders and has published in prestigious journals such as SHILAP Revista de lepidopterología, Journal of the ACM and SIAM Journal on Computing.

In The Last Decade

Seth Pettie

91 papers receiving 1.4k citations

Peers

Seth Pettie
Robert Krauthgamer Israel
Dimitrios M. Thilikos Greece
Yair Bartal Israel
Torben Hagerup Germany
Jayme L. Szwarcfiter Brazil
Friedhelm Meyer auf der Heide Germany
Liam Roditty Israel
Fabrizio Grandoni Switzerland
Harry B. Hunt United States
Harald Räcke United States
Robert Krauthgamer Israel
Seth Pettie
Citations per year, relative to Seth Pettie Seth Pettie (= 1×) peers Robert Krauthgamer

Countries citing papers authored by Seth Pettie

Since Specialization
Citations

This map shows the geographic impact of Seth Pettie's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Seth Pettie with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Seth Pettie more than expected).

Fields of papers citing papers by Seth Pettie

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Seth Pettie. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Seth Pettie. The network helps show where Seth Pettie may publish in the future.

Co-authorship network of co-authors of Seth Pettie

This figure shows the co-authorship network connecting the top 25 collaborators of Seth Pettie. A scholar is included among the top collaborators of Seth Pettie based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Seth Pettie. Seth Pettie is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Huang, Dawei, et al.. (2023). Fully Dynamic Connectivity in $O(\log n(\log\log n)^2)$ Amortized Expected Time. SHILAP Revista de lepidopterología. Volume 2.
2.
Chang, Yi‐Jun, et al.. (2019). Distributed triangle detection via expander decomposition. arXiv (Cornell University). 821–840. 5 indexed citations
3.
Pettie, Seth, et al.. (2018). Lower Bounds on Sparse Spanners, Emulators, and Diameter-reducing shortcuts. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 101. 12. 1 indexed citations
4.
Kaplan, Haim, et al.. (2018). Improved bounds for multipass pairing heaps and path-balanced binary search trees. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1–13. 2 indexed citations
5.
Huang, Dawei, et al.. (2017). Fully dynamic connectivity in O(log n(log log n)2) amortized expected time. arXiv (Cornell University). 510–520. 7 indexed citations
6.
Abboud, Amir, et al.. (2017). A hierarchy of lower bounds for sublinear additive spanners. Symposium on Discrete Algorithms. 568–576. 8 indexed citations
7.
Kopelowitz, Tsvi, Seth Pettie, & Ely Porat. (2016). Higher lower bounds from the 3SUM conjecture. Symposium on Discrete Algorithms. 1272–1287. 16 indexed citations
8.
Elkin, Michael & Seth Pettie. (2016). A Linear-Size Logarithmic Stretch Path-Reporting Distance Oracle for General Graphs. ACM Transactions on Algorithms. 12(4). 1–31. 7 indexed citations
9.
Elkin, Michael & Seth Pettie. (2015). A linear-size logarithmic stretch path-reporting distance oracle for general graphs. Symposium on Discrete Algorithms. 805–821. 3 indexed citations
10.
Elkin, Michael, et al.. (2015). (2Δ − 1)-edge-coloring is much easier than maximal matching in the distributed setting. 20 indexed citations
11.
Pettie, Seth. (2012). Tightish Bounds on Davenport-Schinzel Sequences. arXiv (Cornell University). 1 indexed citations
12.
13.
Duan, Ran & Seth Pettie. (2009). Dual-failure distance and connectivity oracles. Symposium on Discrete Algorithms. 506–515. 25 indexed citations
14.
Duan, Ran & Seth Pettie. (2009). Fast algorithms for (max, min)-matrix multiplication and bottleneck shortest paths. Symposium on Discrete Algorithms. 384–391. 21 indexed citations
15.
Duan, Ran & Seth Pettie. (2008). Bounded-leg distance and reachability oracles. Symposium on Discrete Algorithms. 436–445. 1 indexed citations
16.
Baswana, Surender, Telikepalli Kavitha, Kurt Mehlhorn, & Seth Pettie. (2005). New Constructions of (alpha, beta)-Spanners and Purely Additive Spanners. Max Planck Institute for Plasma Physics. 672–681. 3 indexed citations
17.
Pettie, Seth. (2003). A new approach to all-pairs shortest paths on real-weighted graphs. Theoretical Computer Science. 312(1). 47–74. 108 indexed citations
18.
Pettie, Seth & Vijaya Ramachandran. (2002). Computing shortest paths with comparisons and additions. Symposium on Discrete Algorithms. 267–276. 29 indexed citations
19.
Pettie, Seth. (2002). An Inverse-Ackermann Style Lower Bound for the Online Minimum Spanning Tree. 155. 2 indexed citations
20.
Pettie, Seth & Vijaya Ramachandran. (2002). Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms. Symposium on Discrete Algorithms. 713–722. 15 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Robert Krauthgamer Breakdown of academic impact, for papers by Dimitrios M. Thilikos Breakdown of academic impact, for papers by Yair Bartal Breakdown of academic impact, for papers by Torben Hagerup Breakdown of academic impact, for papers by Jayme L. Szwarcfiter Breakdown of academic impact, for papers by Friedhelm Meyer auf der Heide Breakdown of academic impact, for papers by Liam Roditty Breakdown of academic impact, for papers by Fabrizio Grandoni Breakdown of academic impact, for papers by Harry B. Hunt Breakdown of academic impact, for papers by Harald Räcke
Rankless by CCL
2026