![Analysis of algorithms / Coding theory / Computational complexity theory / Pattern matching / Communication / Communication complexity / Matching / Time complexity / Hamming distance / Theoretical computer science / Applied mathematics / Mathematics Analysis of algorithms / Coding theory / Computational complexity theory / Pattern matching / Communication / Communication complexity / Matching / Time complexity / Hamming distance / Theoretical computer science / Applied mathematics / Mathematics](https://www.pdfsearch.io/img/c235c7611f266fe9ac8bfeabde5892a7.jpg)
| Document Date: 2011-03-12 09:28:52 Open Document File Size: 322,63 KBShare Result on Facebook
City Ramat-Gan / Bristol / / Company SIAM Journal / Cambridge University Press / / Country Israel / / Currency USD / / Facility UK Bar-Ilan University / University of Bristol / / IndustryTerm local online pattern matching problems / online model / randomised online space upper bound / online pattern matching / inner product / Information processing letters / distance algorithm / online swap distance problem / distributive computing / streaming algorithms / online pattern matching algorithms / pattern matching algorithm / Online Pattern / online pattern matching problem / computing / online algorithms / online setting / local and non-local online pattern matching problems / space efficient algorithms / Online Pattern Matching Rapha¨el Clifford1 / / Organization Cambridge University / Bar-Ilan University / University of Bristol / / Person Clifford / Bob / Ely Porat / Alice / Benjamin Sach / Markus Jalsenius / / PublishedMedium SIAM Journal on Computing / Theory of Computing / / Technology RAM / matching algorithm / randomised algorithm / sliding windows / online pattern matching algorithms / pattern matching algorithm / randomised Hamming distance algorithm / Hamming distance algorithm / deterministic Hamming distance algorithm / / URL http /
SocialTag |