Upper and lower bounds for dynamic data structures on strings

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

Documents

DOI

Original languageEnglish
Title of host publication35th Symposium on Theoretical Aspects of Computer Science, STACS 2018
EditorsRolf Niedermeier, Brigitte Vallée
Number of pages14
Volume96
PublisherSchloss Dagstuhl--Leibniz-Zentrum für Informatik
Publication year2018
Pages22:1-22:14
Article number22
ISBN (Electronic)9783959770620
DOIs
Publication statusPublished - 2018
Event35th Symposium on Theoretical Aspects of Computer Science, STACS 2018 - Caen, France
Duration: 28 Feb 20183 Mar 2018

Conference

Conference35th Symposium on Theoretical Aspects of Computer Science, STACS 2018
LandFrance
ByCaen
Periode28/02/201803/03/2018
SeriesLeibniz International Proceedings in Informatics
Number96
ISSN1868-8969

    Research areas

  • Conditional Lower Bounds, Exact Pattern Matching with Wildcards, Hamming Distance, Inner Product

See relations at Aarhus University Citationformats

Download statistics

No data available

ID: 127722264