Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

83

Voted

SOFSEM
1999
Springer

112views Theoretical Computer Science» more SOFSEM 1999»

Algorithms on Compressed Strings and Arrays

15 years 7 months ago

Algorithms on Compressed Strings and Arrays

Download inf.unisinos.br

Wojciech Rytter

Real-time Traffic

SOFSEM 1999 | Theoretical Computer Science |

claim paper

Related Content

» Reconstructing a Suffix Array

» Cacheoblivious string Btrees

» Cover Array String Reconstruction

» Sublinear Algorithms for Approximating String Compressibility

» Automata on Lempelziv Compressed Strings

» A Unified Algorithm for Accelerating EditDistance Computation via TextCompression

» InPlace Suffix Sorting

» Implementation of a programmable array processor architecture for approximate string match...

» Unified CompressionBased Acceleration of EditDistance Computation

Post Info
More Details (n/a)

Added	05 Aug 2010
Updated	05 Aug 2010
Type	Conference
Year	1999
Where	SOFSEM
Authors	Wojciech Rytter

Comments (0)