4 citations · 4 across the 5 of their papers we have counts for
7 papers · 1 filter
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-…
Survivable Network Design for Group Connectivity in Low-Treewidth Graphs
Parinya Chalermsook, Syamantak Das, Guy Even +2
In the Group Steiner Tree problem (GST), we are given a (vertex or edge)-weighted graph on vertices, a root vertex and a collection of groups $\{S_i\}_{i\in[h]}:…
Competitive Path Computation and Function Placement in SDNs
Guy Even, Moti Medina, Boaz Patt-Shamir
We consider a task of serving requests that arrive in an online fashion in Software-Defined Networks (SDNs) with network function virtualization (NFV). Each request specifies an ab…