Transforming comparison model lower bounds to the parallel-random-access-machine (Q287050): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Artur Czumaj / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal parallel selection has complexity O(log log N) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding an Approximate Maximum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel comparison algorithms for approximation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal $O(\log \log N)$-Time Parallel Algorithm for Detecting all Squares in a String / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel selection / 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: Optimal bounds for decision problems on the CRCW PRAM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing, merging, and sorting on parallel models of computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound for Parallel String Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding all periods and initial palindromes of a string in parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Theorems on Classifications of Subsets of a Given Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Parallel Sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of Ramsey's theorem to decision tree complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parallel Complexity of Element Distinctness is $\Omega ( \sqrt{\log n} )$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the maximum, merging, and sorting in a parallel computation model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallelism in Comparison Problems / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0020-0190(97)00032-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2039192511 / rank
 
Normal rank

Latest revision as of 10:52, 30 July 2024

scientific article
Language Label Description Also known as
English
Transforming comparison model lower bounds to the parallel-random-access-machine
scientific article

    Statements

    Transforming comparison model lower bounds to the parallel-random-access-machine (English)
    0 references
    0 references
    0 references
    0 references
    26 May 2016
    0 references
    lower bounds
    0 references
    PRAM model
    0 references
    comparison model
    0 references
    Ramsey theory
    0 references

    Identifiers