Minimizing Uncertainty through Sensor Placement with Angle Constraints. - Ioana Oriana Bercea; Volkan Isler; Samir Khuller (CCCG, 2016)

On Computing Maximal Independent Sets of Hypergraphs in Parallel. - Ioana Oriana Bercea; Navin Goyal; David G. Harris 001; Aravind Srinivasan (ACM Trans. Parallel Comput., 2016)

Improved Bounds for the Traveling Salesman Problem with Neighborhoods on Uniform Disks. - Ioana Oriana Bercea (CCCG, 2018)

Approximation Algorithms for Geometric Clustering and Touring Problems. - Ioana Oriana Bercea (2018)

On the Cost of Essentially Fair Clusterings. - Ioana Oriana Bercea; Martin Groß 001; Samir Khuller; Aounon Kumar; Clemens Rösner; Daniel R. Schmidt 001; Melanie Schmidt 001 (APPROX-RANDOM, 2019)

Fully-Dynamic Space-Efficient Dictionaries and Filters with Constant Number of Memory Accesses. - Ioana Oriana Bercea; Guy Even (CoRR, 2019)

A Dynamic Space-Efficient Filter with Constant Time Operations. - Ioana O. Bercea; Guy Even (SWAT, 2020)

A Space-Efficient Dynamic Dictionary for Multisets with Constant Time Operations. - Ioana Oriana Bercea; Guy Even (CoRR, 2020)

Upper tail analysis of bucket sort and random tries. - Ioana O. Bercea; Guy Even (Theor. Comput. Sci., 2021)

An extendable data structure for incremental stable perfect hashing. - Ioana Oriana Bercea; Guy Even (STOC, 2022)

Locally Uniform Hashing. - Ioana O. Bercea; Lorenzo Beretta 001; Jonas Klausen; Jakob Bæk Tejs Houen; Mikkel Thorup (FOCS, 2023)

InfiniFilter: Expanding Filters to Infinity and Beyond. - Niv Dayan; Ioana O. Bercea; Pedro Reviriego; Rasmus Pagh (Proc. ACM Manag. Data, 2023)

Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations. - Ioana O. Bercea; Guy Even (Algorithmica, 2023)

Online Sorting and Online TSP: Randomized, Stochastic, and High-Dimensional. - Mikkel Abrahamsen; Ioana O. Bercea; Lorenzo Beretta 001; Jonas Klausen; László Kozma 002 (ESA, 2024)

Daisy Bloom Filters. - Ioana O. Bercea; Jakob Bæk Tejs Houen; Rasmus Pagh (SWAT, 2024)

On the geometry of k-SAT solutions: what more can PPZ and Schöning's algorithms do? - Per Austrin; Ioana O. Bercea; Mayank Goswami 001; Nutan Limaye; Adarsh Srinivasan (CoRR, 2024)

Hashing for Sampling-Based Estimation. - Anders Aamand; Ioana O. Bercea; Jakob Bæk Tejs Houen; Jonas Klausen; Mikkel Thorup (CoRR, 2024)

Aleph Filter: To Infinity in Constant Time. - Niv Dayan; Ioana Oriana Bercea; Rasmus Pagh (Proc. VLDB Endow., 2024)

Dynamic Filter and Retrieval with One Access to Modifiable Memory. - Ioana O. Bercea; Guy Even; Tomer Even; Gabriel Marques Domingues (CIAC (1), 2025)

Algorithms for the Diverse-k-SAT Problem: The Geometry of Satisfying Assignments. - Per Austrin; Ioana O. Bercea; Mayank Goswami 001; Nutan Limaye; Adarsh Srinivasan (ICALP, 2025)