Self-adjusting binary search trees
Journal of the ACM (JACM)
Text compression
Elements of information theory
Elements of information theory
Sorting shuffled monotone sequences
Information and Computation
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Partitioning permutations into increasing and decreasing subsequences
Journal of Combinatorial Theory Series A
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Approximating minimum cocolorings
Information Processing Letters
High-order entropy-compressed text indexes
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
New text indexing functionalities of the compressed suffix arrays
Journal of Algorithms
Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
SIAM Journal on Computing
Rank/select operations on large alphabets: a tool for text indexing
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Compressed Data Structures: Dictionaries and Data-Aware Measures
DCC '06 Proceedings of the Data Compression Conference
ACM Computing Surveys (CSUR)
Compressed representations of sequences and full-text indexes
ACM Transactions on Algorithms (TALG)
Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets
ACM Transactions on Algorithms (TALG)
Optimal lower bounds for rank and select indexes
Theoretical Computer Science
Rank and select revisited and extended
Theoretical Computer Science
Geometric Burrows-Wheeler Transform: Linking Range Searching and Text Indexing
DCC '08 Proceedings of the Data Compression Conference
On the Redundancy of Succinct Data Structures
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Modern Information Retrieval
Scalability of communicators and groups in MPI
Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing
Fully-functional succinct trees
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Untangled monotonic chains and adaptive range search
Theoretical Computer Science
Succinct indexes for strings, binary relations and multilabeled trees
ACM Transactions on Algorithms (TALG)
Optimal succinctness for range minimum queries
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Stronger Lempel-Ziv Based Compressed Text Indexing
Algorithmica
Succinct representations of permutations and functions
Theoretical Computer Science
Measures of Presortedness and Optimal Sorting Algorithms
IEEE Transactions on Computers
LRM-Trees: Compressed indices, adaptive sorting, and compressed permutations
Theoretical Computer Science
| Hi-index | 5.23 |
We prove that, given a permutation @p over [1..n] formed of nRuns sorted blocks of sizes given by the vector R=, there exists a compressed data structure encoding @p in n(1+H(R))=n+@?"i"="1^n^R^u^n^sr"ilog"2nr"i=