Searching for a monotone function by independent threshold queries

DOI10.1007/BFB0015433MaRDI QIDQ6487974zbMATH OpenFDO

Authors Peter Damaschke

Publication date 21 March 2023

Full work available at URL https://doi.org/10.1007/BFB0015433

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15) Analysis of algorithms (68W40)

Recommendations

• An optimal parallel algorithm for digital curve segmentation
• The splitting technique in monotone recognition
• scientific article; zbMATH DE number 3974158
• An optimal algorithm for finding all the jumps of a monotone step-function
• A generalization of binary search

Cites work

• An efficient parallel algorithm for the row minima of a totally monotone matrix
• An optimal algorithm for finding all the jumps of a monotone step-function
• An optimal parallel algorithm for digital curve segmentation using hough polygons and monotone function search
• Finding extrema with unary predicates
• Line segmentation of digital curves in parallel

Cited in

(1)

• The splitting technique in monotone recognition

This page was built for publication: Searching for a monotone function by independent threshold queries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487974)