Pages that link to "Item:Q4307377"

The following pages link to Asymptotic properties of data compression and suffix trees (Q4307377):

Displaying 9 items.

• Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees (Q672989) (← links)
• Text indexing with errors (Q925060) (← links)
• A new method for approximate indexing and dictionary lookup with one error (Q1044734) (← links)
• Probabilistic modeling of data structures on words. A reply to Professor Andersson's letter (Q1202935) (← links)
• The asymptotics of waiting times between stationary processes, allowing distortion (Q1305418) (← links)
• Suffix-sorting via Shannon-Fano-Elias codes (Q1662548) (← links)
• Stochastic sub-additivity approach to the conditional large deviation principle (Q1872225) (← links)
• Uncommon suffix tries (Q5175232) (← links)
• Optimal encoding of non-stationary sources (Q5944439) (← links)