■
Team
■
Armin Weiß (Head)
Petra van Schayck (Sekretariat)
Horst Prote (Sysadmin)
Carlos Camino
Caroline Mattes
Florian Stober
Alexander Thumm
■
Ehemalige Mitarbeiter
Björn Appel
Holger Austinat
Andreas Bergen
Michael Bertol
Carlos Camino
■
Volker Diekert
Publications
Lukas Fleischer
Stefan Göller
■
Ulrich Hertrampf
Benjamin Hoffmann
Jonathan Kausch
Steffen Kopecki
Jürn Laun
Alexander Lauser
Markus Lohrey
Alexander Miller
Anca Muscholl
Nicole Ondrusch
Holger Petersen
Heike Photien
Walter Reuß
■
Jan Philipp Wächter
Tobias Walter
Klaus Wich
■
TI Gruppenbild
■
Teaching
■
Research
■
Publications
 

Publications

2022

Journal Articles

  1. Carlos Camino , Volker Diekert , Besik Dundua , Mircea Marin and Géraud Sénizergues
    Regular matching problems for infinite trees
    Logical Methods in Computer Science. Volume 18, Issue 1, 25:1–25:38 2022.
    DOI
    BibTeX

2021

Conference Articles

  1. Volker Diekert , Henning Fernau and Petra Wolf
    Properties of Graphs Specified by a Regular Language
    Developments in Language Theory - 25th International Conference, DLT 2021, Porto, Portugal, August 16-20, 2021, Proceedings, volume 12811 of Lecture Notes in Computer Science, pages 117–129. Springer, 2021.
    DOI
    BibTeX

2020

Conference Articles

  1. Volker Diekert , Igor Potapov and Pavel Semukhin
    Decidability of membership problems for flat rational subsets of GL(2,Z) and singular matrices
    Proc. International Symposium on Symbolic and Algebraic Computation, ISSAC ’20, Kalamata, Greece, July 20-23, 2020, pages 122–129. ACM, 2020.
    DOI
    BibTeX

2019

Journal Articles

  1. Volker Diekert , Igor Potapov and Pavel Semukhin
    Decidability of membership problems for flat rational subsets of GL(2, \mathbbZ ) and singular matrices
    arXiv eprints. abs/1910.02302 2019.
    arXiv
    BibTeX

2017

Journal Articles

  1. Volker Diekert , Florent Martin , Géraud Sénizergues and Pedro V. Silva
    Equations Over Free Inverse Monoids with Idempotent Variables
    Theory Comput. Syst.. 61:494–520. 2017.
    DOI
    BibTeX
  2. Volker Diekert and Tobias Walter
    Characterizing classes of regular languages using prefix codes of bounded synchronization delay
    International Journal of Algebra and Computation. 27:561–590. 2017.
    DOI
    BibTeX
  3. Volker Diekert , Alexei G. Myasnikov and Armin Weiß
    Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem
    J. Symb. Comput.. 83:147–165. 2017.
    DOI
    BibTeX

Conference Articles

  1. Volker Diekert and Lukas Fleischer
    Church-Rosser Systems, Codes with Bounded Synchronization Delay and Local Rees Extensions
    WORDS 2017, Proceedings, volume 10432 of LNCS, pages 6–16. Springer, 2017.
    DOI
    arXiv
    BibTeX
  2. Volker Diekert and Murray Elder
    Solutions of Twisted Word Equations, EDT0L Languages, and Context-Free Groups
    44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), volume 80 of Leibniz International Proceedings in Informatics (LIPIcs), pages 96:1–96:14. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2017.
    DOI
    BibTeX

Book Chapters

  1. Volker Diekert and Armin Weiß
    Context-Free Groups and Bass-Serre Theory
    Algorithmic and Geometric Topics Around Free Groups and Automorphisms, Advanced Courses in Mathematics - CRM Barcelona, Birkhäuser, 2017.
    DOI
    BibTeX

2016

Journal Articles

  1. Volker Diekert and Jonathan Kausch
    Logspace Computations in Graph Products
    Journal of Symbolic Computation. 75(C):94–109. Academic Press, Inc., July 2016.
    DOI
    BibTeX
  2. Volker Diekert , Artur Jeż and Wojciech Plandowski
    Finding all solutions of equations in free groups and monoids with involution
    Information and Computation. 251:263–286. 2016.
    DOI
    BibTeX
  3. Volker Diekert and Manfred Kufleitner
    A Survey on the Local Divisor Technique
    Theoretical Computer Science. 610:13–23. 2016.
    DOI
    BibTeX
  4. Volker Diekert , Alexei G. Myasnikov and Armin Weiß
    Conjugacy in Baumslag’s group, generic case complexity, and division in power circuits
    Algorithmica. 74:961-988. 2016.
    PDF
    DOI
    BibTeX
  5. Laura Ciobanu , Volker Diekert and Murray Elder
    Solution sets for equations over free groups are EDT0L languages
    International Journal of Algebra and Computation. 26:843–886. 2016.
    DOI
    BibTeX
  6. Volker Diekert and Armin Weiß
    QuickHeapsort: Modifications and Improved Analysis
    Theory Comput. Syst.. 59(2):209–230. 2016.
    PDF
    DOI
    BibTeX

Conference Articles

  1. Volker Diekert , Artur Jeż and Manfred Kufleitner
    Solutions of Word Equations Over Partially Commutative Structures
    43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), volume 55 of Leibniz International Proceedings in Informatics (LIPIcs), pages 127:1–127:14. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2016.
    DOI
    BibTeX
  2. Volker Diekert and Tobias Walter
    Characterizing classes of regular languages using prefix codes of bounded synchronization delay
    43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), volume of Leibniz International Proceedings in Informatics (LIPIcs), pages 129:1–129:13. 2016.
    DOI
    BibTeX

2015

Journal Articles

  1. Volker Diekert and Manfred Kufleitner
    Omega-rational expressions with Bounded Synchronization Delay
    Theory of Computing Systems. 56:686–696. Springer-Verlag, 2015.
    DOI
    BibTeX
  2. Volker Diekert , Manfred Kufleitner , Klaus Reinhardt and Tobias Walter
    Regular Languages Are Church-Rosser Congruential
    Journal of the ACM. 62:39:1–39:20. ACM, 2015.
    DOI
    BibTeX
  3. Volker Diekert and Tobias Walter
    Asymptotic Approximation for the Quotient Complexities of Atoms
    Acta Cybernetica. 22:349–357. 2015.
    PDF
    BibTeX
  4. Volker Diekert , Olga Kharlampovich and Atefeh Mohajeri Moghaddam
    SLP compression for solutions of equations with constraints in free and hyperbolic groups
    International Journal of Algebra and Computation. 25:81–112. 2015.
    DOI
    BibTeX

