Pages that link to "Item:Q3506925"
From MaRDI portal
The following pages link to Processing Compressed Texts: A Tractability Border (Q3506925):
Displayed 28 items.
- Straight-line programs: a practical test (extended abstract) (Q376125) (← links)
- Fast equality test for straight-line compressed strings (Q436321) (← links)
- Parameter reduction and automata evaluation for grammar-compressed trees (Q440015) (← links)
- An efficient algorithm to test square-freeness of strings compressed by straight-line programs (Q456098) (← links)
- Leaf languages and string compression (Q550251) (← links)
- Compressed word problems in HNN-extensions and amalgamated products (Q639849) (← links)
- Speeding up HMM decoding and training by exploiting sequence repetitions (Q834590) (← links)
- Efficient algorithms to compute compressed longest common substrings and compressed palindromes (Q1006070) (← links)
- Linear-time text compression by longest-first substitution (Q1662518) (← links)
- Unified compression-based acceleration of edit-distance computation (Q1939664) (← links)
- Fast distance multiplication of unit-Monge matrices (Q2350900) (← links)
- Detecting regularities on grammar-compressed strings (Q2514148) (← links)
- Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts (Q2891377) (← links)
- Compressed Membership in Automata with Compressed Labels (Q3007633) (← links)
- Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition (Q3007644) (← links)
- Isomorphism of Regular Trees and Words (Q3012921) (← links)
- THE INCLUSION PROBLEM OF CONTEXT-FREE LANGUAGES: SOME TRACTABLE CASES (Q3086239) (← links)
- Congruence Closure of Compressed Terms in Polynomial Time (Q3172897) (← links)
- Equality Testing of Compressed Strings (Q3449353) (← links)
- Edit Distance for Pushdown Automata (Q3449470) (← links)
- Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time (Q3533023) (← links)
- Unification with Singleton Tree Grammars (Q3636835) (← links)
- The Inclusion Problem of Context-Free Languages: Some Tractable Cases (Q3637217) (← links)
- Random Access to Grammar-Compressed Strings and Trees (Q5255003) (← links)
- Computing Longest Common Substring and All Palindromes from Compressed Strings (Q5448662) (← links)
- Boosting over non-deterministic ZDDs (Q5919322) (← links)
- Tracing compressed curves in triangulated surfaces (Q5919981) (← links)
- The fully compressed subgroup membership problem (Q6038521) (← links)