Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences (Q911595): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: DBLP publication ID (P1635): journals/jct/AgarwalSS89, #quickstatements; #temporary_batch_1731475607626
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Peter W. Shor / rank
Normal rank
 
Property / author
 
Property / author: Peter W. Shor / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0097-3165(89)90032-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1998230386 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some dynamic computational geometry problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest paths between two convex polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Problem Connected with Differential Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial problem connected with differential equations II / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of ways to stab n convex nonintersecting sets in the plane is 2n-2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity and construction of many faces in arrangements of lines and of segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the general motion-planning problem with two degrees of freedom / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Voronoi diagrams for a ladder. II: Efficient construction of the diagram / rank
 
Normal rank
Property / cites work
 
Property / cites work: The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating two simple polygons by a sequence of translations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some properties of Davenport-Schinzel sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the two-dimensional Davenport-Schinzel problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost linear upper bounds on the length of general Davenport-Schinzel sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved lower bounds on the length of Davenport-Schinzel sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of Davenport and Schinzel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar realizations of nonlinear Davenport-Schinzel sequences by segments / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/jct/AgarwalSS89 / rank
 
Normal rank

Latest revision as of 06:38, 13 November 2024

scientific article
Language Label Description Also known as
English
Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
scientific article

    Statements

    Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences (English)
    0 references
    0 references
    0 references
    0 references
    1989
    0 references
    Davenport-Schinzel sequence
    0 references

    Identifiers