×

Found 18 Documents (Results 1–18)

Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails. (English) Zbl 1490.68151

Bureš, Tomáš (ed.) et al., SOFSEM 2021: theory and practice of computer science. 47th international conference on current trends in theory and practice of computer science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25–29, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12607, 608-622 (2021).

Succinct representations for (non)deterministic finite automata. (English) Zbl 07405977

Leporati, Alberto (ed.) et al., Language and automata theory and applications. 15th international conference, LATA 2021, Milan, Italy, March 1–5, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12638, 55-67 (2021).
MSC:  68Q45

The fine-grained complexity of Median and center string problems under edit distance. (English) Zbl 07651200

Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 61, 19 p. (2020).
MSC:  68Wxx
Full Text: DOI

Linear time construction of indexable founder block graphs. (English) Zbl 1515.92048

Kingsford, Carl (ed.) et al., 20th international workshop on algorithms in bioinformatics. WABI 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 172, Article 7, 18 p. (2020).
MSC:  92D20 92D10 92-08

Filter Results by …

Document Type

Year of Publication

Main Field

all top 3

Software