Highly efficient dictionary matching in parallel
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Parallel construction and query of suffix trees for two-dimensional matrices
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Optimal parallel dictionary matching and compression (extended abstract)
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Improved dynamic dictionary matching
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Dynamic dictionary matching and compressed suffix trees
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Substring compression problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Cache-oblivious string B-trees
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Compressed indexes for dynamic text collections
ACM Transactions on Algorithms (TALG)
Dynamic dictionary matching using inverted lists
ACST'07 Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology
Faster compressed dictionary matching
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Fingerprints in compressed strings
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |