Range minimum query (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Range minimum query" in English language version.

refsWebsite

Global rank English rank

2^nd place

9,785^th place

9,347^th place

207^th place

136^th place

doi.org (Global: 2^nd place; English: 2^nd place)

Bender, Michael A.; Farach-Colton, Martín; Pemmasani, Giridhar; Skiena, Steven; Sumazin, Pavel (2005). "Lowest common ancestors in trees and directed acyclic graphs" (PDF). Journal of Algorithms. 57 (2): 75–94. doi:10.1016/j.jalgor.2005.08.001.
Bender, Michael; Farach-Colton, Martín (2000). "The LCA Problem Revisited". LATIN 2000: Theoretical Informatics. LNCS. Vol. 1776. Springer. pp. 88–94. doi:10.1007/10719839_9. ISBN 978-3-540-67306-4.
Fischer, Johannes; Heun, Volker (2007). "A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array". Combinatorics, Algorithms, Probabilistic and Experimental Methodologies. Proceedings of the International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies. LNCS. Vol. 4614. Springer. pp. 459–470. doi:10.1007/978-3-540-74450-4_41. ISBN 978-3-540-74449-8.
Fischer, J. and V. Heun (2006). "Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE". Combinatorial Pattern Matching. Lecture Notes in Computer Science. Vol. 4009. pp. 36–48. CiteSeerX 10.1.1.64.5439. doi:10.1007/11780441_5. ISBN 978-3-540-35455-0.

Fischer, J. and V. Heun (2006). "Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE". Combinatorial Pattern Matching. Lecture Notes in Computer Science. Vol. 4009. pp. 36–48. CiteSeerX 10.1.1.64.5439. doi:10.1007/11780441_5. ISBN 978-3-540-35455-0.