Selection and sorting in totally monotone arrays

DOI10.1007/BF02090398zbMath0766.68022MaRDI QIDQ3979609

Dina Kravets, James K. Park

Publication date: 26 June 1992

Published in: Mathematical Systems Theory (Search for Journal in Brave)

zbMATH Keywords

totally monotone array

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68P10: Searching and sorting

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

Related Items

Perspectives of Monge properties in optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear-time algorithm for concave one-dimensional dynamic programming
• A linear-time algorithm for computing the Voronoi diagram of a convex polygon
• Edge-skeletons in arrangements with applications
• Geometric applications of a matrix-searching algorithm
• Some techniques for geometric searching with implicit set representations
• A linear time algorithm for finding all farthest neighbors in a convex polygon
• The complexity of selection and ranking in X+Y and matrices with sorted columns
• How good is the information theory bound in sorting?
• The all nearest-neighbor problem for convex polygons
• A note on the all nearest-neighbor problem for convex polygons
• Time bounds for selection
• Sequence comparison with mixed convex and concave costs
• Efficient Parallel Algorithms for String Editing and Related Problems
• On the convex layers of a planar set
• The concave least-weight subsequence problem revisited