Quicksort, Largest Bucket, and Min-Wise Hashing with Limited Independence (Q3452844): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1502.05729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527014 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-wise independent permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal classes of hash functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Independence to Expansion and Back Again / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Reliable Randomized Algorithm for the Closest-Pair Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized algorithms and pseudorandom numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Simple Tabulation Hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chernoff–Hoeffding Bounds for Applications with Limited Independence / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Universal Classes of Extremely Random Constant-Time Hash Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952657 / rank
 
Normal rank

Latest revision as of 02:15, 11 July 2024

scientific article
Language Label Description Also known as
English
Quicksort, Largest Bucket, and Min-Wise Hashing with Limited Independence
scientific article

    Statements

    Identifiers