Linear time algorithms for convex and monotone approximation (Q792060): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0898-1221(83)90121-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2041308267
@@ Property / OpenAlex ID: W2041308267 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3236518
@@ Property / cites work: Q3236518 / rank @@
+Normal rank
@@ Property / cites work @@
+Divide and conquer for linear expected time
@@ Property / cites work: Divide and conquer for linear expected time / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for determining the convex hull of a finite planar set
+Normal rank
@@ Property / cites work @@
+Q4039868
@@ Property / cites work: Q4039868 / rank @@
+Normal rank
@@ Property / cites work @@
+Convex hulls of finite sets of points in two and three dimensions
+Normal rank
@@ Property / cites work @@
+Isotone optimization. II
@@ Property / cites work: Isotone optimization. II / rank @@
+Normal rank
@@ Property / cites work @@
+An O(n) algorithm for discrete n-point convex approximation with applications to continuous case
+Normal rank
@@ Property / cites work @@
+Generalized isotone optimization with applications to starshaped functions
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:792060