Selection and sorting in totally monotone arrays (Q3979609): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Efficient Parallel Algorithms for String Editing and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for computing the Voronoi diagram of a convex polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric applications of a matrix-searching algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for finding all farthest neighbors in a convex polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time bounds for selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convex layers of a planar set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some techniques for geometric searching with implicit set representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-skeletons in arrangements with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequence comparison with mixed convex and concave costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of selection and ranking in X+Y and matrices with sorted columns / rank
 
Normal rank
Property / cites work
 
Property / cites work: How good is the information theory bound in sorting? / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for concave one-dimensional dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3975931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The all nearest-neighbor problem for convex polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: The concave least-weight subsequence problem revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the all nearest-neighbor problem for convex polygons / rank
 
Normal rank

Latest revision as of 11:29, 15 May 2024

scientific article
Language Label Description Also known as
English
Selection and sorting in totally monotone arrays
scientific article

    Statements

    Selection and sorting in totally monotone arrays (English)
    0 references
    0 references
    0 references
    0 references
    26 June 1992
    0 references
    0 references
    0 references
    0 references
    0 references
    totally monotone array
    0 references