Finding Range Minima in the Middle: Approximations and Applications
暂无分享,去创建一个
[1] Gonzalo Navarro,et al. Compressed full-text indexes , 2007, CSUR.
[2] David Richard Clark,et al. Compact pat trees , 1998 .
[3] Rajeev Raman,et al. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets , 2002, SODA '02.
[4] R. Stanley. Enumerative Combinatorics: Volume 1 , 2011 .
[5] Ira M. Gessel,et al. Super Ballot Numbers , 1992, J. Symb. Comput..
[6] Wolfgang Gerlach,et al. Engineering a compressed suffix tree implementation , 2007, JEAL.
[7] Enno Ohlebusch,et al. A Compressed Enhanced Suffix Array Supporting Fast String Matching , 2009, SPIRE.
[8] Renzo Sprugnoli,et al. Waiting patterns for a printer , 2004, Discret. Appl. Math..
[9] Roberto Grossi,et al. Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching , 2005, SIAM J. Comput..
[10] Rajeev Raman,et al. Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets , 2007, ACM Trans. Algorithms.
[11] Dong Kyue Kim,et al. An Efficient Index Data Structure with the Capabilities of Suffix Trees and Suffix Arrays for Alphabets of Non-negligible Size , 2004, SPIRE.
[12] Jean Vuillemin,et al. A unifying look at data structures , 1980, CACM.
[13] Volker Heun,et al. Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE , 2006, CPM.
[14] John L. Smith. Tables , 1969, Neuromuscular Disorders.
[15] Steven Skiena,et al. Lowest common ancestors in trees and directed acyclic graphs , 2005, J. Algorithms.
[16] Gonzalo Navarro,et al. Compressed representations of sequences and full-text indexes , 2007, TALG.
[17] Giovanni Manzini,et al. An analysis of the Burrows-Wheeler transform , 2001, SODA '99.
[18] Johannes Fischer,et al. Suffix Arrays on Words , 2007, CPM.
[19] Volker Heun,et al. A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array , 2007, ESCAPE.
[20] Guy Jacobson,et al. Space-efficient static trees and graphs , 1989, 30th Annual Symposium on Foundations of Computer Science.
[21] Charalambos A. Charalambides,et al. Enumerative combinatorics , 2018, SIGA.
[22] R. Stanley,et al. Enumerative Combinatorics: Index , 1999 .
[23] Dong Kyue Kim,et al. Constructing suffix arrays in linear time , 2005, J. Discrete Algorithms.
[24] Kunihiko Sadakane,et al. Succinct data structures for flexible text retrieval systems , 2007, J. Discrete Algorithms.
[25] Robert E. Tarjan,et al. Scaling and related techniques for geometry problems , 1984, STOC '84.
[26] Enno Ohlebusch,et al. Replacing suffix trees with enhanced suffix arrays , 2004, J. Discrete Algorithms.
[27] Kunihiko Sadakane,et al. Compressed Suffix Trees with Full Functionality , 2007, Theory of Computing Systems.
[28] Dong Kyue Kim,et al. A New Compressed Suffix Tree Supporting Fast Search and Its Construction Algorithm Using Optimal Working Space , 2005, CPM.
[29] Stephen Alstrup,et al. Nearest common ancestors: a survey and a new distributed algorithm , 2002, SPAA.
[30] Uzi Vishkin,et al. Recursive Star-Tree Parallel Data Structure , 1993, SIAM J. Comput..
[31] Gonzalo Navarro,et al. An(other) Entropy-Bounded Compressed Suffix Tree , 2008, CPM.