Optimal slope selection via cuttings (Q1388130): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56607625, #quickstatements; #temporary_batch_1712260040974
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Sorting in \(c \log n\) parallel steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting hyperplanes for divide-and-conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter, width, closest line pair, and parametric searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140430 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal-Time Algorithm for Slope Selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A RANDOMIZED ALGORITHM FOR SLOPE SELECTION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting X + Y / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal slope selection via expanders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized optimal algorithm for slope selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms / rank
 
Normal rank

Latest revision as of 11:50, 28 May 2024

scientific article
Language Label Description Also known as
English
Optimal slope selection via cuttings
scientific article

    Statements

    Identifiers