Approximate Online Pattern Matching in Sublinear Time.
10.4230/LIPIcs.FSTTCS.2019.10
Saved in:
Main Authors: | Chakraborty, Diptarka, Das, Debarati, Koucký, Michal |
---|---|
Other Authors: | DEPARTMENT OF COMPUTER SCIENCE |
Format: | Conference or Workshop Item |
Published: |
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
2020
|
Online Access: | https://scholarbank.nus.edu.sg/handle/10635/168864 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Approximating the Median under the Ulam Metric.
by: Chakraborty, Diptarka, et al.
Published: (2023) -
Approximate Trace Reconstruction via Median String (In Average-Case)
by: Chakraborty, Diptarka, et al.
Published: (2023) -
Sublinear-time algorithms for compressive phase retrieval
by: Li, Yi, et al.
Published: (2020) -
Sublinear-time algorithms for compressive phase retrieval
by: Li, Yi, et al.
Published: (2022) -
Deterministic heavy hitters with sublinear query time
by: Li, Yi, et al.
Published: (2018)