Computational structure of DST
Computational Geometry: Proximity and Location
Computational Bounds on Hierarchical Data Processing with
Compsci_201_Midterm_1_Review
Compressing Dynamic Data Structures in Operating System Kernels∗
Compressed Text Indexing and Range Searching - Purdue e-Pubs
Compressed Suffix Trees: Design, Construction, and Applications
Compressed Suffix Trees with Full Functionality
Compressed Suffix Arrays and Suffix Trees with Applications to Text
COMPRESSED SUFFIX ARRAYS AND SUFFIX TREES WITH
Compressed Inverted Indexes for In-Memory
Compressed Data Structures for Range Searching
Compressed Data Structures for Dynamic Sequences
Compressed data structures
Compressed Data Structures
Compressed Computation for Text Indexing
Complexity models for incremental computation
Complexity Analysis - Computer Information Systems
Complete Mining of Frequent Patterns from Graphs
Complete Inverted Files for Efficient Text Retrieval and Analysis
