Veröffentlichungen im Jahr 2021

Zeitschriften

  • Katrin Casel, Henning Fernau, Serge Gaspers, Benjamin Gras, Markus L. Schmid. On the Complexity of the Smallest Grammar Problem over Fixed Alphabets. Theory of Computing Systems 65
  • Martin Vu, Henning Fernau. Adding Matrix Control: Insertion-Deletion Systems with Substitutions III. Algorithms 14
  • Henning Fernau, Martin Kutrib, Matthias Wendlandt. Self-Verifying Pushdown and Queue Automata. Fundamenta Informaticae 180
  • Henning Fernau, Lakshmanan Kuppusamy, Rufus O. Oladele, Indhumathi Raman. Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars. Fundamenta Informaticae 181
  • Jérôme Monnot, Henning Fernau, David F. Manlove. Algorithmic aspects of upper edge domination. Theoretical Computer Science 877
  • Jens Bruchertseifer, Henning Fernau. Synchronizing series-parallel deterministic automata with loops and related problems. RAIRO-ITA 55
  • Stefan Hoffmann. Constrained synchronization and commutativity. Theoretical Computer Science 890
  • Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman. On the generative capacity of matrix insertion-deletion systems of small sum-norm. Natural Computing 20
  • S. James Immanuel, S. Jayasankar, D. Gnanaraj Thomas, Meenakshi Paramasivan, Robinson Thamburaj, Atulya K. Nagar. Parallel contextual array insertion deletion P systems and Siromoney matrix grammars. International Journal of Parallel, Emergent and Distributed Systems 36

Konferenzen

  • Martin Vu, Henning Fernau. Adding Matrix Control: Insertion-Deletion Systems with Substitutions III. SOFSEM 2021
  • Sven Fiergolla, Petra Wolf. Improving Run Length Encoding by Preprocessing. DCC 2021
  • Stefan Hoffmann. Regularity Conditions for Iterated Shuffle on Commutative Regular Languages. CIAA 2021
  • Stefan Hoffmann. The Commutative Closure of Shuffle Languages over Group Languages is Regular. CIAA 2021
  • Stefan Hoffmann. State Complexity of Permutation and Related Decision Problems on Alphabetical Pattern Constraints. CIAA 2021
  • Stefan Hoffmann. Completely Reachable Automata, Primitive Groups and the State Complexity of the Set of Synchronizing Words. LATA 2021
  • Stefan Hoffmann. State Complexity of the Set of Synchronizing Words for Circular Automata and Automata over Binary Alphabets. LATA 2021
  • Emmanuel Arrighi, Henning Fernau, Daniel Lokshtanov, Mateus de Oliveira Oliveira, Petra Wolf. Diversity in Kemeny Rank Aggregation: A Parameterized Approach. IJCAI 2021
  • Volker Diekert,Henning Fernau, Petra Wolf. Properties of Graphs Specified by a Regular Language. DLT 2021
  • Stefan Hoffmann. State Complexity of Projection on Languages Recognized by Permutation Automata and Commuting Letters. DLT 2021
  • Stefan Hoffmann. Constrained Synchronization and Subset Synchronization Problems for Weakly Acyclic Automata. DLT 2021
  • Emmanuel Arrighi, Henning Fernau, Mateus de Oliveira Oliveira, Petra Wolf. Order Reconfiguration Under Width Constraints. MFCS 2021
  • Nils Morawietz, Petra Wolf. A Timecop's Chase Around the Table. MFCS 2021
  • Ismaël Jecker, Nicolas Mazzocchi, Petra Wolf. Decomposing Permutation Automata. CONCUR 2021
  • Stefan Hoffmann. Computational Complexity of Synchronization Under Sparse Regular Constraints. FCT 2021
  • Henning Fernau, Kshitij Gajjar. The Space Complexity of Sum Labelling. FCT 2021
  • Emmanuel Arrighi, Henning Fernau, Stefan Hoffmann, Markus Holzer, Ismaël Jecker, Mateus de Oliveira Oliveira, Petra Wolf.
    On the Complexity of Intersection Non-emptiness for Star-Free Language Classes. FSTTCS 2021

Buchbeiträge

  • Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora. (Invited Talk) Algorithms and Complexity - 12th International Conference CIAC 2021
  • Henning Fernau. Parsimonious Computational Completeness. DLT 2021

Herausgeberbeiträge

  • Henning Fernau, Andreas Malcher, Giovanni Pighizzini. Preface to Martin Kutrib Festschrift. Acta Informatica 58