Ioana O. Bercea

Algorithmica, June, 2023

InfiniFilter: Expanding Filters to Infinity and Beyond.

[BibT_eX]

[DOI]

Proc. ACM Manag. Data, 2023

Locally Uniform Hashing.

[BibT_eX]

[DOI]

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

Daisy Bloom Filters.

[BibT_eX]

[DOI]

Jakob Bæk Tejs Houen

Rasmus Pagh

CoRR, 2022

An extendable data structure for incremental stable perfect hashing.

[BibT_eX]

[DOI]

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

2021

Upper tail analysis of bucket sort and random tries.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

2020

A Space-Efficient Dynamic Dictionary for Multisets with Constant Time Operations.

[BibT_eX]

[DOI]

CoRR, 2020

A Dynamic Space-Efficient Filter with Constant Time Operations.

[BibT_eX]

[DOI]

Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

2019

Fully-Dynamic Space-Efficient Dictionaries and Filters with Constant Number of Memory Accesses.

[BibT_eX]

[DOI]

CoRR, 2019

On the Cost of Essentially Fair Clusterings.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2019

2018

Improved Bounds for the Traveling Salesman Problem with Neighborhoods on Uniform Disks.

[BibT_eX]

[DOI]

Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2016

On Computing Maximal Independent Sets of Hypergraphs in Parallel.

[BibT_eX]

[DOI]

ACM Trans. Parallel Comput., 2016

Minimizing Uncertainty through Sensor Placement with Angle Constraints.

[BibT_eX]