On Space Efficient Two Dimensional Range Minimum Data Structures

15 years 8 months ago

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

Additional Space | Algorithms | Dimensional | ESA 2010 | Minimum Query Problem |

claim paper

Added	06 Dec 2010
Updated	06 Dec 2010
Type	Conference
Year	2010
Where	ESA
Authors	Gerth Stølting Brodal, Pooya Davoodi, S. Srinivasa Rao

Comments (0)