Compressed Representations of Permutations, and Applications
暂无分享,去创建一个
[1] Donald E. Knuth,et al. The art of computer programming, volume 3: (2nd ed.) sorting and searching , 1998 .
[2] Christos Levcopoulos,et al. Sorting Shuffled Monotone Sequences , 1990, SWAT.
[3] J. Ian Munro. Succinct Data Structures , 2004, Electron. Notes Theor. Comput. Sci..
[4] Robert E. Tarjan,et al. Self-adjusting binary search trees , 1985, JACM.
[5] Wing-Kai Hon,et al. Compressed data structures: dictionaries and data-aware measures , 2006, Data Compression Conference (DCC'06).
[6] J. Shane Culpepper,et al. Compact Set Representation for Information Retrieval , 2007, SPIRE.
[7] Alejandro López-Ortiz,et al. Faster Adaptive Set Intersections for Text Searching , 2006, WEA.
[8] Kunihiko Sadakane,et al. Ultra-succinct representation of ordered trees , 2007, SODA '07.
[9] Gonzalo Navarro,et al. Implicit Compression Boosting with Applications to Self-indexing , 2007, SPIRE.
[10] H. S. Heaps,et al. Information retrieval, computational and theoretical aspects , 1978 .
[11] Gonzalo Navarro,et al. Reducing the Space Requirement of LZ-Index , 2006, CPM.
[12] Gonzalo Navarro,et al. Compressed full-text indexes , 2007, CSUR.
[13] Giovanni Manzini,et al. An analysis of the Burrows-Wheeler transform , 2001, SODA '99.
[14] Ricardo A. Baeza-Yates,et al. A Fast Set Intersection Algorithm for Sorted Sequences , 2004, CPM.
[15] Gonzalo Navarro,et al. Compressed representations of sequences and full-text indexes , 2007, TALG.
[16] David Richard Clark,et al. Compact pat trees , 1998 .
[17] Ankur Gupta,et al. Succinct Data Structures , 2007 .
[18] Steven Skiena,et al. Encroaching lists as a measure of presortedness , 1988, BIT.
[19] Alexander Golynski. Optimal Lower Bounds for Rank and Select Indexes , 2006, ICALP.
[20] David Thomas,et al. The Art in Computer Programming , 2001 .
[21] M. V. Wilkes,et al. The Art of Computer Programming, Volume 3, Sorting and Searching , 1974 .
[22] John L. Smith. Tables , 1969, Neuromuscular Disorders.
[23] Ricardo A. Baeza-Yates,et al. Adding Compression to Block Addressing Inverted Indexes , 2000, Information Retrieval.
[24] Leonidas J. Guibas,et al. A new representation for linear lists , 1977, STOC '77.
[25] Peter Sanders,et al. Intersection in Integer Inverted Indices , 2007, ALENEX.
[26] Roberto Grossi,et al. High-order entropy-compressed text indexes , 2003, SODA '03.
[27] Curtis R. Cook,et al. Best sorting algorithm for nearly sorted lists , 1980, CACM.
[28] Derick Wood,et al. A survey of adaptive sorting algorithms , 1992, CSUR.
[29] S. Srinivasa Rao,et al. Succinct indexes for strings, binary relations and multilabeled trees , 2011, TALG.
[30] Ian H. Witten,et al. Managing gigabytes 2nd edition , 1999 .
[31] S. Srinivasa Rao,et al. Succinct indexes for strings, binary relations and multi-labeled trees , 2007, SODA '07.
[32] Gonzalo Navarro,et al. Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections , 2008, SPIRE.
[33] Rajeev Raman,et al. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets , 2002, SODA '02.
[34] Heikki Mannila,et al. Measures of Presortedness and Optimal Sorting Algorithms , 1985, IEEE Transactions on Computers.
[35] Gonzalo Navarro,et al. Succinct Suffix Arrays based on Run-Length Encoding , 2005, Nord. J. Comput..
[36] Gonzalo Navarro,et al. Reorganizing compressed text , 2008, SIGIR '08.
[37] Gonzalo Navarro,et al. Practical Rank/Select Queries over Arbitrary Sequences , 2008, SPIRE.
[38] Chi Wang,et al. Partitioning Permutations into Increasing and Decreasing Subsequences , 1996, J. Comb. Theory, Ser. A.
[39] David A. Huffman,et al. A method for the construction of minimum-redundancy codes , 1952, Proceedings of the IRE.
[40] Michael L. Fredman,et al. On computing the length of longest increasing subsequences , 1975, Discret. Math..
[41] T. C. Hu,et al. Optimal Computer Search Trees and Variable-Length Alphabetical Codes , 1971 .
[42] Kunihiko Sadakane,et al. New text indexing functionalities of the compressed suffix arrays , 2003, J. Algorithms.
[43] Ricardo A. Baeza-Yates,et al. Fast and flexible word searching on compressed text , 2000, TOIS.
[44] S. Srinivasa Rao,et al. Succinct Representations of Functions , 2004, ICALP.
[45] S. Srinivasa Rao,et al. Rank/select operations on large alphabets: a tool for text indexing , 2006, SODA '06.
[46] Gonzalo Navarro,et al. Rank and select revisited and extended , 2007, Theor. Comput. Sci..
[47] Andrew Chi-Chih Yao,et al. An Almost Optimal Algorithm for Unbounded Searching , 1976, Inf. Process. Lett..
[48] Roberto Grossi,et al. Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching , 2005, SIAM J. Comput..
[49] Kurt Mehlhorn. Sorting Presorted Files , 1979, Theoretical Computer Science.
[50] Wing-Kai Hon,et al. Compressed data structures: Dictionaries and data-aware measures , 2007, Theor. Comput. Sci..
[51] Rajeev Raman,et al. Succinct Representations of Permutations , 2003, ICALP.
[52] S. Srinivasa Rao,et al. Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents , 2006, CPM.