7 citations · 10 across the 5 of their papers we have counts for
5 papers
Faster Worst Case Deterministic Dynamic Connectivity
Casper Kejlberg-Rasmussen, Tsvi Kopelowitz, Seth Pettie +1
We present a deterministic dynamic connectivity data structure for undirected graphs with worst case update time and constant…
Dynamic Set Intersection
Tsvi Kopelowitz, Seth Pettie, Ely Porat
Consider the problem of maintaining a family of dynamic sets subject to insertions, deletions, and set-intersection reporting queries: given , report every member of…
I/O-Efficient Planar Range Skyline and Attrition Priority Queues
Casper Kejlberg-Rasmussen, Yufei Tao, Konstantinos Tsakalidis +2
In the planar range skyline reporting problem, we store a set P of n 2D points in a structure such that, given a query rectangle Q = [a_1, a_2] x [b_1, b_2], the maxima (a.k.a. sky…
I/O-Efficient Dynamic Planar Range Skyline Queries
Casper Kejlberg-Rasmussen, Konstantinos Tsakalidis, Kostas Tsichlas
We present the first fully dynamic worst case I/O-efficient data structures that support planar orthogonal \textit{3-sided range skyline reporting queries} in $\bigO (\log_{2B^ε} n…
Cache-Oblivious Implicit Predecessor Dictionaries with the Working Set Property
Gerth Stølting Brodal, Casper Kejlberg-Rasmussen
In this paper we present an implicit dynamic dictionary with the working-set property, supporting insert(e) and delete(e) in O(log n) time, predecessor(e) in O(log l_{p(e)}) time,…