Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences
type: Item
instance of: scholarly article
title: Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences
zbMATH Open document ID: 0947.68077
DOI: 10.1016/S0304-3975(98)00334-X
author: Biing-Feng Wang
published in: Theoretical Computer Science
publication date: 2000-08-21T00:00:00Z
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 68R05
zbMATH DE Number: 1493367
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: divide and conquer
zbMATH Keywords: recurrence relations
zbMATH Keywords: partition trees
MaRDI profile type: Publication
cites work: Multidimensional Divide-and-Conquer Maximin Recurrences
cites work: Some Maximal Solutions of the Generalized Subadditive Inequality
cites work: An optimal algorithm for intersecting line segments in the plane
cites work: Q4172927
cites work: An Output-Sensitive Algorithm for Computing Visibility Graphs
cites work: Q4040797
cites work: Mathematics for the Analysis of Algorithms.
cites work: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
cites work: Fast Algorithms for Finding Nearest Common Ancestors
cites work: Solution of a Divide-and-Conquer Maximin Recurrence
cites work: Q3219751
cites work: An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
cites work: An O(n log n) algorithm for the all-nearest-neighbors problem
cites work: Tighter Bounds on the Solution of a Divide-and-Conquer Maximin Recurrence
Wikidata QID: Q126815431
description: scientific article; zbMATH DE number 1493367