An optimal speedup algorithm for the measure problem

DOI10.1016/0167-8191(90)90119-TzbMath0686.68044OpenAlexW2006147396MaRDI QIDQ1262771

K. Appert

Publication date: 1990

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(90)90119-t

zbMATH Keywords

parallel algorithmdivide and conquer strategycomplexity analysismeasure problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (1)

Constant time BSR solutions to \(L_ 1\) metric and digital geometry problems

This page was built for publication: An optimal speedup algorithm for the measure problem