Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems (Q1389649): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Parallel computational geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Comparison Bounds on the Complexity of Parallel Sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: The average-case parallel complexity of sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Merge Sort / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional Searching Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A perfect parallel dictionary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal, output-sensitive algorithms for constructing planar hulls in parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: The log-star revolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228437 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for maximal and convex layers problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138978 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal randomized parallel algorithms for computational geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4695103 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for algebraic decision trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound to Finding Convex Hulls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel triangulation of a polygon in two calls to the trapezoidal map / rank
 
Normal rank

Latest revision as of 13:04, 28 May 2024

scientific article
Language Label Description Also known as
English
Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems
scientific article

    Statements

    Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems (English)
    0 references
    30 June 1998
    0 references
    0 references
    decision problem
    0 references
    parallel algebraic decision tree model
    0 references
    parallel algorithm
    0 references
    0 references