A probabilistic distributed algorithm for set intersection and its analysis (Q1088406): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1997362133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal classes of hash functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3911791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4150954 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong approximation theorems for density dependent Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic lower bound for checking disjointness of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of problems on probabilistic, nondeterministic, and alternating decision trees / 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: On the Optimality of Some Set Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3683893 / rank
 
Normal rank

Latest revision as of 17:42, 17 June 2024

scientific article
Language Label Description Also known as
English
A probabilistic distributed algorithm for set intersection and its analysis
scientific article

    Statements

    A probabilistic distributed algorithm for set intersection and its analysis (English)
    0 references
    0 references
    0 references
    1987
    0 references
    Cf. the review of the preliminary version [Lect. Notes Comput. Sci. 194, 356-362 (1985)] in Zbl 0571.68030.
    0 references
    distributed computing
    0 references
    probabilistic algorithm
    0 references
    set disjointness
    0 references
    amount of communication
    0 references
    Markov chains
    0 references

    Identifiers