1 citations · 1 across the 4 of their papers we have counts for
6 papers
Diva++: Dynamic Range Filtering over Hard Workloads
Navid Eslami, Ioana O. Bercea, Niv Dayan
Range filters are compact probabilistic data structures that answer approximate range emptiness queries. They are used in many domains, e.g., in key-value stores, to quickly rule o…
Sublime: Sublinear Error & Space for Unbounded Skewed Streams
Navid Eslami, Ioana O. Bercea, Rasmus Pagh +1
Modern stream processing systems often need to track the frequency of distinct keys in a data stream in real-time. Since maintaining exact counts can require a prohibitive amount o…
Hashing for Sampling-Based Estimation
Anders Aamand, Ioana O. Bercea, Jakob Bæk Tejs Houen +2
Hash-based sampling and estimation are common themes in computing. Using hashing for sampling gives us the coordination needed to compare samples from different sets. Hashing is al…
Algorithms for the Diverse-k-SAT problem: the geometry of satisfying assignments
Per Austrin, Ioana O. Bercea, Mayank Goswami +2
Given a -CNF formula and an integer , we study algorithms that obtain solutions to the formula that are maximally dispersed. For , the problem of computing the diame…
Online sorting and online TSP: randomized, stochastic, and high-dimensional
Mikkel Abrahamsen, Ioana O. Bercea, Lorenzo Beretta +2
In the online sorting problem, items are revealed one by one and have to be placed (immediately and irrevocably) into empty cells of a size- array. The goal is to minimize t…
Aleph Filter: To Infinity in Constant Time
Niv Dayan, Ioana-Oriana Bercea, Rasmus Pagh
Filter data structures are widely used in various areas of computer science to answer approximate set-membership queries. In many applications, the data grows dynamically, requirin…