Theory & AlgorithmsOn-Line Construction of Suffix TreesEsko UkkonenTheory & AlgorithmsOn-Line Construction of Suffix TreesEsko UkkonenSupplied bibliography entry.Read now
Theory & AlgorithmsA Space-Economical Suffix Tree Construction AlgorithmEdward McCreightTheory & AlgorithmsA Space-Economical Suffix Tree Construction AlgorithmEdward McCreightSupplied bibliography entry.Read now
Theory & AlgorithmsLinear Pattern Matching AlgorithmsPeter WeinerTheory & AlgorithmsLinear Pattern Matching AlgorithmsPeter WeinerSupplied bibliography entry.Read now
Theory & AlgorithmsSpace/Time Trade-offs in Hash Coding with Allowable ErrorsBurton BloomTheory & AlgorithmsSpace/Time Trade-offs in Hash Coding with Allowable ErrorsBurton BloomSupplied bibliography entry.Read now
Theory & AlgorithmsCuckoo Filter: Practically Better Than BloomBin Fan et al.Theory & AlgorithmsCuckoo Filter: Practically Better Than BloomBin Fan et al.Supplied bibliography entry.Read now
Theory & AlgorithmsDon't Thrash: How to Cache Your Hash on FlashMichael Bender et al.Theory & AlgorithmsDon't Thrash: How to Cache Your Hash on FlashMichael Bender et al.Supplied bibliography entry.Read now
Theory & AlgorithmsXor FiltersThomas Mueller Graf & Daniel LemireTheory & AlgorithmsXor FiltersThomas Mueller Graf & Daniel LemireSupplied bibliography entry.Read now
Theory & AlgorithmsVector Quotient FiltersPandey, Conway, Bender, et al.Theory & AlgorithmsVector Quotient FiltersPandey, Conway, Bender, et al.Supplied bibliography entry.Read now
Theory & AlgorithmsAn Optimal Bloom Filter ReplacementAnna Pagh, Rasmus Pagh, S. Srinivasa RaoTheory & AlgorithmsAn Optimal Bloom Filter ReplacementAnna Pagh, Rasmus Pagh, S. Srinivasa RaoSupplied bibliography entry.Read now
Theory & AlgorithmsAn Optimal Bloom Filter Replacement Based on Matrix SolvingEly PoratTheory & AlgorithmsAn Optimal Bloom Filter Replacement Based on Matrix SolvingEly PoratSupplied bibliography entry.Read now
Theory & AlgorithmsA Lower Bound for Dynamic Approximate Membership Data StructuresShachar Lovett & Ely PoratTheory & AlgorithmsA Lower Bound for Dynamic Approximate Membership Data StructuresShachar Lovett & Ely PoratSupplied bibliography entry.Read now
Theory & AlgorithmsNetwork Applications of Bloom FiltersAndrei Broder & Michael MitzenmacherTheory & AlgorithmsNetwork Applications of Bloom FiltersAndrei Broder & Michael MitzenmacherSupplied bibliography entry.Read now