Range Minimum Query (German Wikipedia)

Analysis of information sources in references of the Wikipedia article "Range Minimum Query" in German language version.

refsWebsite

Global rank German rank

2^nd place

3^rd place

123^rd place

6^th place

610^th place

521^st place

doi.org (Global: 2^nd place; German: 3^rd place)

Fischer, J. and V. Heun: Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays. In: SIAM J. Comput. 40 (apr). 2011, S. 465–492, doi:10.1137/090779759.
Gál, A. and Miltersen, P.: The Cell Probe Complexity of Succinct Data Structures. In: Automata, Languages and Programming. 2003, S. 190–190, doi:10.1007/3-540-45061-0_28.
Bender, M. A., M. Farach-Colton, G. Pemmasani, S. Skiena, and P. Sumazin: Lowest common ancestors in trees and directed acyclic graphs. In: Journal of Algorithms. Band 57, Nr. 2, November 2005, ISSN 0196-6774, S. 75–94, doi:10.1016/j.jalgor.2005.08.001 (elsevier.com).
Fischer, J. and V. Heun: A new succinct representation of RMQ-information and improvements in the enhanced suffix array. In: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies. 2007, S. 459–470, doi:10.1007/978-3-540-74450-4_41.
Gabow, H.N., J.L. Bentley, and R.E. Tarjan: Scaling and related techniques for geometry problems. In: Proceedings of the sixteenth annual ACM symposium on Theory of computing. 1984, S. 135–143, doi:10.1145/800057.808675.
Bender, M. A. and M. Farach-Colton: The LCA Problem Revisited. In: LATIN 2000: Theoretical Informatics. 2000, S. 88–94, doi:10.1007/10719839_9.
Fischer, J. and V. Heun: Theoretical and practical improvements on the RMQ-problem, with applications to LCA and LCE. In: Combinatorial Pattern Matching. 2006, S. 36–48, doi:10.1007/11780441_5.

Bender, M. A., M. Farach-Colton, G. Pemmasani, S. Skiena, and P. Sumazin: Lowest common ancestors in trees and directed acyclic graphs. In: Journal of Algorithms. Band 57, Nr. 2, November 2005, ISSN 0196-6774, S. 75–94, doi:10.1016/j.jalgor.2005.08.001 (elsevier.com).

Bender, M. A., M. Farach-Colton, G. Pemmasani, S. Skiena, and P. Sumazin: Lowest common ancestors in trees and directed acyclic graphs. In: Journal of Algorithms. Band 57, Nr. 2, November 2005, ISSN 0196-6774, S. 75–94, doi:10.1016/j.jalgor.2005.08.001 (elsevier.com).