Space efficient data structures for dynamic orthogonal range counting

Arge, 2003, Optimal external memory interval management, SIAM J. Comput., 32, 1488, 10.1137/S009753970240481X Barbay, 2012, Succinct representation of labeled graphs, Algorithmica, 62, 224, 10.1007/s00453-010-9452-7 Barbay, 2007, Adaptive searching in succinctly encoded binary relations and tree-structured documents, Theor. Comput. Sci., 387, 284, 10.1016/j.tcs.2007.07.015 Barbay, 2011, Succinct indexes for strings, binary relations and multilabeled trees, ACM Trans. Algorithms, 7, 52:1, 10.1145/2000807.2000820 Bentley, 1979, Decomposable searching problems, Inf. Process. Lett., 8, 244, 10.1016/0020-0190(79)90117-0 Bose, 2009, Succinct orthogonal range search structures on a grid with applications to text indexing, vol. 5664, 98 Chazelle, 1988, A functional approach to data structures and its use in multidimensional searching, SIAM J. Comput., 17, 427, 10.1137/0217026 Ferragina, 2009, Compressing and indexing labeled trees, with applications, J. ACM, 57, 10.1145/1613676.1613680 Ferragina, 2007, Compressed representations of sequences and full-text indexes, ACM Trans. Algorithms, 3, 10.1145/1240233.1240243 González, 2009, Rank/select on dynamic compressed sequences and applications, Theor. Comput. Sci., 410, 4414, 10.1016/j.tcs.2009.07.022 Grossi, 2003, High-order entropy-compressed text indexes, 841 He, 2010, Succinct representations of dynamic strings, vol. 6393, 334 He He, 2011, Space efficient data structures for dynamic orthogonal range counting, vol. 6844, 500 He, 2011, Dynamic range selection in linear space, vol. 7074, 160 Jacobson, 1989, Space-efficient static trees and graphs, 549 JáJá, 2004, Space-efficient and fast algorithms for multidimensional dominance reporting and counting, vol. 3341, 558 Larsen, 2012, The cell probe complexity of dynamic range counting, 85 Mäkinen, 2007, Rank and select revisited and extended, Theor. Comput. Sci., 387, 332, 10.1016/j.tcs.2007.07.013 Mäkinen, 2008, Dynamic entropy-compressed sequences and full-text indexes, ACM Trans. Algorithms, 4, 10.1145/1367064.1367072 Nekrich, 2009, Orthogonal range searching in linear and almost-linear space, Comput. Geom. Theory Appl., 42, 342, 10.1016/j.comgeo.2008.09.001 Pǎtraşcu, 2007, Lower bounds for 2-dimensional range counting, 40 Raman, 2001, Succinct dynamic data structures, vol. 2125, 426 Willard, 1985, New data structures for orthogonal range queries, SIAM J. Comput., 14, 232, 10.1137/0214019 Willard, 1985, Adding range restriction capability to dynamic data structures, J. ACM, 32, 597, 10.1145/3828.3839 Yu, 2011, Improved data structures for the orthogonal range successor problem, Comput. Geom. Theory Appl., 44, 148, 10.1016/j.comgeo.2010.09.001