Conference Articles

  1. Volker Diekert , Alexei G. Myasnikov and Armin Weiß
    Amenability of Schreier Graphs and Strongly Generic Algorithms for the Conjugacy Problem
    Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2015, Bath, United Kingdom, July 06 - 09, 2015, pages 141–148. 2015.
    PDF
    DOI
    arXiv
    BibTeX
  2. Laura Ciobanu , Volker Diekert and Murray Elder
    Solution sets for equations over free groups are EDT0L languages
    Proc. 42nd International Colloquium Automata, Languages and Programming (ICALP 2015), Part II, Kyoto, Japan, July 6-10, 2015, volume 9135 of Lecture Notes in Computer Science, pages 134-145. Springer, 2015.
    BibTeX
  3. Volker Diekert , Florent Martin , Géraud Sénizergues and Pedro V. Silva
    Equations over free inverse monoids with idempotent variables
    Proc. 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, volume 9139 of Lecture Notes in Computer Science, pages 173-188. Springer, 2015.
    BibTeX
  4. Volker Diekert , Anca Muscholl and Igor Walukiewicz
    A Note on Monitors and Büchi Automata
    Theoretical Aspects of Computing - ICTAC 2015 - 12th International Colloquium Cali, Colombia, October 29-31, 2015, Proceedings, pages 39–57. 2015.
    DOI
    BibTeX
  5. Volker Diekert
    More Than 1700 1700 Years of Word Equations
    Algebraic Informatics - 6th International Conference, CAI 2015, Stuttgart, Germany, September 1-4, 2015. Proceedings, pages 22–28. 2015.
    DOI
    BibTeX

2014

Journal Articles

  1. Volker Diekert and Martin Leucker
    Topology, monitorable properties and runtime verification
    Theoretical Computer Science. 537:29–41. 2014.
    DOI
    © Elsevier
    BibTeX

Conference Articles

  1. Volker Diekert , Artur Jeż and Wojciech Plandowski
    Finding All Solutions of Equations in Free Groups and Monoids with Involution
    Computer Science Symposium in Russia 2014, CSR 2014, Moscow, Russia, June 7-11, 2014. Proceedings, volume 8476 of Lecture Notes in Computer Science, pages 1–15. Springer, 2014.
    DOI
    © Springer
    BibTeX
  2. Volker Diekert , Alexei G. Myasnikov and Armin Weiß
    Conjugacy in Baumslag’s Group, Generic Case Complexity, and Division in Power Circuits
    Latin American Theoretical Informatics Symposium, pages 1-12. 2014.
    DOI
    BibTeX
  3. Volker Diekert and Jonathan Kausch
    Logspace computations in graph products
    Proc. International Symposium on Symbolic and Algebraic Computation, ISSAC ’14, Kobe, Japan, July 23-25, 2014, pages 138-145. 2014.
    BibTeX

2013

Journal Articles

  1. Volker Diekert , Jürn Laun and Alexander Ushakov
    Efficient algorithms for highly compressed data: The word problem in Higman’s group is in P
    International Journal of Algebra and Computation. 22(8) 2013.
    DOI
    BibTeX
  2. Volker Diekert and Armin Weiß
    Context-Free Groups and Their Structure Trees
    International Journal of Algebra and Computation. 23:611–642. 2013.
    DOI
    arXiv
    BibTeX
  3. Volker Diekert and Armin Weiß
    Context-Free Groups and Bass-Serre Theory
    ArXiv e-prints. 2013.
    PDF
    arXiv
    BibTeX
  4. Volker Diekert and Jonathan Kausch
    Logspace computations in graph products
    arXiv eprints. 2013.
    PDF
    arXiv
    BibTeX

Conference Articles

  1. Volker Diekert and Armin Weiß
    QuickHeapsort: Modifications and Improved Analysis
    Computer Science Symposium in Russia (CSR) 2013, Conference Proceedings, pages 24-35. 2013.
    PDF
    DOI
    arXiv
    © Springer
    BibTeX

Books

  1. Volker Diekert , Manfred Kufleitner and Gerhard Rosenberger
    Elemente der Diskreten Mathematik
    De Gruyter, 2013.
    © De Gruyter
    BibTeX
  2. Volker Diekert , Manfred Kufleitner and Gerhard Rosenberger
    Diskrete algebraische Methoden
    De Gruyter, 2013.
    © De Gruyter
    BibTeX

2012

Journal Articles

  1. Volker Diekert , Manfred Kufleitner and Benjamin Steinberg
    The Krohn-Rhodes Theorem and Local Divisors
    Fundamenta Informaticae. 116:65–77. 2012.
    PDF
    DOI
    arXiv
    © IOS Press
    BibTeX
  2. Volker Diekert , Manfred Kufleitner and Pascal Weil
    Star-Free Languages are Church-Rosser Congruential
    Theoretical Computer Science. 454:129–135. 2012.
    PDF
    DOI
    arXiv
    © 2012, Elsevier
    BibTeX
  3. Volker Diekert , Steffen Kopecki and Victor Mitrana
    Deciding regularity of hairpin completions of regular languages in polynomial time
    Information and Computation. 217:12–30. 2012.
    PDF
    DOI
    arXiv
    © Elsevier
    BibTeX
  4. Volker Diekert and Steffen Kopecki
    Language theoretical properties of hairpin formations
    Theoretical Computer Science. 429:65–73. 2012.
    DOI
    © Elsevier
    BibTeX
  5. Volker Diekert , Andrew J. Duncan and Alexei G. Myasnikov
    Cyclic rewriting and conjugacy problems
    Groups Complexity Cryptology. 4(2):321–355. 2012.
    PDF
    DOI
    arXiv
    BibTeX
  6. Volker Diekert and Alexei G. Myasnikov
    Group Extensions over Infinite Words
    International Journal of Foundations of Computer Science. 23:1001-1019. 2012.
    DOI
    BibTeX
  7. Volker Diekert , Jürn Laun and Alexander Ushakov
    Efficient algorithms for highly compressed data: The Word Problem in Higman’s group is in P
    International Journal of Algebra and Computation. 22(8):1–19. 2012.
    PDF
    DOI
    arXiv
    © World Scientific
    BibTeX

