Follow
Ioana O. Bercea
Ioana O. Bercea
Assistant Professor, KTH Royal Institute of Technology
Verified email at kth.se - Homepage
Title
Cited by
Cited by
Year
On the cost of essentially fair clusterings
IO Bercea, M Groß, S Khuller, A Kumar, C Rösner, DR Schmidt, ...
arXiv preprint arXiv:1811.10319, 2018
1312018
Infinifilter: Expanding filters to infinity and beyond
N Dayan, I Bercea, P Reviriego, R Pagh
Proceedings of the ACM on Management of Data 1 (2), 1-27, 2023
162023
On computing maximal independent sets of hypergraphs in parallel
IO Bercea, N Goyal, DG Harris, A Srinivasan
Proceedings of the 26th ACM symposium on Parallelism in algorithms and …, 2014
162014
A dynamic space-efficient filter with constant time operations
IO Bercea, G Even
arXiv preprint arXiv:2005.01098, 2020
142020
Fully-dynamic space-efficient dictionaries and filters with constant number of memory accesses
IO Bercea, G Even
arXiv preprint arXiv:1911.05060, 2019
132019
Dynamic dictionaries for multisets and counting filters with constant time operations
IO Bercea, G Even
Algorithmica 85 (6), 1786-1804, 2023
112023
A space-efficient dynamic dictionary for multisets with constant time operations
IO Bercea, G Even
arXiv preprint arXiv:2005.02143, 2020
72020
An extendable data structure for incremental stable perfect hashing
IO Bercea, G Even
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
42022
Improved Bounds for the Traveling Salesman Problem with Neighborhoods on Uniform Disks
IO Bercea
Canadian Conference on Computational Geometry, CCCG 2018, 2018
32018
Aleph Filter: To Infinity in Constant Time
N Dayan, IO Bercea, R Pagh
arXiv preprint arXiv:2404.04703, 2024
22024
Locally Uniform Hashing
IO Bercea, L Beretta, J Klausen, JBT Houen, M Thorup
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023
22023
Daisy bloom filters
IO Bercea, JBT Houen, R Pagh
arXiv preprint arXiv:2205.14894, 2022
22022
Upper tail analysis of bucket sort and random tries
IO Bercea, G Even
Theoretical Computer Science 895, 55-67, 2021
12021
Minimizing uncertainty through sensor placement with angle constraints
IO Bercea
Canadian Conference on Computational Geometry, CCCG 2016, 2016
12016
Hashing for Sampling-Based Estimation
A Aamand, IO Bercea, JBT Houen, J Klausen, M Thorup
arXiv preprint arXiv:2411.19394, 2024
2024
On the geometry of -SAT solutions: what more can PPZ and Sch\"oning's algorithms do?
P Austrin, IO Bercea, M Goswami, N Limaye, A Srinivasan
arXiv preprint arXiv:2408.03465, 2024
2024
Online sorting and online TSP: randomized, stochastic, and high-dimensional
M Abrahamsen, IO Bercea, L Beretta, J Klausen, L Kozma
arXiv preprint arXiv:2406.19257, 2024
2024
17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)
S Albers
Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2020
2020
Approximation Algorithms for Geometric Clustering and Touring Problems
IO Bercea
University of Maryland, College Park, 2018
2018
CMSC 858F: Algorithmic Game Theory Fall 2010 Multicast and Network Formation Games
IO Bercea
2010
The system can't perform the operation now. Try again later.
Articles 1–20