13 citations · 35 across the 9 of their papers we have counts for
Showing 2011 · cs.DSShow all
2 papers · 2 filters
cs.DS2011★ 13 cited
Encoding 2-D Range Maximum Queries
Mordecai J. Golin, John Iacono, Danny Krizanc +3
We consider the \emph{two-dimensional range maximum query (2D-RMQ)} problem: given an array of ordered values, to pre-process it so that we can find the position of the smalles…
cs.DS2011
Optimal Indexes for Sparse Bit Vectors
Alexander Golynski, Alessio Orlandi, Rajeev Raman +1
We consider the problem of supporting Rank() and Select() operations on a bit vector of length m with n 1 bits. The problem is considered in the succinct index model, where the bit…