Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences (Q1575559): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q126815431, #quickstatements; #temporary_batch_1722426648791
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional Divide-and-Conquer Maximin Recurrences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Maximal Solutions of the Generalized Subadditive Inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for intersecting line segments in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4172927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Output-Sensitive Algorithm for Computing Visibility Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematics for the Analysis of Algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Finding Nearest Common Ancestors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a Divide-and-Conquer Maximin Recurrence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n log n) algorithm for the all-nearest-neighbors problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter Bounds on the Solution of a Divide-and-Conquer Maximin Recurrence / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126815431 / rank
 
Normal rank

Latest revision as of 12:52, 31 July 2024

scientific article
Language Label Description Also known as
English
Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences
scientific article

    Statements

    Identifiers