Combinatorial solutions of multidimensional divide-and-conquer recurrences

DOI10.1016/0196-6774(80)90005-XzbMath0435.68032OpenAlexW2113567385MaRDI QIDQ3875340

Louis Monier

Publication date: 1980

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(80)90005-x

zbMATH Keywords

multidimensional divide-and- conquerrecurrence relations in two variables

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Related Items (8)

On a recursion connected with tree balancing algorithms ⋮ Average complexity of divide-and-conquer algorithms ⋮ Unnamed Item ⋮ Permutation inversions and multidimensional cumulative distribution functions ⋮ Fast linear expected-time algorithms for computing maxima and convex hulls ⋮ Optimal speeding up of parallel algorithms based upon the divide-and- conquer strategy ⋮ Quasi-optimal range searching in spaces of finite VC-dimension ⋮ Multivariate analysis of orthogonal range searching and graph distances

This page was built for publication: Combinatorial solutions of multidimensional divide-and-conquer recurrences