Abstract is missing.
- On the role of data compression in new productsDafna Sheinwald. [doi]
- Hashing on strings, cryptography, and protection of privacyMichael O. Rabin. [doi]
- A signature technique for similarity-based queriesChristos Faloutsos, H. V. Jagadish, Alberto O. Mendelzon, Tova Milo. 2-20 [doi]
- On the resemblance and containment of documentsAndrei Z. Broder. 21-29 [doi]
- Generalized secret sharing and group-key distribution using short keysAndrew Mayer, Moti Yung. 30-44 [doi]
- Interleaving entropy codesPaul G. Howard. 45-55 [doi]
- Multialphabet coding with separate alphabet descriptionJan Åberg, Yuri M. Shtarkov, Ben J. M. Smeets. 56-65 [doi]
- Near-lossless image compression schemes based on weighted finite automata encoding and adaptive context modellingPaul Bao, Xiaolin Wu 0001. 66-77 [doi]
- Kolmogorov random graphsHarry Buhrman, Ming Li, Paul M. B. Vitányi. 78-96 [doi]
- A probabilistic approach to some asymptotics in source codingS. A. Savari. 97-106 [doi]
- Compression of low entropy strings with Lempel-Ziv algorithmsS. Rao Kosaraju, Giovanni Manzini. 121 [doi]
- A universal upper bound on the performance of the Lempel-Ziv algorithm on maliciously-constructed dataJames I. Lathrop, Martin Strauss 0001. 123-135 [doi]
- A progressive Ziv-Lempel algorithm for image compressionDaniel Greene, Mohan Vishwanath, F. Frances Yao, Tong Zhang. 136-144 [doi]
- Code and parse trees for lossless source encodingJulia Abrahams. 145-171 [doi]
- Vector quantization and density estimationRobert M. Gray, Richard A. Olshen. 172-193 [doi]
- Optimization of the SW algorithm for high-dimensional compressionKrasimir Kolarov, William Lynch. 194-203 [doi]
- A criterion for model selection using minimum description lengthAmir Najmi, Richard A. Olshen, Robert M. Gray. 204-214 [doi]
- Annotated statistical indices for sequence analysisAlberto Apostolico, Mary Ellen Bock, Xuyan Xu. 215-229 [doi]
- Constant-space string-matching in sublinear average timeMaxime Crochemore, Leszek Gasieniec, Wojciech Rytter. 230-239 [doi]
- Multi-string search in BSPPaolo Ferragina, Fabrizio Luccio. 240-252 [doi]
- On the approximate pattern occurrences in a textMireille Régnier, Wojciech Szpankowski. 253-264 [doi]
- Inferring lexical and grammatical structure from sequencesCraig G. Nevill-Manning, Ian H. Witten. 265-274 [doi]
- Hardness of flip-cut problems from optical mapping [DNA molecules application]Vlado Dancík, Sridhar Hannenhalli, S. Muthukrishnan. 275-284 [doi]
- Error resilient data compression with adaptive deletionJames A. Storer. 285-294 [doi]
- Dense coding-a fast alternative to arithmetic codingUlrich Gräf. 295-304 [doi]
- *Kunihiko Sadakane. 305-319 [doi]
- Asymmetry in Ziv/Lempel '78 parsingMartin Cohn, Harald Helfgott. 320-328 [doi]
- Sequence sorting in secondary storageLars Arge, Paolo Ferragina, Roberto Grossi, Jeffrey Scott Vitter. 329-346 [doi]
- Open Problems In Stringology, Thirteen years LaterZvi Galil. 347 [doi]
- Matching for run-length encoded stringsAlberto Apostolico, Gad M. Landau, Steven Skiena. 348-356 [doi]
- Group testing problems with sequences in experimental molecular biologyMartin Farach, Sampath Kannan, E. Knill, S. Muthukrishnan. 357-367 [doi]
- A parallel decoder for LZ2 compression using the ID update heuristicSergio De Agostino. 368-373 [doi]
- Thresholding wavelets for image compressionMaria Grazia Albanesi. 374-389 [doi]
- Practical implementation of the lossless compression algorithmGurgen H. Khachatrian, Ahot Andreasyan. 390-397 [doi]