2 papers
cs.DS2026
Online Bisection with Ring Demands
Mateusz Basiak, Marcin Bienkowski, Guy Even +1
The online bisection problem requires maintaining a dynamic partition of nodes into two equal-sized clusters. Requests arrive sequentially as node pairs. If the nodes lie in di…
cs.DS2024
A Space Lower Bound for Approximate Membership with Duplicate Insertions or Deletions of Nonelements
Aryan Agarwala, Guy Even
Designs of data structures for approximate membership queries with false-positive errors that support both insertions and deletions stipulate the following two conditions: (1) Dupl…