2 citations · 6 across the 14 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.DS2022★ 1 cited
Dominance for Containment Problems
Waseem Akram, Sanjeev Saxena
In a containment problem, the goal is to preprocess a set of geometric objects so that, given a geometric query object, we can report all the objects containing the query object. W…
cs.DS2022
Simpler O(1) Query Algorithm for Level Ancestors
Sanjeev Saxena
This note describes a very simple O(1) query time algorithm for finding level ancestors. This is basically a serial (re)-implementation of the parallel algorithm of Berkman and Vis…