default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSEQUENCES 1997: Positano, Amalfitan Coast, Salerno, Italy
- Bruno Carpentieri, Alfredo De Santis, Ugo Vaccaro, James A. Storer:
Compression and Complexity of SEQUENCES 1997, Positano, Amalfitan Coast, Salerno, Italy, June 11-13, 1997, Proceedings. IEEE 1997, ISBN 0-8186-8132-2 - Michael O. Rabin:
Hashing on strings, cryptography, and protection of privacy. - Christos Faloutsos, H. V. Jagadish, Alberto O. Mendelzon, Tova Milo:
A signature technique for similarity-based queries. 2-20 - Andrei Z. Broder:
On the resemblance and containment of documents. 21-29 - Andrew Mayer, Moti Yung:
Generalized secret sharing and group-key distribution using short keys. 30-44 - Paul G. Howard:
Interleaving entropy codes. 45-55 - Jan Åberg, Yuri M. Shtarkov, Ben J. M. Smeets:
Multialphabet coding with separate alphabet description. 56-65 - Paul Bao, Xiaolin Wu:
Near-lossless image compression schemes based on weighted finite automata encoding and adaptive context modelling. 66-77 - Harry Buhrman, Ming Li, Paul M. B. Vitányi:
Kolmogorov random graphs. 78-96 - Serap A. Savari:
A probabilistic approach to some asymptotics in source coding. 97-106 - S. Rao Kosaraju, Giovanni Manzini:
Compression of low entropy strings with Lempel-Ziv algorithms. 121- - Dafna Sheinwald:
On the role of data compression in new products. - James I. Lathrop, Martin Strauss:
A universal upper bound on the performance of the Lempel-Ziv algorithm on maliciously-constructed data. 123-135 - Daniel Greene, Mohan Vishwanath, F. Frances Yao, Tong Zhang:
A progressive Ziv-Lempel algorithm for image compression. 136-144 - Julia Abrahams:
Code and parse trees for lossless source encoding. 145-171 - Robert M. Gray, Richard A. Olshen:
Vector quantization and density estimation. 172-193 - Krasimir Kolarov, William Lynch:
Optimization of the SW algorithm for high-dimensional compression. 194-203 - Amir Najmi, Richard A. Olshen, Robert M. Gray:
A criterion for model selection using minimum description length. 204-214 - Alberto Apostolico, Mary Ellen Bock, Xuyan Xu:
Annotated statistical indices for sequence analysis. 215-229 - Maxime Crochemore
, Leszek Gasieniec, Wojciech Rytter:
Constant-space string-matching in sublinear average time. 230-239 - Paolo Ferragina, Fabrizio Luccio:
Multi-string search in BSP. 240-252 - Mireille Régnier, Wojciech Szpankowski:
On the approximate pattern occurrences in a text. 253-264 - Craig G. Nevill-Manning, Ian H. Witten:
Inferring lexical and grammatical structure from sequences. 265-274 - Vlado Dancík, Sridhar Hannenhalli, S. Muthukrishnan:
Hardness of flip-cut problems from optical mapping [DNA molecules application]. 275-284 - James A. Storer:
Error resilient data compression with adaptive deletion. 285-294 - Ulrich Gräf:
Dense coding-a fast alternative to arithmetic coding. 295-304 - Kunihiko Sadakane:
Text compression using recency rank with context and relation to context sorting, block sorting and PPM*. 305-319 - Martin Cohn, Harald Helfgott:
Asymmetry in Ziv/Lempel '78 parsing. 320-328 - Lars Arge, Paolo Ferragina, Roberto Grossi, Jeffrey Scott Vitter:
Sequence sorting in secondary storage. 329-346 - Zvi Galil:
Open Problems In Stringology, Thirteen years Later. 347 - Alberto Apostolico, Gad M. Landau, Steven Skiena:
Matching for run-length encoded strings. 348-356 - Martin Farach, Sampath Kannan, E. Knill, S. Muthukrishnan:
Group testing problems with sequences in experimental molecular biology. 357-367 - Sergio De Agostino:
A parallel decoder for LZ2 compression using the ID update heuristic. 368-373 - Maria Grazia Albanesi:
Thresholding wavelets for image compression. 374-389 - Gurgen H. Khachatrian, Ahot Andreasyan:
Practical implementation of the lossless compression algorithm. 390-397
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-20 21:05 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
