1 citations · 1 across the 4 of their papers we have counts for
4 papers
Succinct Posets
J. Ian Munro, Patrick K. Nicholson
We describe an algorithm for compressing a partially ordered set, or \emph{poset}, so that it occupies space matching the information theory lower bound (to within lower order term…
Succinct Indices for Range Queries with applications to Orthogonal Range Maxima
Arash Farzan, J. Ian Munro, Rajeev Raman
We consider the problem of preprocessing points in 2D, each endowed with a priority, to answer the following queries: given a axis-parallel rectangle, determine the point with…
Succinct Representations of Dynamic Strings
Meng He, J. Ian Munro
The rank and select operations over a string of length n from an alphabet of size have been used widely in the design of succinct data structures. In many applications, the str…
Range Reporting for Moving Points on a Grid
Marek Karpinski, J. Ian Munro, Yakov Nekrich
In this paper we describe a new data structure that supports orthogonal range reporting queries on a set of points that move along linear trajectories on a grid. The as…