Language and Automata Theory and Applications

s of Invited Papers Searching and Indexing Compressed Text

[1]  Christian Komusiewicz,et al.  Multivariate Algorithmics for NP-Hard String Problems , 2014, Bull. EATCS.

[2]  Michael R. Fellows,et al.  Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity , 2013, Eur. J. Comb..

[3]  Henning Fernau,et al.  Pattern Matching with Variables: Fast Algorithms and New Hardness Results , 2015, STACS.

[4]  Rolf Niedermeier,et al.  On the Parameterized Intractability of CLOSEST SUBSTRINGsize and Related Problems , 2002, STACS.

[5]  Henning Fernau,et al.  Problems on Finite Automata and the Exponential Time Hypothesis , 2016, CIAA.

[6]  Henrik Björklund,et al.  The tractability frontier for NFA minimization , 2008, J. Comput. Syst. Sci..

[7]  Henning Fernau.  Parameterized algorithmics for d-Hitting Set , 2010, Int. J. Comput. Math..

[8]  Oren Weimann,et al.  Consequences of Faster Alignment of Sequences , 2014, ICALP.

[9]  Rüdiger Reischuk,et al.  On the complexity of optimal grammar-based compression , 2006, Data Compression Conference (DCC'06).

[10]  Noga Alon,et al.  On Sunflowers and Matrix Multiplication , 2012, Computational Complexity Conference.

[11]  Piotr Indyk,et al.  Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false) , 2014, STOC.

[12]  Henning Fernau,et al.  Characterization and complexity results on jumping finite automata , 2017, Theor. Comput. Sci..

[13]  Henning Fernau,et al.  Simple picture processing based on finite automata and regular grammars , 2018, J. Comput. Syst. Sci..

[14]  Marek Chrobak,et al.  Finite Automata and Unary Languages , 1986, Theor. Comput. Sci..

[15]  DANA ANGLUIN,et al.  On the Complexity of Minimum Inference of Regular Sets , 1978, Inf. Control..

[16]  Henning Fernau.  A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting Set , 2008, Algorithmica.

[17]  Henning Fernau,et al.  Charge and reduce: A fixed-parameter algorithm for String-to-String Correction , 2011, Discret. Optim..

[18]  Henning Fernau,et al.  On the Parameterised Complexity of String Morphism Problems , 2013, FSTTCS.

[19]  David Eppstein,et al.  Reset Sequences for Monotonic Automata , 1990, SIAM J. Comput..

[20]  Christos Tzamos,et al.  Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms , 2016, ICML.

[21]  Henning Fernau,et al.  A multi-parameter analysis of hard problems on deterministic finite automata , 2015, J. Comput. Syst. Sci..

[22]  Henning Fernau,et al.  Parallel Grammars: A Phenomenology , 2003, Grammars.

[23]  Henning Fernau,et al.  On the Complexity of Grammar-Based Compression over Fixed Alphabets , 2016, ICALP.

[24]  Gerhard J. Woeginger,et al.  Exact (Exponential) Algorithms for the Dominating Set Problem , 2004, WG.

[25]  V. V. Williams,et al.  Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

[26]  Abhi Shelat,et al.  The smallest grammar problem , 2005, IEEE Transactions on Information Theory.

[27]  Yoshio Okamoto,et al.  On Problems as Hard as CNF-SAT , 2011, 2012 IEEE 27th Conference on Computational Complexity.

[28]  Pawel Gawrychowski,et al.  Strong Inapproximability of the Shortest Reset Word , 2014, MFCS.

[29]  E. Mark Gold,et al.  Complexity of Automaton Identification from Given Data , 1978, Inf. Control..