Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Min-wise independent permutations
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Succinct indexable dictionaries with applications to encoding k-ary trees and multisets
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Low Redundancy in Static Dictionaries with Constant Query Time
SIAM Journal on Computing
Succinct Representation of Balanced Parentheses and Static Trees
SIAM Journal on Computing
The Bit Probe Complexity Measure Revisited
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
A linear lower bound on index size for text retrieval
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Space-efficient static trees and graphs
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Succinct ordinal trees with level-ancestor queries
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Rank/select operations on large alphabets: a tool for text indexing
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Squeezing succinct data structures into entropy bounds
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A simple optimal representation for balanced parentheses
Theoretical Computer Science
Compressed representations of sequences and full-text indexes
ACM Transactions on Algorithms (TALG)
Succinct indexes for strings, binary relations and multi-labeled trees
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A compressed self-index using a Ziv---Lempel dictionary
Information Retrieval
Compressed text indexes: From theory to practice
Journal of Experimental Algorithmics (JEA)
Practical Rank/Select Queries over Arbitrary Sequences
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Cell probe lower bounds for succinct data structures
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Compressing and indexing labeled trees, with applications
Journal of the ACM (JACM)
On the size of succinct indices
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Optimal trade-offs for succinct string indexes
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Practical approaches to reduce the space requirement of lempel-ziv--based compressed text indices
Journal of Experimental Algorithmics (JEA)
Compact and efficient implementation of the MPI group operations
EuroMPI'10 Proceedings of the 17th European MPI users' group meeting conference on Recent advances in the message passing interface
Space-efficient construction of Lempel-Ziv compressed text indexes
Information and Computation
Succinct indexes for strings, binary relations and multilabeled trees
ACM Transactions on Algorithms (TALG)
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
LRM-trees: compressed indices, adaptive sorting, and compressed permutations
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
ESP-index: a compressed index based on edit-sensitive parsing
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
Statistical encoding of succinct data structures
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Reducing the space requirement of LZ-Index
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
A compressed self-index using a ziv-lempel dictionary
SPIRE'06 Proceedings of the 13th international conference on String Processing and Information Retrieval
Efficient implementation of rank and select functions for succinct representation
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Compact representation of posets
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Succinct representations of permutations and functions
Theoretical Computer Science
Self-Indexed Grammar-Based Compression
Fundamenta Informaticae
Dynamic rank-select structures with applications to run-length encoded texts
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
New lower and upper bounds for representing sequences
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Improved grammar-based compressed indexes
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
ESP-index: A compressed index based on edit-sensitive parsing
Journal of Discrete Algorithms
On compressing and indexing repetitive sequences
Theoretical Computer Science
Succinct encoding of arbitrary graphs
Theoretical Computer Science
| Hi-index | 0.00 |
We investigate the problem of succinctly representing an arbitrary permutation, π, on {0, ..., n - 1} so that πk(i) can be computed quickly for any i and any (positive or negative integer) power k. A representation taking (1 + Ɛ)n lg n + O(1) bits suffices to compute arbitrary powers in constant time. A representation taking the optimal [lg n!] + o(n) bits can be used to compute arbitrary powers in O(lg n/lg lg n) time, or indeed in a minimal O(lg n) bit probes.