Approximate Online Pattern Matching in Sublinear Time.
10.4230/LIPIcs.FSTTCS.2019.10
Saved in:
Main Authors: | , , |
---|---|
Other Authors: | |
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 |
id |
sg-nus-scholar.10635-168864 |
---|---|
record_format |
dspace |
spelling |
sg-nus-scholar.10635-1688642024-04-25T07:33:23Z Approximate Online Pattern Matching in Sublinear Time. Chakraborty, Diptarka Das, Debarati Koucký, Michal DEPARTMENT OF COMPUTER SCIENCE 10.4230/LIPIcs.FSTTCS.2019.10 Leibniz International Proceedings in Informatics, LIPIcs 150 10:1-10:1 completed 2020-06-01T08:15:55Z 2020-06-01T08:15:55Z 2019-12 2020-05-28T07:27:13Z Conference Paper Chakraborty, Diptarka, Das, Debarati, Koucký, Michal (2019-12). Approximate Online Pattern Matching in Sublinear Time.. Leibniz International Proceedings in Informatics, LIPIcs 150 : 10:1-10:1. ScholarBank@NUS Repository. https://doi.org/10.4230/LIPIcs.FSTTCS.2019.10 9783959771313 18688969 https://scholarbank.nus.edu.sg/handle/10635/168864 Schloss Dagstuhl - Leibniz-Zentrum für Informatik Elements |
institution |
National University of Singapore |
building |
NUS Library |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
NUS Library |
collection |
ScholarBank@NUS |
description |
10.4230/LIPIcs.FSTTCS.2019.10 |
author2 |
DEPARTMENT OF COMPUTER SCIENCE |
author_facet |
DEPARTMENT OF COMPUTER SCIENCE Chakraborty, Diptarka Das, Debarati Koucký, Michal |
format |
Conference or Workshop Item |
author |
Chakraborty, Diptarka Das, Debarati Koucký, Michal |
spellingShingle |
Chakraborty, Diptarka Das, Debarati Koucký, Michal Approximate Online Pattern Matching in Sublinear Time. |
author_sort |
Chakraborty, Diptarka |
title |
Approximate Online Pattern Matching in Sublinear Time. |
title_short |
Approximate Online Pattern Matching in Sublinear Time. |
title_full |
Approximate Online Pattern Matching in Sublinear Time. |
title_fullStr |
Approximate Online Pattern Matching in Sublinear Time. |
title_full_unstemmed |
Approximate Online Pattern Matching in Sublinear Time. |
title_sort |
approximate online pattern matching in sublinear time. |
publisher |
Schloss Dagstuhl - Leibniz-Zentrum für Informatik |
publishDate |
2020 |
url |
https://scholarbank.nus.edu.sg/handle/10635/168864 |
_version_ |
1800914023664844800 |