Path queries on functions
暂无分享,去创建一个
[1] Roberto Grossi,et al. High-order entropy-compressed text indexes , 2003, SODA '03.
[2] J. Ian Munro,et al. A Uniform Paradigm to Succinctly Encode Various Families of Trees , 2012, Algorithmica.
[3] Kunihiko Sadakane,et al. Fully Functional Static and Dynamic Succinct Trees , 2009, TALG.
[4] J. V. Tucker,et al. Computability of analog networks , 2007, Theor. Comput. Sci..
[5] Rajeev Raman,et al. Representing Trees of Higher Degree , 2005, Algorithmica.
[6] Luís M. S. Russo,et al. Space-efficient data-analysis queries on grids , 2013, Theor. Comput. Sci..
[7] J. Ian Munro,et al. Succinct Data Structures for Path Queries , 2012, ESA.
[8] David Richard Clark,et al. Compact pat trees , 1998 .
[9] Gonzalo Navarro,et al. Range Majorities and Minorities in Arrays , 2016, Algorithmica.
[10] Paolo Ferragina,et al. A simple storage scheme for strings achieving entropy bounds , 2007, SODA '07.
[11] Guy Jacobson,et al. Space-efficient static trees and graphs , 1989, 30th Annual Symposium on Foundations of Computer Science.
[12] Rajeev Raman,et al. Succinct ordinal trees with level-ancestor queries , 2004, SODA '04.
[13] Timothy M. Chan,et al. Succinct Indices for Path Minimum, with Applications to Path Reporting , 2014, ESA.
[14] Dekel Tsur. Succinct representation of labeled trees , 2015, Theor. Comput. Sci..
[15] Rajeev Raman,et al. Succinct representations of permutations and functions , 2011, Theor. Comput. Sci..
[16] Timothy M. Chan,et al. Orthogonal range searching on the RAM, revisited , 2011, SoCG '11.
[17] J. Ian Munro,et al. Data Structures for Path Queries , 2016, ACM Trans. Algorithms.
[18] J. Ian Munro,et al. Succinct Representation of Balanced Parentheses and Static Trees , 2002, SIAM J. Comput..
[19] Volker Heun,et al. Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays , 2011, SIAM J. Comput..
[20] S. Srinivasa Rao,et al. Succinct ordinal trees based on tree covering , 2012, TALG.
[21] Prosenjit Bose,et al. Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing , 2009, WADS.
[22] Gonzalo Navarro,et al. Path Queries on Functions , 2019, CPM.
[23] Sebastiano Vigna,et al. Theory and practice of monotone minimal perfect hashing , 2011, JEAL.
[24] Rajeev Raman,et al. Asymptotically Optimal Encodings of Range Data Structures for Selection and Top-k Queries , 2017, ACM Trans. Algorithms.
[25] Gonzalo Navarro,et al. Time-Optimal Top-k Document Retrieval , 2017, SIAM J. Comput..