Litcius/Paper detail

A Randomized Parallel Algorithm for Efficiently Finding Near-Optimal Universal Hitting Sets

Barış Ekim, Bonnie Berger, Yaron Orenstein

2020Lecture notes in computer science33 citationsDOIOpen Access PDF

Topics & Concepts

Computer scienceBottleneckHash functionPashaAlgorithmSequence (biology)Perfect hash functionParallel computingSet (abstract data type)Randomized algorithmBloom filterLeverage (statistics)Hash tableEmbedded systemHistoryMachine learningArchaeologyProgramming languageBiologyGeneticsComputer securityAlgorithms and Data CompressionCaching and Content DeliveryGenomics and Phylogenetic Studies
A Randomized Parallel Algorithm for Efficiently Finding Near-Optimal Universal Hitting Sets | Litcius