You are here:
» Upper and lower bounds for dynamic data structures on str...
About Aarhus University
Upper and lower bounds for dynamic data structures on strings
Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review
Documents
- LIPIcs-STACS-2018-22
Final published version, 538 KB, PDF document
DOI
- https://doi.org/10.4230/LIPIcs.STACS.2018.22
Final published version
- Raphael Clifford
- Allan Grønlund
- Kasper Green Larsen
- Tatiana Starikovskaya, École Normale Supérieure
| Original language | English |
|---|---|
| Title of host publication | 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018 |
| Editors | Rolf Niedermeier, Brigitte Vallée |
| Number of pages | 14 |
| Volume | 96 |
| Publisher | Schloss Dagstuhl--Leibniz-Zentrum für Informatik |
| Publication year | 2018 |
| Pages | 22:1-22:14 |
| Article number | 22 |
| ISBN (Electronic) | 9783959770620 |
| DOIs | |
| Publication status | Published - 2018 |
| Event | 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018 - Caen, France Duration: 28 Feb 2018 → 3 Mar 2018 |
Conference
| Conference | 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018 |
|---|---|
| Land | France |
| By | Caen |
| Periode | 28/02/2018 → 03/03/2018 |
| Series | Leibniz International Proceedings in Informatics |
|---|---|
| Number | 96 |
| ISSN | 1868-8969 |
- Conditional Lower Bounds, Exact Pattern Matching with Wildcards, Hamming Distance, Inner Product
Research areas
See relations at Aarhus University Citationformats
Download statistics
No data available
ID: 127722264