On the public citation graph

Almost linear upper bounds on the length of general davenport—schinzel sequences

https://doi.org/10.1007/bf02579209
0 signed · 70 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01459088openalex-snapshot
Zum Hilbertschen Aufbau der reellen Zahlen
inferredcites →https://doi.org/10.1007/bf02579170openalex-snapshot
Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemes
inferredcites →https://doi.org/10.1109/sfcs.1983.13openalex-snapshot
Dynamic computational geometry
inferredcites →https://doi.org/10.1145/321879.321884openalex-snapshot
Efficiency of a Good But Not Linear Set Union Algorithm
inferredcites →https://doi.org/10.2307/2373068openalex-snapshot
A Combinatorial Problem Connected with Differential Equations
inferredcites →https://doi.org/10.4064/aa-17-4-355-362openalex-snapshot
Some properties of Davenport-Schinzel sequences
inferredcites →https://doi.org/10.4064/aa-17-4-363-372openalex-snapshot
A combinatorial problem connected with differential equations II
inferredcites →https://doi.org/10.4064/aa-25-2-213-224openalex-snapshot
On a problem of Davenport and Schinzel

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jagm.1994.1019openalex-snapshot
Parametric Problems on Graphs of Bounded Tree-Width
inferred← citeshttps://doi.org/10.1007/3-540-18088-5_30openalex-snapshot
On the bivariate function minimization problem and its applications to motion planning
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_118openalex-snapshot
Arrangements of curves in the plane — topology, combinatorics, and algorithms
inferred← citeshttps://doi.org/10.1007/3-540-53487-3_49openalex-snapshot
Voronoi diagrams of moving points in the plane
inferred← citeshttps://doi.org/10.1007/978-0-387-26677-0_6openalex-snapshot
Sequences of Integers
inferred← citeshttps://doi.org/10.1007/978-1-4899-3585-4_6openalex-snapshot
Sequences of Integers
inferred← citeshttps://doi.org/10.1007/978-3-0348-9078-6_129openalex-snapshot
Extremal Hypergraphs and Combinatorial Geometry
inferred← citeshttps://doi.org/10.1007/978-3-642-58043-7_2openalex-snapshot
Combinatorics and Algorithms of Arrangements
inferred← citeshttps://doi.org/10.1007/978-3-642-83539-1_4openalex-snapshot
Ruler, Compass and Computer
inferred← citeshttps://doi.org/10.1007/978-3-642-83539-1_9openalex-snapshot
Davenport-Schinzel Sequences and their Geometric Applications
inferred← citeshttps://doi.org/10.1007/bf00127827openalex-snapshot
Dynamic computational geometry on meshes and hypercubes
inferred← citeshttps://doi.org/10.1007/bf01187019openalex-snapshot
Visibility with a moving point of view
inferred← citeshttps://doi.org/10.1007/bf01302967openalex-snapshot
Generalized Davenport-Schinzel sequences
inferred← citeshttps://doi.org/10.1007/bf01840348openalex-snapshot
Generalized Voronoi diagrams for a ladder: II. Efficient construction of the diagram
inferred← citeshttps://doi.org/10.1007/bf02122559openalex-snapshot
Improved lower bounds on the length of Davenport-Schinzel sequences
inferred← citeshttps://doi.org/10.1007/bf02187732openalex-snapshot
The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis
inferred← citeshttps://doi.org/10.1007/bf02187744openalex-snapshot
On the general motion-planning problem with two degrees of freedom
inferred← citeshttps://doi.org/10.1007/bf02187745openalex-snapshot
On arrangements of Jordan arcs with three intersections per pair
inferred← citeshttps://doi.org/10.1007/bf02187778openalex-snapshot
The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2
inferred← citeshttps://doi.org/10.1007/bf02187779openalex-snapshot
An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space
inferred← citeshttps://doi.org/10.1007/bf02187883openalex-snapshot
On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space
inferred← citeshttps://doi.org/10.1007/bf02187894openalex-snapshot
Planar realizations of nonlinear davenport-schinzel sequences by segments
inferred← citeshttps://doi.org/10.1007/bf02579170openalex-snapshot
Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemes
inferred← citeshttps://doi.org/10.1007/bfb0035831openalex-snapshot
Solving parametric problems on trees
inferred← citeshttps://doi.org/10.1016/0004-3702(88)90053-7openalex-snapshot
A survey of motion planning and related geometric algorithms
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90316-8openalex-snapshot
Davenport-Schinzel theory of matrices
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90677-8openalex-snapshot
Generalized Davenport-Schinzel sequences with linear upper bound
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00188-3openalex-snapshot
Extremal functions for sequences
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90193-2openalex-snapshot
Common intersections of polygons
inferred← citeshttps://doi.org/10.1016/0097-3165(88)90055-6openalex-snapshot
A simplified construction of nonlinear Davenport-Schinzel sequences
inferred← citeshttps://doi.org/10.1016/0097-3165(89)90032-0openalex-snapshot
Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
inferred← citeshttps://doi.org/10.1016/0097-3165(94)90115-5openalex-snapshot
A linear upper bound in extremal theory of sequences
inferred← citeshttps://doi.org/10.1016/0196-6774(89)90035-7openalex-snapshot
Solving parametric problems on trees
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50013-8openalex-snapshot
Algorithmic Motion Planning in Robotics
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50002-4openalex-snapshot
Davenport–Schinzel Sequences and Their Geometric Applications**Both authors have been supported by a grant from the U.S.–Israeli Binational Science Foundation. Pankaj Agarwal has also been supported by a National Science Foundation Grant CCR-93–01259, by an Army Research Office MURI grant…
inferred← citeshttps://doi.org/10.1016/j.disc.2008.12.014openalex-snapshot
Random regular graphs of non-constant degree: Concentration of the chromatic number
inferred← citeshttps://doi.org/10.1016/j.jcta.2011.02.011openalex-snapshot
Generalized Davenport–Schinzel sequences and their 0–1 matrix counterparts
inferred← citeshttps://doi.org/10.1016/s0747-7171(08)80070-3openalex-snapshot
On the two-dimensional davenport-schinzel problem
inferred← citeshttps://doi.org/10.1016/s0747-7171(89)80003-3openalex-snapshot
Visibility problems for polyhedral terrains
inferred← citeshttps://doi.org/10.1051/ita/1992260503871openalex-snapshot
Enumerating Davenport-Schinzel sequences
inferred← citeshttps://doi.org/10.1109/2.16221openalex-snapshot
Algorithmic motion planning in robotics
inferred← citeshttps://doi.org/10.1109/robot.1987.1087897openalex-snapshot
Efficient algorithms for planning purely translational collision-free motion in two and three dimensions
inferred← citeshttps://doi.org/10.1109/sfcs.1985.40openalex-snapshot
On minima of function, intersection patterns of curves, and davenport-schinzel sequences
inferred← citeshttps://doi.org/10.1109/sfcs.1986.23openalex-snapshot
Geometric applications of Davenport-Schinzel sequences
inferred← citeshttps://doi.org/10.1109/sfcs.1986.43openalex-snapshot
Planar realizations of nonlinear Davenport-Schinzel sequences by segments
inferred← citeshttps://doi.org/10.1109/sfcs.1987.44openalex-snapshot
On the lower envelope of bivariate functions and its applications
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185439openalex-snapshot
Using approximation algorithms to design parallel algorithms that may ignore processor allocation
inferred← citeshttps://doi.org/10.1137/0401038openalex-snapshot
Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
inferred← citeshttps://doi.org/10.1137/140968574openalex-snapshot
Three Generalizations of Davenport--Schinzel Sequences
inferred← citeshttps://doi.org/10.1142/s0218195998000047openalex-snapshot
An Output-Sensitive Convex Hull Algorithm for Planar Objects
inferred← citeshttps://doi.org/10.1145/103418.103471openalex-snapshot
Hidden surface removal with respect to a moving view point
inferred← citeshttps://doi.org/10.1145/10515.10537openalex-snapshot
On shortest paths amidst convex polyhedra
inferred← citeshttps://doi.org/10.1145/1706591.1706597openalex-snapshot
Improved bounds and new techniques for Davenport--Schinzel sequences and their generalizations
inferred← citeshttps://doi.org/10.1145/2462356.2462390openalex-snapshot
Sharp bounds on Davenport-Schinzel sequences of every order
inferred← citeshttps://doi.org/10.1145/2493132.2462390openalex-snapshot
Sharp bounds on Davenport-Schinzel sequences of every order
inferred← citeshttps://doi.org/10.1145/258533.258624openalex-snapshot
Paul Erdös (1913?1996)
inferred← citeshttps://doi.org/10.1145/2794075openalex-snapshot
Sharp Bounds on Davenport-Schinzel Sequences of Every Order
inferred← citeshttps://doi.org/10.1145/42282.214094openalex-snapshot
On the shortest paths between two convex polyhedra
inferred← citeshttps://doi.org/10.1145/63047.63075openalex-snapshot
Dynamic computational geometry on parallel computers
inferred← citeshttps://doi.org/10.1145/73393.73420openalex-snapshot
On arrangements of Jordan arcs with three intersections per pair
inferred← citeshttps://doi.org/10.1287/mnsc.41.5.874openalex-snapshot
Fast Solution and Detection of Minimal Forecast Horizons in Dynamic Programs with a Single Indicator of the Future: Applications to Dynamic Lot-Sizing Models
inferred← citeshttps://doi.org/10.5555/320176.320188openalex-snapshot
Visibility with a moving point of view
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.