Conference Articles

  1. Volker Diekert and Manfred Kufleitner
    Bounded synchronization delay in omega-rational expressions
    Computer Science Symposium in Russia (CSR) 2012, Conference Proceedings, volume 7353 of Lecture Notes in Computer Science, pages 89–98. Springer-Verlag, 2012.
    DOI
    © Springer
    BibTeX
  2. Volker Diekert , Manfred Kufleitner , Klaus Reinhardt and Tobias Walter
    Regular Languages are Church-Rosser Congruential
    International Colloquium Automata, Languages and Programming (ICALP) 2012, Conference Proceedings, Part II, volume 7392 of Lecture Notes in Computer Science, pages 177–188. Springer-Verlag, 2012.
    PDF
    DOI
    arXiv
    © Springer
    BibTeX
  3. Volker Diekert and Anca Muscholl
    On Distributed Monitoring of Asynchronous Systems
    WoLLIC, pages 70-84. 2012.
    BibTeX
  4. Volker Diekert , Jonathan Kausch and Markus Lohrey
    Logspace Computations in Graph Groups and Coxeter Groups
    Proceedings of LATIN 2012, volume 7256 of Lecture Notes in Computer Science, pages 243–254. 2012.
    PDF
    DOI
    arXiv
    © Springer
    BibTeX
  5. Volker Diekert , Jonathan Kausch and Markus Lohrey
    Logspace computations in Coxeter groups and graph groups
    Computational and Combinatorial Group Theory and Cryptography, volume 582 of Contemporary Mathematics, pages 77–94. Amer. Math. Soc., 2012.
    PDF
    arXiv
    BibTeX
  6. Volker Diekert , Jürn Laun and Alexander Ushakov
    Efficient algorithms for highly compressed data: The Word Problem in Higman’s group is in P
    Proc. 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, Paris, France, volume 14 of Leibniz International Proceedings in Informatics (LIPIcs), pages 218–229. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012.
    PDF
    DOI
    BibTeX
  7. Volker Diekert , Jürn Laun and Alexander Ushakov
    Efficient algorithms for highly compressed data: The Word Problem in Higman’s group is in P
    Proc. 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, Paris, France, volume 14 of LIPIcs, pages 218–229. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012.
    DOI
    BibTeX

2011

Journal Articles

  1. Volker Diekert and Manfred Kufleitner
    Fragments of First-Order Logic over Infinite Words
    Theory of Computing Systems. 48(3):486–516. Springer New York, 2011.
    FMI, Universität Stuttgart, Universitätsstraße 38, 70569 Stuttgart, Germany
    PDF
    DOI
    arXiv
    © Springer
    BibTeX
  2. Volker Diekert and Steffen Kopecki
    It is NL-Complete to Decide Whether a Hairpin Completion of Regular Languages is Regular
    International Journal of Foundations of Computer Science (IJFCS). 22(8):1813–1828. 2011.
    PDF
    DOI
    arXiv
    © World Scientific
    BibTeX
  3. Volker Diekert and Jürn Laun
    On Computing Geodesics in Baumslag-Solitar Groups
    International Journal of Algebra and Computation. 21(1-2):119–145. 2011.
    PDF
    arXiv
    © World Scientific
    BibTeX

Conference Articles

  1. Volker Diekert and Alexei G. Myasnikov
    Solving Word Problems in Group Extensions over Infinite Words
    Developments in Language Theory, pages 192-203. 2011.
    PDF
    DOI
    arXiv
    © Springer
    BibTeX
  2. V. Diekert and A. Myasnikov
    Group extensions over infinite words
    Developments in Language Theory, 15th International Conference, DLT 2011, Milan, Italy, July 19-22, 2011. Proceedings, volume 6795 of Lecture Notes in Computer Science, pages 192–203. Springer, 2011.
    BibTeX

Book Chapters

  1. Volker Diekert and Anca Muscholl
    Trace Theory
    Encyclopedia of Parallel Computing, pages 2071–2079. Springer, 2011.
    PDF
    DOI
    © Springer
    BibTeX
  2. Volker Claus , Volker Diekert and Holger Petersen
    Marriage Broker
    Algorithms Unplugged, Chapter 35, pages 345–355. Springer, 2011.
    1st edition
    DOI
    © Springer
    BibTeX

2010

Journal Articles

  1. Volker Diekert , Tero Harju and Dirk Nowotka
    Weinbaum Factorizations of Primitive Words
    Russian Mathematics. 54(1):16–25. 2010.
    PDF
    DOI
    © Springer
    russian version
    © Kasan State University
    BibTeX

Conference Articles

  1. Volker Diekert and Steffen Kopecki
    Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract)
    Implementation and Application of Automata - 15th International Conference (CIAA) 2010, volume 6482 of Lecture Notes in Computer Science, pages 105–114. Springer-Verlag, 2010.
    PDF
    DOI
    Technical Report
    © Springer
    BibTeX
  2. Volker Diekert , Andrew J. Duncan and Alexei G. Myasnikov
    Geodesic rewriting systems and pregroups
    Combinatorial and Geometric Group Theory, Trends in Mathematics, pages 55–91. Birkhäuser, 2010.
    PDF
    DOI
    © Springer
    BibTeX

2009

Journal Articles

  1. Volker Diekert and Dalia Krieger
    Some remarks about stabilizers
    Theoretical Computer Science. 410(30-32):2935–2946. 2009.
    PDF
    DOI
    © Elsevier
    BibTeX

Conference Articles

  1. Volker Diekert and Manfred Kufleitner
    Fragments of First-Order Logic over Infinite Words
    26th International Symposium on Theoretical Aspects of Computer Science (STACS) 2009, Leibniz International Proceedings in Informatics (LIPIcs), pages 325–336. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2009.
    PDF
    DOI
    arXiv
    full version
    BibTeX
  2. Volker Diekert and Paul Gastin
    Local safety and local liveness for distributed systems
    Perspectives in Concurrency Theory, pages 86–106. Universities Press, IARCS-Universities, 2009.
    PDF
    © Universities Press
    BibTeX
  3. Volker Diekert , Steffen Kopecki and Victor Mitrana
    On the Hairpin Completion of Regular Languages
    Theoretical Aspects of Computing - ICTAC 2009, volume 5684 of Lecture Notes in Computer Science, pages 170–184. Springer, 2009.
    DOI
    © Springer
    BibTeX

