The following pages link to Paolo Ferragina (Q205199):
Displayed 50 items.
- (Q232393) (redirect page) (← links)
- On the weak prefix-search problem (Q390882) (← links)
- On optimally partitioning a text to improve its compression (Q634677) (← links)
- Linear time distributed swap edge algorithms (Q783711) (← links)
- A simple storage scheme for strings achieving entropy bounds (Q870846) (← links)
- On compact representations of all-pairs-shortest-path-distance matrices (Q986563) (← links)
- String search in coarse-grained parallel computers (Q1125800) (← links)
- On updating suffix tree labels (Q1129015) (← links)
- Dynamic dictionary matching in external memory (Q1275745) (← links)
- Static and dynamic parallel computation of connected components (Q1322111) (← links)
- Engineering a lightweight suffix array construction algorithm (Q1882475) (← links)
- Distribution-aware compressed full-text indexes (Q2017875) (← links)
- On the performance of learned data structures (Q2031054) (← links)
- The myriad virtues of wavelet trees (Q2389347) (← links)
- Lightweight data indexing and compression in external memory (Q2429367) (← links)
- (Q2768305) (← links)
- Compressed Cache-Oblivious String B-tree (Q2849337) (← links)
- On the Bit-Complexity of Lempel--Ziv Compression (Q2862201) (← links)
- Bicriteria Data Compression: Efficient and Usable (Q2921426) (← links)
- (Q2934654) (← links)
- Compressed representations of sequences and full-text indexes (Q2944557) (← links)
- On the Weak Prefix-Search Problem (Q3011860) (← links)
- Distribution-Aware Compressed Full-Text Indexes (Q3092278) (← links)
- Dynamic Text Indexing under String Updates (Q3128197) (← links)
- The string B-tree (Q3158537) (← links)
- The compressed permuterm index (Q3188992) (← links)
- Suffix Arrays on Words (Q3506934) (← links)
- Boosting textual compression in optimal linear time (Q3546295) (← links)
- Indexing compressed text (Q3546296) (← links)
- Lightweight Data Indexing and Compression in External Memory (Q3557061) (← links)
- The Myriad Virtues of Wavelet Trees (Q3613790) (← links)
- On Optimally Partitioning a Text to Improve Its Compression (Q3639264) (← links)
- (Q4234120) (← links)
- Improved Dynamic Text Indexing (Q4242657) (← links)
- (Q4252745) (← links)
- Optimal On-Line Search and Sublinear Time Update in String Matching (Q4388896) (← links)
- (Q4411402) (← links)
- (Q4527021) (← links)
- On the Parallel Dynamic Dictionary Matching problem: New results with applications (Q4595493) (← links)
- (Q4633889) (← links)
- (Q4643887) (← links)
- RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS (Q4682170) (← links)
- Computational Thinking (Q4689041) (← links)
- (Q4875209) (← links)
- (Q4886088) (← links)
- (Q4945537) (← links)
- Compressed Cache-Oblivious String B-Tree (Q4962629) (← links)
- A “Learned” Approach to Quicken and Compress Rank/Select Dictionaries (Q5147523) (← links)
- Bicriteria Data Compression (Q5242925) (← links)
- String Processing and Information Retrieval (Q5393950) (← links)