Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences
From MaRDI portal
Publication:1575559
DOI10.1016/S0304-3975(98)00334-XzbMath0947.68077WikidataQ126815431 ScholiaQ126815431MaRDI QIDQ1575559
Publication date: 21 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mathematics for the Analysis of Algorithms.
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- An O(n log n) algorithm for the all-nearest-neighbors problem
- Solution of a Divide-and-Conquer Maximin Recurrence
- Fast Algorithms for Finding Nearest Common Ancestors
- An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
- Some Maximal Solutions of the Generalized Subadditive Inequality
- An Output-Sensitive Algorithm for Computing Visibility Graphs
- An optimal algorithm for intersecting line segments in the plane
- Tighter Bounds on the Solution of a Divide-and-Conquer Maximin Recurrence
- Multidimensional Divide-and-Conquer Maximin Recurrences