External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Invertible Bloom Lookup Tables with Less Memory and Randomness

Nils Fleischhacker, Kasper Green Larsen, Maciej Obremski, Mark Simkin 0001. Invertible Bloom Lookup Tables with Less Memory and Randomness. In Timothy Chan, Johannes Fischer 0001, John Iacono, Grzegorz Herman, editors, 32nd Annual European Symposium on Algorithms, ESA 2024, September 2-4, 2024, Royal Holloway, London, United Kingdom. Volume 308 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. [doi]

Authors

Nils Fleischhacker

This author has not been identified. Look up 'Nils Fleischhacker' in Google

Kasper Green Larsen

This author has not been identified. Look up 'Kasper Green Larsen' in Google

Maciej Obremski

This author has not been identified. Look up 'Maciej Obremski' in Google

Mark Simkin 0001

This author has not been identified. Look up 'Mark Simkin 0001' in Google
runs on