Seth Pettie
Computational Theory and Mathematics · 2000–2012
A researcher in the Science corpus: 4 papers; trusts 1 researcher and is trusted by 1 researcher here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 5 citations into it; #11,428 of 12,182 by trust here, #9,804 by citations
Whom Seth Pettie trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Seth Pettie overall
Papers from Seth Pettie's perspective
Ordered by how strongly the researchers Seth Pettie trusts endorse each paper. Same corpus, a different order for every researcher.
- Arboricity and Subgraph Listing Algorithms
- The Design and Analysis of Computer Algorithms
- A constructive proof of the general lovász local lemma (JACM)
- Balls and Bins: A Study in Negative Dependence
- On the evolution of random graphs
- Approximate distance oracles (JACM)
- Concentration of measure for the analysis of randomized algorithms by Devdatt P. Dubhashi and Alessandro Panconesi Cambridge University Press, 2009 (SIGA)
- The Inmates are Running the Asylum
- On Computable Numbers, with an Application to the Entscheidungsproblem.
- Visualizing Data using t-SNE
Their papers
- An optimal minimum spanning tree algorithm (2000) — 364 citations
- The Locality of Distributed Symmetry Breaking (2012) — 313 citations
- Mind the gap (2006) — 1,707 citations
- New constructions of (α, β)-spanners and purely additive spanners (2005) — 73 citations