Book Chapters

  1. Volker Diekert and Ulrich Hertrampf
    Komplexität der Geographie
    Informatik als Dialog zwischen Theorie und Anwendung: Festschrift für Volker Claus zum 65. Geburtstag, Chapter 11, pages 119–132. Vieweg+Teubner, 2009.
    PDF
    DOI
    © Springer Vieweg
    BibTeX
  2. Volker Diekert and Klaus-Jörn Lange
    Variationen über Walther von Dyck und Dyck-Sprachen
    Informatik als Dialog zwischen Theorie und Anwendung: Festschrift für Volker Claus zum 65. Geburtstag, Chapter 13, pages 147–154. Vieweg+Teubner, 2009.
    PDF
    DOI
    © Springer Vieweg
    BibTeX

2008

Journal Articles

  1. Volker Diekert , Paul Gastin and Manfred Kufleitner
    A Survey on Small Fragments of First-Order Logic over Finite Words
    International Journal of Foundations of Computer Science. 19:513–548. 2008.
    PDF
    DOI
    © World Scientific
    BibTeX
  2. Volker Diekert and Markus Lohrey
    Word equations over graph products
    International Journal of Algebra and Computation. 18:493–533. 2008.
    PDF
    DOI
    © World Scientific
    BibTeX
  3. Volker Diekert and Markus Lohrey
    Word Equations over Graph Products
    International Journal of Algebra and Computation. 18(3):493-533. 2008.
    BibTeX
  4. Volker Diekert , Markus Lohrey and Alexander Miller
    Partially commutative inverse monoids
    Semigroup Forum. 77(2):196–226. 2008.
    DOI
    © Springer
    BibTeX
  5. Volker Diekert , Nicole Ondrusch and Markus Lohrey
    Algorithmic Problems on Inverse Monoids over Virtually Free Groups
    International Journal of Algebra and Computation. 18(1):181–208. 2008.
    PDF
    DOI
    © World Scientific
    BibTeX

Conference Articles

  1. V. Claus , V. Diekert and H. Petersen
    Partnerschaftsvermittlung
    Taschenbuch der Algorithmen, pages 373-384. Springer-Verlag, 2008.
    BibTeX

Book Chapters

  1. Volker Diekert and Paul Gastin
    First-order definable languages
    Logic and Automata: History and Perspectives, Texts in Logic and Games, pages 261–306. Amsterdam University Press, 2008.
    PDF
    © AUP
    BibTeX
  2. Volker Claus , Volker Diekert and Holger Petersen
    Partnerschaftsvermittlung
    Taschenbuch der Algorithmen, pages 373–384. Springer, 2008.
    PDF
    DOI
    © Springer
    BibTeX

2007

Journal Articles

  1. Volker Diekert , Martin Horsch and Manfred Kufleitner
    On First-Order Fragments for Mazurkiewicz Traces
    Fundamenta Informaticae. 80(1-3):1–29. 2007.
    PDF
    WWW
    © IOS Press
    BibTeX

Conference Articles

  1. Volker Diekert and Manfred Kufleitner
    On First-Order Fragments for Words and Mazurkiewicz Traces: A Survey
    Developments in Language Theory, 11th International Conference, DLT 2007, Turku, Finland, July 3-6, 2007, Proceedings, volume 4588 of Lecture Notes in Computer Science, pages 1–19. Springer-Verlag, 2007.
    PDF
    DOI
    © Springer
    BibTeX

2006

Journal Articles

  1. Volker Diekert and Paul Gastin
    Pure future local temporal logics are expressively complete for Mazurkiewicz traces
    Information and Computation. 204:1597–1619. 2006.
    PDF
    DOI
    © Elsevier
    BibTeX
  2. Volker Diekert and Anca Muscholl
    Solvability of Equations in Free Partially Commutative Groups is Decidable
    International Journal of Algebra and Computation. 16:1047–1070. 2006.
    PDF
    DOI
    © World Scientific
    BibTeX
  3. Volker Diekert and Paul Gastin
    From local to global temporal logics over Mazurkiewicz traces
    Theoretical Computer Science. 356(1–2):125–135. 2006.
    PDF
    DOI
    © Elsevier
    BibTeX

Conference Articles

  1. Volker Diekert , Markus Lohrey and Alexander Miller
    Partially commutative inverse monoids
    Proceedings of the 31th International Symposium on Mathematical Foundations of Computer Science (MFCS 2006), Bratislave (Slovakia), volume 4162 of Lecture Notes in Computer Science, pages 292–304. Springer-Verlag, 2006.
    PDF
    DOI
    © Springer
    BibTeX

proceedings

  1. Volker Diekert and Michel Habib
    Theory of Computing Systems: Special Issue of the 21st International Symposium on Theoretical Aspects of Computer Science (STACS’04), Montpellier 2004, Proceedings
    Springer, 2006.
    DOI
    © Springer
    BibTeX

2005

Journal Articles

  1. Holger Austinat , Volker Diekert , Ulrich Hertrampf and Holger Petersen
    Regular Frequency Computations
    Theoretical Computer Science. 330(1):15–21. 2005.
    PDF
    DOI
    © Elsevier
    BibTeX
  2. Volker Diekert , Claudio Gutiérrez and Hagenah
    The existential theory of equations with rational constraints in free groups is PSPACE-complete
    Information and Computation. 202:105–140. 2005.
    PDF
    DOI
    © Elsevier
    BibTeX

2004

Journal Articles

  1. Volker Diekert and Markus Lohrey
    Existential and Positive Theories of Equations in Graph Products
    Theory of Computing Systems. 37:133–156. 2004.
    PDF
    DOI
    © Springer
    BibTeX
  2. Volker Diekert and Paul Gastin
    Local temporal logic is expressively complete for cograph dependence alphabets
    Information and Computation. 195:30–52. 2004.
    PDF
    © Elsevier
    BibTeX

Conference Articles

  1. Volker Diekert and Paul Gastin
    Pure future Local Temporal Logics are expressively complete for Mazurkiewicz Traces
    Proceedings of the 6th Latin American Theoretical Informatics Symposium (LATIN’04), Buenos Aires, volume 2976 of Lecture Notes in Computer Science, pages 232–241. Springer-Verlag, 2004.
    PDF
    DOI
    © Springer
    BibTeX

2003

Journal Articles

  1. Holger Austinat , Volker Diekert and Ulrich Hertrampf
    A Structural Property of Regular Frequency Computations
    Theoretical Computer Science. 292(1):33–43. 2003.
    PS
    DOI
    © Elsevier
    BibTeX

