scientific article; zbMATH DE number 6820282
From MaRDI portal
Publication:4598234
DOI10.4230/LIPIcs.ICALP.2016.93zbMath1388.68026arXiv1604.06264MaRDI QIDQ4598234
Jesper Sindahl Nielsen, Peyman Afshani
Publication date: 19 December 2017
Full work available at URL: https://arxiv.org/abs/1604.06264
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)
Related Items (3)
General space-time tradeoffs via relational queries ⋮ Dynamic and internal longest common substring ⋮ Ranked document retrieval for multiple patterns
This page was built for publication: