Search Sciweavers | Sciweavers

We solve instances of a general class of problems defined as follows: Preprocess a set S of possibly weighted colored geometric objects (e.g. points/orthogonal segments/rectangles...

Saladi Rahul, Prosenjit Gupta, K. S. Rajan

claim paper

Read More »

click to vote

ESA
2010
Springer

220views Algorithms» more ESA 2010»

Data Structures for Storing Small Sets in the Bitprobe Model

15 years 4 months ago

Download www.tcs.tifr.res.in

abstract appeared in Proc. 24th Annual Symposium of Computational Geometry (SoCG), 2008, pp. 338-345. S. Shannigrahi and S. P. Pal, "Efficient Prufer-like Coding and Counting ...

Jaikumar Radhakrishnan, Smit Shah 0001, Saswata Sh...

claim paper

Read More »

112

click to vote

ESA
2010
Springer

179views Algorithms» more ESA 2010»

On Space Efficient Two Dimensional Range Minimum Data Structures

15 years 3 months ago

Download www.cs.au.dk

The two dimensional range minimum query problem is to preprocess a static two dimensional m by n array A of size N = m

Gerth Stølting Brodal, Pooya Davoodi, S. Sr...