Conference Articles

  1. Volker Diekert and Manfred Kufleitner
    A Remark about Quadratic Trace Equations
    Developments in Language Theory: DLT 2002, Kyoto, Japan, volume 2450 of Lecture Notes in Computer Science, pages 59–66. Springer-Verlag, 2003.
    PS
    DOI
    © Springer
    BibTeX
  2. Volker Diekert and Markus Lohrey
    Word equations over graph products
    Proceedings of the 23rd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2003), Mumbai (India), volume 2914 of Lecture Notes in Computer Science, pages 156–167. Springer-Verlag, 2003.
    PS
    DOI
    © Springer
    BibTeX

2002

Journal Articles

  1. Volker Diekert and Paul Gastin
    LTL is expressively complete for Mazurkiewicz traces
    Journal of Computer and System Sciences. 64:396–418. 2002.
    PDF
    DOI
    © Elsevier
    BibTeX
  2. Volker Diekert and Markus Lohrey
    A note on the existential theory of equations in plain groups
    International Journal of Algebra and Computation. 12:1–7. 2002.
    PDF
    DOI
    © World Scientific
    BibTeX

Conference Articles

  1. Volker Diekert
    A Pure Future Local Temporal Logic Beyond Cograph-Monoids
    Proc. RIMS Symposium on Algebraic Systems, Formal Languages and Conventional and Unconventional Computation Theory, Kyoto, Japan 2002, pages . 2002.
    PS
    BibTeX
  2. Volker Diekert and Markus Lohrey
    Existential and Positive Theories of Equations in Graph Products
    Proc. 19th Annual Symposium on Theoretical Aspects of Computer Science (STACS’02), Juan les Pin (France), 2002, volume 2285 of Lecture Notes in Computer Science, pages 501–512. Springer-Verlag, 2002.
    PS
    DOI
    © Springer
    BibTeX

Book Chapters

  1. Volker Diekert and Paul Gastin
    Safety and Liveness Properties for Real Traces and a Direct Translation from LTL to Monoids
    Formal and Natural Computing — Essays Dedicated to Grzegorz Rozenberg, volume 2300 of Lecture Notes in Computer Science, pages 26–38. Springer-Verlag, 2002.
    PS
    DOI
    © Springer
    BibTeX
  2. Volker Diekert
    Makanin’s Algorithm
    Algebraic Combinatorics on Words, volume 90 of Encyclopedia of Mathematics and Its Applications, Chapter 12, pages 387–442. Cambridge University Press, 2002.
    PS
    © Cambridge University Press
    BibTeX

2001

Journal Articles

  1. Volker Diekert , Claudio Gutiérrez and \relax Christian Hagenah
    The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-Complete
    Computing Research Repository (arXiv eprints). cs.DS/0103018 2001.
    PDF
    arXiv
    BibTeX

Conference Articles

  1. Volker Diekert and Paul Gastin
    Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets
    Proc. 8th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR’01), Havanna (Cuba), volume 2250 of Lecture Notes in Computer Science, pages 55–69. Springer-Verlag, 2001.
    DOI
    © Springer
    BibTeX
  2. Volker Diekert , Claudio Gutiérrez and Hagenah
    The existential theory of equations with rational constraints in free groups is PSPACE-complete
    Proc. 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS’01), Dresden (Germany), 2001, volume 2010 of Lecture Notes in Computer Science, pages 170–182. Springer-Verlag, 2001.
    PS
    DOI
    © Springer
    BibTeX
  3. Volker Diekert and Anca Muscholl
    Solvability of Equations in Free Partially Commutative Groups is Decidable
    Proc. 28th International Colloquium Automata, Languages and Programming (ICALP’01), volume 2076 of Lecture Notes in Computer Science, pages 543–554. Springer-Verlag, 2001.
    PS
    DOI
    © Springer
    BibTeX

2000

Conference Articles

  1. Holger Austinat , Volker Diekert , Ulrich Hertrampf and Holger Petersen
    On Regular Frequency Computations
    Proc. RIMS Symposium on Algebraic Systems, Formal Languages and Computation, Kyoto, Japan, pages 35–42. 2000.
    BibTeX
  2. Volker Diekert and Paul Gastin
    LTL is expressively complete for Mazurkiewicz traces
    Proc. 27th International Colloquium Automata, Languages and Programming (ICALP’2000), Geneva (Switzerland), volume 1853 of Lecture Notes in Computer Science, pages 211–222. Springer-Verlag, 2000.
    PS
    DOI
    © Springer
    BibTeX

1999

Journal Articles

  1. Volker Diekert , Matiyasevich and Anca Muscholl
    Solving word equations modulo partial commutations
    Theoretical Computer Science. 224:215–235. 1999.
    PS
    DOI
    © Elsevier
    BibTeX

Conference Articles

  1. Volker Diekert and Paul Gastin
    An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces
    Proc. 13th Computer Science Logic (CSL’99), Madrid (Spain) 1999, volume 1683 of Lecture Notes in Computer Science, pages 188–203. Springer-Verlag, 1999.
    DOI
    © Springer
    BibTeX
  2. Volker Diekert and Yuji Kobayashi
    Some Identities Related to Automata, Determinants, and Möbius Functions
    Algebraic Engineering, Proc. International Workshop on Formal Languages and Computer Systems, Kyoto, Japan, 18–21 March 1997, and the First International Conference on Semigroups and Algebraic Engineering, Aizu, Japan, 24–28 March 1997, pages 330–349. World Scientific, 1999.
    © World Scientific
    BibTeX
  3. John Michael Robson and Volker Diekert
    On Quadratic Word Equations
    Proc. 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS’99), Trier (Germany), volume 1563 of Lecture Notes in Computer Science, pages 217–226. Springer-Verlag, 1999.
    DOI
    © Springer
    BibTeX

Book Chapters

  1. Volker Diekert and John Michael Robson
    Quadratic word equations
    Jewels are forever – Contributions on Theoretical Computer Science in Honor of Arto Salomaa, pages 314–326. Springer-Verlag, 1999.
    DOI
    © Springer
    BibTeX

1998

Journal Articles

  1. Beatrice Bérard , Volker Diekert , Paul Gastin and Antoine Petit
    Characterization of the Expressive Power of Silent Transitions in Timed Automata
    Fundamenta Informaticae. 36:145–182. 1998.
    DOI
    © IOS Press
    BibTeX
  2. Volker Diekert and Paul Gastin
    Approximating Traces
    Acta Informatica. 35:567–593. 1998.
    DOI
    © Springer
    BibTeX

1997

