The probabilistic method yields deterministic parallel algorithms (Q1342858): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A fast and simple randomized parallel algorithm for the maximal independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm for Colouring the Edges of a Graph With Δ + 1 Colours / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced two-colorings of finite sets in the cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: ``Integer-making'' theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulating (log <sup>c</sup> <i>n</i> )-wise independence in NC / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic view of random sampling and its use in geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Randomized Algorithm for Closest-Point Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: New applications of random sampling in computational geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a combinatorial game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5541610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP completeness of finding the chromatic index of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\epsilon\)-nets and simplex range queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derandomization through approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient parallel algorithms for edge coloring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing a perfect matching is in random NC / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of parallel search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast parallel algorithm for the maximal independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast parallel algorithm for routing in permutation networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ratio of optimal integral and fractional covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast parallel algorithm to compute the rank of a matrix over an arbitrary field / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching is as easy as matrix inversion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small-Bias Probability Spaces: Efficient Constructions and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balancing families of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic construction of deterministic algorithms: approximating packing integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3484356 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3481743 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Six Standard Deviations Suffice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balancing vectors in the max norm / rank
 
Normal rank

Latest revision as of 10:27, 23 May 2024

scientific article
Language Label Description Also known as
English
The probabilistic method yields deterministic parallel algorithms
scientific article

    Statements

    The probabilistic method yields deterministic parallel algorithms (English)
    0 references
    0 references
    0 references
    0 references
    24 October 1995
    0 references
    RNC algorithm
    0 references
    NC algorithms
    0 references
    parallel algorithms
    0 references
    Ramsey graphs
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers