L. G. Valiant, Parallelism in Comparison Problems, SIAM Journal on Computing, vol.4, issue.3, pp.348-355, 1975.
DOI : 10.1137/0204030

Y. Shiloach and U. Vishkin, Finding the maximum, merging, and sorting in a parallel computation model, Journal of Algorithms, vol.2, issue.1, pp.88-102, 1981.
DOI : 10.1016/0196-6774(81)90010-9

O. Berkman and U. Vishkin, Recursive Star-Tree Parallel Data Structure, SIAM Journal on Computing, vol.22, issue.2, 1990.
DOI : 10.1137/0222017
URL : http://www.dtic.mil/get-tr-doc/pdf?AD=ADA227803

J. Fischer and V. Heun, Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays, SIAM Journal on Computing, vol.40, issue.2, pp.465-492, 2011.
DOI : 10.1137/090779759

J. Fischer and V. Heun, Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE, Proc. of Combinatorial Pattern Matching, pp.36-48, 2006.
DOI : 10.1007/11780441_5

K. Sadakane, Compressed Suffix Trees with Full Functionality, Theory of Computing Systems, vol.41, issue.4, pp.589-607, 2007.
DOI : 10.1007/s00224-006-1198-x
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.224.4152

S. Durocher, A Simple Linear-Space Data Structure for Constant-Time Range Minimum Query, Space-Efficient Data Structures, Streams, and Algorithms, pp.48-60, 2013.
DOI : 10.1137/0217079

J. Fischer, Optimal Succinctness for Range Minimum Queries, Proc. 9th Latin American Theoretical Informatics Symposium, pp.158-169, 2010.
DOI : 10.1007/978-3-642-12200-2_16

P. Davoodi, R. Raman, and S. R. Satti, Succinct Representations of Binary Trees for Range Minimum Queries, Computing and Combinatorics, pp.396-407, 2012.
DOI : 10.1007/978-3-642-32241-9_34

G. S. Brodal, P. Davoodi, and S. S. Rao, Path Minima Queries in Dynamic Weighted Trees, pp.290-301, 2011.
DOI : 10.1007/978-3-642-22300-6_25

P. Davoodi, Data structures: range queries and space efficiency, 2011.

L. Arge, J. Fischer, P. Sanders, and N. Sitchinava, On (Dynamic) Range Minimum Queries in External Memory, Algorithms and Data Structures: 13th International Symposium, Proceedings, WADS 2013, pp.37-48, 2013.
DOI : 10.1007/978-3-642-40104-6_4

R. Raman, V. Raman, and S. Rao, -ary trees, prefix sums and multisets, Proc. of Symposium on Discrete Algorithms, SODA, pp.233-242, 2002.
DOI : 10.1145/1290672.1290680
URL : https://hal.archives-ouvertes.fr/hal-01087676

G. Navarro, Fast, Small, Simple Rank/Select on Bitmaps, Lecture Notes in Comput. Sci, vol.7276, pp.295-306, 2012.
DOI : 10.1007/978-3-642-30850-5_26

A. Gupta, W. Hon, R. Shah, and J. S. Vitter, Compressed data structures: Dictionaries and data-aware measures, Theoretical Computer Science, vol.387, issue.3, pp.313-331, 2007.
DOI : 10.1016/j.tcs.2007.07.042
URL : http://doi.org/10.1016/j.tcs.2007.07.042

D. Okanohara and K. Sadakane, Practical Entropy-Compressed Rank/Select Dictionary, Proc. of the Workshop on Algorithm Engineering and Experiments, ALENEX, 2007.
DOI : 10.1137/1.9781611972870.6

V. Mäkinen and G. Navarro, Rank and select revisited and extended, Theoretical Computer Science, vol.387, issue.3, pp.332-347, 2007.
DOI : 10.1016/j.tcs.2007.07.013

G. Navarro and Y. Nekrich, Optimal Dynamic Sequence Representations, SIAM Journal on Computing, vol.43, issue.5, pp.1781-1806, 2014.
DOI : 10.1137/130908245