Conference Articles

  1. Volker Diekert , Paul Gastin and Antoine Petit
    Removing \varepsilon \varepsilon -Transitions in Timed Automata
    Proc. 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS’97), Lübeck (Germany), 1997, volume 1200 of Lecture Notes in Computer Science, pages 583–594. Springer-Verlag, 1997.
    DOI
    © Springer
    BibTeX
  2. Volker Diekert , Matiyasevich and Anca Muscholl
    Solving trace equations using lexicographical normal forms
    Proc. 24th International Colloquium Automata, Languages and Programming (ICALP’97), Bologna, volume 1256 of Lecture Notes in Computer Science, pages 336–347. Springer-Verlag, 1997.
    PDF
    DOI
    © Springer
    BibTeX

Book Chapters

  1. Volker Diekert
    A Remark on Trace Equations
    Foundations of Computer Science, volume 1337 of Lecture Notes in Computer Science, pages 251–260. Springer-Verlag, 1997.
    DOI
    © Springer
    BibTeX
  2. Volker Diekert and Yves Métivier
    Partial Commutation and Traces
    Handbook of Formal Languages, Volume 3: Beyond Words., pages 457–533. 1997.
    DOI
    BibTeX

1996

Journal Articles

  1. Volker Diekert and Anca Muscholl
    A note on Métivier’s construction of asynchronous automata for triangulated graphs
    Fundamenta Informaticae. 25:241–246. 1996.
    PDF
    DOI
    © IOS Press
    BibTeX

Conference Articles

  1. Michael Bertol and Volker Diekert
    Trace rewriting: Computing normal forms in time \cal O(n \log n) \cal O(n \log n) .
    Proc. 13th Annual Symposium on Theoretical Aspects of Computer Science (STACS’96), Grenoble (France), volume 1046 of Lecture Notes in Computer Science, pages 269–280. Springer-Verlag, 1996.
    PS
    DOI
    © Springer
    BibTeX
  2. Volker Diekert , Paul Gastin and Antoine Petit
    Recent developments in trace theory
    Developments in Language Theory II, pages 373–385. World Scientific, 1996.
    DLT’95 bei DBLP
    BibTeX
  3. Volker Diekert and Anca Muscholl
    Code problems on traces
    Proc. 21st Symposium on Mathematical Foundations of Computer Science (MFCS’96), Cracow (Poland), volume 1113 of Lecture Notes in Computer Science, pages 2–17. Springer-Verlag, 1996.
    PDF
    DOI
    © Springer
    BibTeX

1995

Journal Articles

  1. Volker Diekert , Paul Gastin and Antoine Petit
    Rational and recognizable complex trace languages
    Information and Computation. 116:134–153. 1995.
    DOI
    © Elsevier
    BibTeX
  2. Celia Wrathall and Volker Diekert
    On Confluence of One-Rule Trace-Rewriting Systems
    Mathematical Systems Theory. 28:341–361. 1995.
    DOI
    © Springer
    BibTeX

Conference Articles

  1. Michael Bertol and Volker Diekert
    On efficient reduction-algorithms for some trace rewriting systems
    Term Rewriting, volume 909 of Lecture Notes in Computer Science, pages 114–126. Springer-Verlag, 1995.
    PS
    DOI
    © Springer
    BibTeX
  2. Volker Diekert and Paul Gastin
    A Domain for Concurrent Termination: A Generalization of Mazurkiewicz traces
    Proc. 22nd International Colloquium Automata, Languages and Programming (ICALP’95), Szeged, volume 944 of Lecture Notes in Computer Science, pages 15–26. Springer-Verlag, 1995.
    DOI
    © Springer
    BibTeX
  3. Volker Diekert , Anca Muscholl and Klaus Reinhardt
    On Codings of Traces
    Proc. 12th Annual Symposium on Theoretical Aspects of Computer Science (STACS’95), Munich (Germany), volume 900 of Lecture Notes in Computer Science, pages 385–396. Springer-Verlag, 1995.
    DOI
    © Springer
    BibTeX
  4. Volker Diekert , Paul Gastin and Antoine Petit
    Recent Developments in Trace Theory
    Developments in Language Theory II, pages 373–385. World Scientific, 1995.
    DLT’95 bei DBLP
    BibTeX

Book Chapters

  1. Volker Diekert
    Komplexitätstheorie
    Teubner Taschenbuch der Mathematik, Teil II, pages 65–79. Teubner, 1995.
    © Springer Vieweg
    BibTeX
  2. Volker Diekert and Anca Muscholl
    Construction of Asynchronous Automata
    The Book of Traces, Chapter 8, pages 249–267. World Scientific, 1995.
    © World Scientific
    BibTeX

1994

Journal Articles

  1. Volker Diekert
    A partial trace semantics for Petri nets
    Theoretical Computer Science. 134:87–105. 1994.
    DOI
    © Elsevier
    BibTeX
  2. Volker Diekert and Anca Muscholl
    Deterministic asynchronous automata for infinite traces
    Acta Informatica. 31:379–397. 1994.
    DOI
    © Springer
    BibTeX
  3. Volker Diekert , Edward Ochmański and Klaus Reinhardt
    On confluent semi-commutation systems — decidability and complexity results
    Information and Computation. 110:164–182. 1994.
    DOI
    © Elsevier
    BibTeX

Conference Articles

  1. Volker Diekert
    Partial Traces
    Words, Languages and Combinatorics II (Kyoto, Japan 1992), pages 87–97. World Scientific, Singapore, 1994.
    BibTeX

1993

Journal Articles

  1. Volker Diekert
    On the concatenation of infinite traces
    Theoretical Computer Science. 113:35–54. 1993.
    DOI
    © Elsevier
    BibTeX
  2. Volker Diekert
    Möbius functions and confluent semi-commutations
    Theoretical Computer Science. 108:25–43. 1993.
    DOI
    © Elsevier
    BibTeX

Conference Articles

  1. Volker Diekert
    Rewriting, semi-commutations, and Möbius functions
    Proc. 9th Fundamentals of Computation Theory (FCT’93), Szeged (Hungary) 1993, volume 710 of Lecture Notes in Computer Science, pages 1–15. Springer-Verlag, 1993.
    DOI
    © Springer
    BibTeX
  2. Volker Diekert
    Complex and complex-like traces
    Proc. 18th Symposium on Mathematical Foundations of Computer Science (MFCS’93), Gdansk (Poland), 1993, volume 711 of Lecture Notes in Computer Science, pages 68–82. Springer-Verlag, 1993.
    DOI
    © Springer
    BibTeX
  3. Volker Diekert and Anca Muscholl
    Deterministic asynchronous automata for infinite traces
    Proc. 10th Annual Symposium on Theoretical Aspects of Computer Science (STACS’93), Würzburg (Germany), 1993, volume 665 of Lecture Notes in Computer Science, pages 617–628. Springer-Verlag, 1993.
    DOI
    © Springer
    BibTeX

1992

Journal Articles

  1. Volker Diekert
    Mathematical aspects of trace theory
    Mitt. Math. Ges. Hamburg. 12:1171–1181. 1992.
    BibTeX

Conference Articles

  1. Volker Diekert
    Möbius functions and confluent semi-commutation systems
    Words, Languages and Combinatorics (Kyoto, Japan 1990), pages 119–130. World Scientific, Singapore, 1992.
    DOI
    © Elsevier
    BibTeX
  2. Celia Wrathall , Volker Diekert and Friedrich Otto
    One-Rule Trace-Rewriting Systems and Confluence
    Proc. 17th Symposium on Mathematical Foundations of Computer Science (MFCS’92), Prague (Czechoslovakia), 1992, volume 629 of Lecture Notes in Computer Science, pages 511–521. Springer-Verlag, 1992.
    DOI
    © Springer
    BibTeX

1991

Journal Articles

  1. Volker Diekert and Ronald V. Book
    On “inherently context-sensitive” languages – An application of complexity cores
    Information Processing Letters. 40:21–23. 1991.
    DOI
    © Elsevier
    BibTeX

Conference Articles

  1. Volker Diekert , Paul Gastin and Antoine Petit
    Recognizable complex trace languages
    Proc. 16th Symposium on Mathematical Foundations of Computer Science (MFCS’91), Kazimierz Dolny (Poland), 1991, volume 520 of Lecture Notes in Computer Science, pages 131–140. Springer-Verlag, 1991.
    DOI
    © Springer
    BibTeX
  2. Volker Diekert
    On the concatenation of infinite traces
    Proc. 8th Annual Symposium on Theoretical Aspects of Computer Science (STACS’91), Hamburg (Germany), 1991, volume 480 of Lecture Notes in Computer Science, pages 105–117. Springer-Verlag, 1991.
    DOI
    © Springer
    BibTeX
  3. Volker Diekert , Edward Ochmański and Klaus Reinhardt
    On confluent semi-commutation systems — decidability and complexity results
    Proc. 18th International Colloquium Automata, Languages and Programming (ICALP’91), Madrid, volume 510 of Lecture Notes in Computer Science, pages 229–241. Springer-Verlag, 1991.
    DOI
    © Springer
    BibTeX

1990

Journal Articles

  1. Volker Diekert
    Research topics in the theory of free partially commutative monoids
    Bulletin of the European Association for Theoretical Computer Science (EATCS). 40:479–491. Febuary 1990.
    BibTeX
  2. Volker Diekert
    Word problems over traces which are solvable in linear time
    Theoretical Computer Science. 74:3–18. 1990.
    DOI
    © Elsevier
    BibTeX

Conference Articles

  1. Volker Diekert
    Combinatorial rewriting on traces
    Proc. 7th Annual Symposium on Theoretical Aspects of Computer Science (STACS’90), Rouen (France), 1990, volume 415 of Lecture Notes in Computer Science, pages 138–151. Springer-Verlag, 1990.
    DOI
    © Springer
    BibTeX

Books

  1. Volker Diekert
    Combinatorics on Traces
    In volume 454 of Lecture Notes in Computer Science. Springer-Verlag, 1990.
    DOI
    © Springer
    BibTeX

1989

Journal Articles

  1. Volker Diekert
    On the Knuth-Bendix completion for concurrent processes
    Theoretical Computer Science. 66:117–136. 1989.
    DOI
    © Elsevier
    BibTeX
  2. Volker Diekert and Axel Möbus
    Hotz-isomorphism theorems in Formal Language Theory
    R.A.I.R.O. — Informatique Théorique et Applications. 23:29–43. 1989.
    BibTeX
  3. Volker Diekert and Walter Vogler
    On the synchronization of traces
    Mathematical Systems Theory. 22:161–175. 1989.
    DOI
    © Springer
    BibTeX

Conference Articles

  1. Volker Diekert
    Word problems over traces which are solvable in linear time
    Proc. 6th Annual Symposium on Theoretical Aspects of Computer Science (STACS 1989), Paderborn (Germany), volume 349 of Lecture Notes in Computer Science, pages 168–180. Springer-Verlag, 1989.
    DOI
    © Springer
    BibTeX

1988

Conference Articles

  1. Volker Diekert
    Transitive orientations, Möbius functions and complete semi-Thue systems for free partially commutative monoids
    Proc. 15th International Colloquium Automata, Languages and Programming (ICALP’88), Tampere, volume 317 of Lecture Notes in Computer Science, pages 176–187. Springer-Verlag, 1988.
    DOI
    © Springer
    BibTeX
  2. Volker Diekert and Manfred Kudlek
    Small deterministic Turing machines
    Proc. 2nd Conference on Automata, Languages and Programming Systems, Salgótarján (Hungary) 1988, pages 77–87. Department of Mathematics, Karl Marx University of Economics, 1988.
    BibTeX
  3. Volker Diekert and Axel Möbus
    Hotz-isomorphism theorems in Formal Language Theory
    Proc. 5th Annual Symposium on Theoretical Aspects of Computer Science (STACS’88), Bordeaux (France), 1988, volume 294 of Lecture Notes in Computer Science, pages 126–135. Springer-Verlag, 1988.
    DOI
    © Springer
    BibTeX
  4. Volker Diekert and Walter Vogler
    Local checking of trace synchronizability
    Proc. 13th Symposium on Mathematical Foundations of Computer Science (MFCS’88), Carlsbad (Czechoslovakia), 1988, volume 324 of Lecture Notes in Computer Science, pages 271–279. Springer-Verlag, 1988.
    DOI
    © Springer
    BibTeX

1987

Journal Articles

  1. Volker Diekert
    On some variants of the Ehrenfeucht conjecture
    Theoretical Computer Science. 46:313–318. 1987.
    DOI
    © Elsevier
    BibTeX

Conference Articles

  1. Volker Diekert
    On the Knuth-Bendix completion for concurrent processes
    Proc. 14th International Colloquium Automata, Languages and Programming (ICALP’87), Karlsruhe, volume 267 of Lecture Notes in Computer Science, pages 42–53. Springer-Verlag, 1987.
    DOI
    © Springer
    BibTeX
  2. Volker Diekert
    Some remarks on presentations by finite Church-Rosser Thue systems
    Proc. 4th Annual Symposium on Theoretical Aspects of Computer Science (STACS’87), Passau (Germany), volume 247 of Lecture Notes in Computer Science, pages 272–285. Springer-Verlag, 1987.
    DOI
    © Springer
    BibTeX

