Randomized Efficient Algorithms for Compressed Strings: the Finger-Print 
Approach

Gasieniec, Leszek; Karpinski, Marek; Plandowski, Wojciech; Rytter, Wojciech

doi:10.1007/3-540-61258-0_3

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Randomized Efficient Algorithms for Compressed Strings: the Finger-Print Approach

MPS-Authors

/persons/resource/persons44478

Gasieniec, Leszek
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

https://rdcu.be/dvx3f
(Publisher version)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Gasieniec, L., Karpinski, M., Plandowski, W., & Rytter, W. (1996). Randomized Efficient Algorithms for Compressed Strings: the Finger-Print Approach. In D. Hirschberg, & G. Myers (Eds.), Combinatorial Pattern Matching (pp. 39-49). Berlin: Springer.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-ABA1-0

Abstract

There is no abstract available