Projects
Reading
People
Chat
SU\G
(đ¸)
/K¡U
Projects
Reading
People
Chat
Sign Up
Light
Dark
System
Seth Pettie
Follow
Share
Generating author description...
All published works
Action
Title
Year
Authors
+
PDF
Chat
Sketching, Moment Estimation, and the L\'evy-Khintchine Representation Theorem
2024
Seth Pettie
Dingyu Wang
+
PDF
Chat
Fourier Transform-based Estimators for Data Sketches
2024
Seth Pettie
Dingyu Wang
+
PDF
Chat
Sorting Pattern-Avoiding Permutations via 0-1 Matrices Forbidding Product Patterns
2024
Parinya Chalermsook
Seth Pettie
Sorrachai Yingchareonthawornchai
+
Sorting Pattern-Avoiding Permutations via 0-1 Matrices Forbidding Product Patterns
2023
Parinya Chalermsook
Seth Pettie
Sorrachai Yingchareonthawornchai
+
Simpler and Better Cardinality Estimators for HyperLogLog and PCSA
2022
Seth Pettie
Dingyu Wang
+
Lower bounds on DavenportâSchinzel sequences via rectangular Zarankiewicz matrices
2018
Julian Wellman
Seth Pettie
+
Lower Bounds on Davenport-Schinzel Sequences via Rectangular Zarankiewicz Matrices
2016
Julian Wellman
Seth Pettie
+
PDF
Chat
Three Generalizations of Davenport--Schinzel Sequences
2015
Seth Pettie
+
Three Generalizations of Davenport-Schinzel Sequences
2014
Seth Pettie
+
Three Generalizations of Davenport-Schinzel Sequences
2014
Seth Pettie
+
Generalized DavenportâSchinzel sequences and their 0â1 matrix counterparts
2011
Seth Pettie
+
Splay trees, Davenport-Schinzel sequences, and the deque conjecture
2008
Seth Pettie
+
Sources of Superlinearity in Davenport-Schinzel Sequences
2007
Seth Pettie
+
Sources of Superlinearity in Davenport-Schinzel Sequences
2007
Seth Pettie
+
Splay Trees, Davenport-Schinzel Sequences, and the Deque Conjecture
2007
Seth Pettie
+
Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time
2005
Seth Pettie
Xiaotie Deng
DingâZhu Du
Common Coauthors
Coauthor
Papers Together
Parinya Chalermsook
2
Dingyu Wang
2
Julian Wellman
2
Sorrachai Yingchareonthawornchai
2
Xiaotie Deng
1
Dingyu Wang
1
DingâZhu Du
1
Commonly Cited References
Action
Title
Year
Authors
# of times referenced
+
Generalized Davenport-Schinzel sequences with linear upper bound
1992
Radek Adamec
Martin Klazar
PĂĄvel Valtr
6
+
PDF
Chat
Generalized Davenport-Schinzel sequences
1994
Martin Klazar
PĂĄvel Valtr
6
+
PDF
Chat
Improved bounds and new techniques for Davenport--Schinzel sequences and their generalizations
2010
Gabriel Nivasch
5
+
A general upper bound in extremal theory of sequences
1992
Martin Klazar
5
+
PDF
Chat
Sharp Bounds on Davenport-Schinzel Sequences of Every Order
2015
Seth Pettie
3
+
Splay trees, Davenport-Schinzel sequences, and the deque conjecture
2008
Seth Pettie
3
+
Generalized DavenportâSchinzel sequences and their 0â1 matrix counterparts
2011
Seth Pettie
3
+
On 0â1 matrices and small excluded submatrices
2005
GĂĄbor Tardos
3
+
New Asymptotics for Bipartite TurĂĄn Numbers
1996
ZoltĂĄn FĂźredi
2
+
On a combinatorial problem
1948
FA Dick de Bruijn
P. ErdĹs
2
+
PDF
Chat
On Graphs that do not Contain a Thomsen Graph
1966
William G. Brown
2
+
Tight bounds on the maximum size of a set of permutations with bounded VC-dimension
2012
Josef Cibulka
Jan KynÄl
2
+
Splay trees: a reweighing lemma and a proof of competitiveness vs. dynamic balanced trees
2004
George Georgakopoulos
2
+
PDF
Chat
Improved Upper Bounds for Pairing Heaps
2000
John Iacono
2
+
PDF
Chat
On a problem of Davenport and Schinzel
1974
Endre SzemerĂŠdi
2
+
Two results on a partial ordering of finite sequences
1993
Martin Klazar
2
+
Norm-graphs and bipartite tur�n numbers
1996
J�nos Koll�r
Lajos R�nyai
Tibor Szabďż˝
2
+
PDF
Chat
Three Generalizations of Davenport--Schinzel Sequences
2015
Seth Pettie
2
+
PDF
Chat
The History of Degenerate (Bipartite) Extremal Graph Problems
2013
ZoltĂĄn FĂźredi
MiklĂłs Simonovits
2
+
PDF
Chat
On a combinatorical problem
1958
C. HyltĂŠn-Cavallius
1
+
Complexity of Monotone Networks for Computing Conjunctions
1978
Robert E. Tarjan
1
+
PDF
Chat
Graph drawing with no k pairwise crossing edges
1997
PĂĄvel Valtr
1
+
Extremal problems for ordered (hyper)graphs: applications of DavenportâSchinzel sequences
2003
Martin Klazar
1
+
PDF
Chat
Splaying a search tree in preorder takes linear time
1990
Ranjan Chaudhuri
Hartmut HĂśft
1
+
Geometric applications of a matrix-searching algorithm
1987
Alok Aggarwal
Maria Klawe
Shlomo Moran
Peter W. Shor
Robert Wilber
1
+
Extremal functions of forbidden double permutation matrices
2009
Jesse Geneson
1
+
PDF
Chat
The Number of Edges in $k$-Quasi-planar Graphs
2013
Jacob Fox
JĂĄnos Pach
Andrew Suk
1
+
Linear bound on extremal functions of some forbidden patterns in 0â1 matrices
2008
Radoslav Fulek
1
+
Excluded permutation matrices and the StanleyâWilf conjecture
2004
Adam W. Marcus
GĂĄbor Tardos
1
+
Improved lower bounds on the length of Davenport-Schinzel sequences
1988
Micha Sharir
1
+
Perspectives of Monge properties in optimization
1996
Rainer E. Burkard
Bettina Klinz
RĂźdiger Rudolf
1
+
The number of edges in k-quasi-planar graphs
2011
Jacob Fox
JĂĄnos Pach
Andrew Suk
1
+
$k$-quasi planar graphs
2011
Andrew Suk
1
+
PDF
Chat
Sharp bounds on Davenport-Schinzel sequences of every order
2013
Seth Pettie
1
+
PDF
Chat
Bounding Sequence Extremal Functions with Formations
2014
Jesse Geneson
Rohil Prasad
Jonathan Tidor
1