4 citations · 4 across the 2 of their papers we have counts for
6 papers
A Dynamic Space-Efficient Filter with Constant Time Operations
Ioana Oriana Bercea, Guy Even
A dynamic dictionary is a data structure that maintains sets of cardinality at most from a given universe and supports insertions, deletions, and membership queries. A filter a…
A Space-Efficient Dynamic Dictionary for Multisets with Constant Time Operations
Ioana Oriana Bercea, Guy Even
We consider the dynamic dictionary problem for multisets. Given an upper bound on the total cardinality of the multiset (i.e., including multiplicities) at any point in time, t…
Upper Tail Analysis of Bucket Sort and Random Tries
Ioana O. Bercea, Guy Even
Bucket Sort is known to run in expected linear time when the input keys are distributed independently and uniformly at random in the interval . The analysis holds even when…
Fully-Dynamic Space-Efficient Dictionaries and Filters with Constant Number of Memory Accesses
Ioana O. Bercea, Guy Even
A fully-dynamic dictionary is a data structure for maintaining sets that supports insertions, deletions and membership queries. A filter approximates membership queries with a one-…
On the cost of essentially fair clusterings
Ioana O. Bercea, Martin Groß, Samir Khuller +4
Clustering is a fundamental tool in data mining. It partitions points into groups (clusters) and may be used to make decisions for each point based on its group. However, this proc…
Improved Bounds for the Traveling Salesman Problem with Neighborhoods on Uniform Disks
Ioana O. Bercea
Given a set of disks of radius in the Euclidean plane, the Traveling Salesman Problem With Neighborhoods (TSPN) on uniform disks asks for the shortest tour that visits all…