Technical Reports

  1. Volker Diekert
    Two contributions to the theory of finite replacement systems
    Report, Document number: TUM-I8710. Institut für Informatik der Technischen Universität München, 1987.
    BibTeX

1986

Journal Articles

  1. Volker Diekert
    Eine Bemerkung zu freien Moduln über regulären lokalen Ringen
    Journal of Algebra. 101:188–189. 1986.
    BibTeX
  2. Volker Diekert
    Investigations of Hotz groups for arbitrary grammars
    Acta Informatica. 22(6):679–698. 1986.
    DOI
    © Springer
    BibTeX
  3. Volker Diekert
    Complete semi-Thue systems for abelian groups
    Theoretical Computer Science. 44:199–208. 1986.
    DOI
    © Elsevier
    BibTeX
  4. Volker Diekert
    Commutative monoids have complete presentations by free (non-commutative) monoids
    Theoretical Computer Science. 46:319–327. 1986.
    DOI
    © Elsevier
    BibTeX

1985

Conference Articles

  1. Volker Diekert
    A complete non-preperfect presentation of a context-free monoid
    Combinatorial Algorithms in Algebraic Structures, pages 60–66. Fachbereich Informatik der Universität Kaiserslautern, 1985.
    BibTeX
  2. Volker Diekert
    On Hotz groups and homomorphic images of sentential form languages
    Proc. 2nd Annual Symposium on Theoretical Aspects of Computer Science (STACS’85), Saarbrücken (Germany), 1985, volume 182 of Lecture Notes in Computer Science, pages 87–97. Springer-Verlag, 1985.
    DOI
    © Springer
    BibTeX

1984

Journal Articles

  1. Volker Diekert
    Über die absolute Galoisgruppe dyadischer Zahlkörper
    Journal für die reine und angewandte Mathematik. 350:152–172. 1984.
    BibTeX

1983

Journal Articles

  1. Volker Diekert
    Demuškin-Erzeugende und Einbettungsprobleme elementar abelscher 2 2 -Erweiterungen zwei-adischer Zahlkörper
    Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg. 53:28–38. Springer, 1983.
    DOI
    © Springer
    BibTeX

1981

Journal Articles

  1. Volker Diekert
    Abelsche p-Erweiterungen \wp \wp -adischer Zahlkörper, über denen jedes Einbettungsproblem lösbar ist
    Journal für die reine und angewandte Mathematik. 323:101–104. 1981.
    BibTeX

News

[Jun’23] The paper “Parallel algorithms for power circuits and the word problem of the Baumslag group” by Caroline Mattes and Armin Weiß has been accepted at Computational Complexity.

[Oct’22] The paper “Lower Bounds for Sorting 16, 17, and 18 Elements” by Florian Stober and Armin Weiß has been accepted at ALENEX 2023.

[Sep’22] The paper “Conelikes and Ranker Comparisons” by Viktor Henriksson and Manfred Kufleitner has been accepted at LATIN 2022.

[Sep’22] The paper “Improved Parallel Algorithms for Generalized Baumslag Groups” by Caroline Mattes and Armin Weiß has been accepted at LATIN 2022.

[Apr’22] The paper “Reachability Games and Parity Games” by Volker Diekert and Manfred Kufleitner has been accepted at ICTAC 2022.

[Apr’22] The paper “Satisfiability Problems for Finite Groups” by Pawel M. Idziak, Piotr Kawalek, Jacek Krzaczkowski and Armin Weiß has been accepted at ICALP 2022.

[Mar’22] The paper “The Power Word Problem in Graph Products” by Florian Stober and Armin Weiß was accepted at DLT 2022.

[Nov’20] Volker Diekert is Partner Investigator in the Australian ARC grant “Geodetic groups: foundational problems in algebra and computer science” at University of Technology Sydney.

[Apr’20] The paper “Groups with ALOGTIME-hard word problems and PSPACE-complete circuit value problems” by Laurent Bartholdi, Michael Figelius, Markus Lohrey and Armin Weiß has been accepted at CCC 2020.

[Apr’20] The paper “Hardness of equations over finite solvable groups under the exponential time hypothesis” by Armin Weiß has been accepted at ICALP 2020.

[Dec’19] The paper “An Automaton Group with PSPACE-Complete Word Problem” by Jan Philipp Wächter and Armin Weiß has been accepted at STACS 2020.

[Nov’19] Carlos Camino was awarded the stuvus Special Prize for exceptional commitment in teaching.

[Jun’19] The paper “The power word problem” by Markus Lohrey and Armin Weiß has been accepted at MFCS 2019.

[May’19] The paper “On the Average Case of MergeInsertion” by Florian Stober and Armin Weiß has been accepted at IWOCA 2019.

[Oct’18] The paper “Worst-Case Efficient Sorting with QuickMergesort” by Stefan Edelkamp and Armin Weiß has been accepted at ALENEX 2019.

[Jun’18] At CCC 2018, Lukas Fleischer received a Best Student Paper Award for his submission “On the Complexity of the Cayley Semigroup Membership Problem”.

[Jun’18] The paper “Testing Simon’s congruence” by Lukas Fleischer and Manfred Kufleitner was accepted at MFCS 2018.

[Jun’18] The paper “The Intersection Problem for Finite Semigroups” by Lukas Fleischer was accepted at DLT 2018.

[Apr’18] The paper “The isomorphism problem for finite extensions of free groups is in PSPACE” by Géraud Sénizergues and Armin Weiß was accepted at ICALP 2018.

[Apr’18] The paper “On the Complexity of the Cayley Semigroup Membership Problem” by Lukas Fleischer was accepted at CCC 2018.

[Jan’18] On March 24-29, 2019 Volker Diekert, Markus Lohrey, Olga Kharlampovich and Alexei Miasnikov will organize the Schloss Dagstuhl Seminar “Algorithmic Problems in Group Theory”.

[Dec’17] The paper “The Intersection Problem for Finite Monoids” by Lukas Fleischer and Manfred Kufleitner was accepted at STACS 2018.

[Jun’17] At the 12th International Computer Science Symposium in Russia (CSR), Lukas Fleischer and Manfred Kufleitner received a Best Paper Award for their publication “Green’s Relations in Finite Transformation Semigroups”, and Armin Weiss received a Best Paper Award for “The conjugacy problem in free solvable groups and wreath product of abelian groups is in $\text{TC}^0$ \text{TC}^0 “ which is joint work with Alexei Miasnikov and Svetla Vassileva.