Two Dimensional Range Minimum Queries and Fibonacci Lattices-Reference-Cited by-同舟云学术

Two Dimensional Range Minimum Queries and Fibonacci Lattices

Published:2012 Issue: Volume: Page:217-228
ISSN:0302-9743
Container-title:Algorithms – ESA 2012
language:
Short-container-title:

Author:

Brodal Gerth Stølting,Davoodi Pooya,Lewenstein Moshe,Raman Rajeev,Srinivasa Rao Satti

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-33090-2_20.pdf

Reference17 articles.

1. Lecture Notes in Computer Science;A. Amir,2007

2. Atallah, M.J., Yuan, H.: Data structures for range minimum queries in multidimensional arrays. In: Proc. 20th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 150–160. SIAM (2010)

3. Lecture Notes in Computer Science;P. Bose,2009

4. Brodal, G.S., Davoodi, P., Rao, S.S.: On space efficient two dimensional range minimum data structures. Algorithmica 63(4), 815–830 (2012)

5. Chazelle, B., Rosenberg, B.: Computing partial sums in multidimensional arrays. In: Proc. 5th Annual Symposium on Computational Geometry, pp. 131–139. ACM (1989)

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Submatrix Maximum Queries in Monge and Partial Monge Matrices Are Equivalent to Predecessor Search;ACM Transactions on Algorithms;2020-04-30

2. Dynamic Path Queries in Linear Space;Algorithmica;2018-02-02

3. Non-orthogonal Homothetic Range Partial-Sum Query on Integer Grids;Frontiers in Algorithmics;2018

4. Succinct Indices for Path Minimum, with Applications;Algorithmica;2016-06-08

5. Compressed Range Minimum Queries;Encyclopedia of Algorithms;2016