Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Volker
    Last name: Diekert
    DBLP: d/VolkerDiekert
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 100 of 121  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Volker Diekert, Alexei G. Myasnikov, Armin Weiss.
    Conjugacy in Baumslag's Group, Generic Case Complexity, and Division in Power Circuiats.
    LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings 2014 (0) 2014
    Conference paper
    Volker Diekert, Artur Jez, Wojciech Plandowski.
    Finding All Solutions of Equations in Free Groups and Monoids with Involution.
    Computer Science - Theory and Applications - 9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014. Proceedings 2014 (0) 2014
    Journal article
    Volker Diekert, Artur Jez, Wojciech Plandowski.
    Finding All Solutions of Equations in Free Groups and Monoids with Involution.
    CoRR 2014, Volume 0 (0) 2014
    Journal article
    Volker Diekert, Martin Leucker.
    Topology, monitorable properties and runtime verification.
    Theor. Comput. Sci. 2014, Volume 537 (0) 2014
    Conference paper
    Volker Diekert, Jonathan Kausch.
    Logspace computations in graph products.
    International Symposium on Symbolic and Algebraic Computation, ISSAC '14, Kobe, Japan, July 23-25, 2014 2014 (0) 2014
    Conference paper
    Volker Diekert, Armin Weiss.
    Context-Free Groups and their Structure Trees.
    IJAC 2013, Volume 23 (0) 2013
    Conference paper
    Volker Diekert, Armin Weiss.
    QuickHeapsort: Modifications and Improved Analysis.
    Computer Science - Theory and Applications - 8th International Computer Science Symposium in Russia, CSR 2013, Ekaterinburg, Russia, June 25-29, 2013. Proceedings 2013 (0) 2013
    Journal article
    Volker Diekert, Olga Kharlampovich, Atefeh Mohajeri Moghaddam.
    SLP compression for solutions of equations with constraints in free and hyperbolic groups.
    CoRR 2013, Volume 0 (0) 2013
    Journal article
    Volker Diekert, Jonathan Kausch.
    Logspace computations in graph products.
    CoRR 2013, Volume 0 (0) 2013
    Journal article
    Volker Diekert, Alexei Miasnikov, Armin Weiss.
    Conjugacy in Baumslag's group, generic case complexity, and division in power circuits.
    CoRR 2013, Volume 0 (0) 2013
    Conference paper
    Volker Diekert, Jürn Laun, Alexander Ushakov.
    Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in P.
    29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France 2012 (0) 2012
    Conference paper
    Volker Diekert, Jonathan Kausch, Markus Lohrey.
    Logspace Computations in Graph Groups and Coxeter Groups.
    LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings 2012 (0) 2012
    Journal article
    Volker Diekert, Manfred Kufleitner, Benjamin Steinberg.
    The Krohn-Rhodes Theorem and Local Divisors.
    Fundam. Inform. 2012, Volume 116 (0) 2012
    Journal article
    Volker Diekert, Steffen Kopecki, Victor Mitrana.
    Deciding regularity of hairpin completions of regular languages in polynomial time.
    Inf. Comput. 2012, Volume 217 (0) 2012
    Conference paper
    Volker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias Walter.
    Regular Languages Are Church-Rosser Congruential.
    Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part II 2012 (0) 2012
    Conference paper
    Volker Diekert, Anca Muscholl.
    On Distributed Monitoring of Asynchronous Systems.
    Logic, Language, Information and Computation - 19th International Workshop, WoLLIC 2012, Buenos Aires, Argentina, September 3-6, 2012. Proceedings 2012 (0) 2012
    Conference paper
    Volker Diekert, Manfred Kufleitner.
    Bounded Synchronization Delay in Omega-Rational Expressions.
    Computer Science - Theory and Applications - 7th International Computer Science Symposium in Russia, CSR 2012, Nizhny Novgorod, Russia, July 3-7, 2012. Proceedings 2012 (0) 2012
    Conference paper
    Volker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias Walter.
    Regular Languages are Church-Rosser Congruential
    CoRR 2012, Volume 0 (0) 2012
    Conference paper
    Volker Diekert, Anca Muscholl.
    On distributed monitoring of asynchronous systems
    CoRR 2012, Volume 0 (0) 2012
    Journal article
    Volker Diekert, Armin Weiss.
    QuickHeapsort: Modifications and improved analysis
    CoRR 2012, Volume 0 (0) 2012
    Conference paper
    Volker Diekert, Alexei G. Myasnikov.
    Group Extensions over Infinite Words.
    Int. J. Found. Comput. Sci. 2012, Volume 23 (0) 2012
    Journal article
    Volker Diekert, Manfred Kufleitner, Pascal Weil.
    Star-free languages are Church-Rosser congruential.
    Theor. Comput. Sci. 2012, Volume 454 (0) 2012
    Journal article
    Volker Diekert, Steffen Kopecki.
    Language theoretical properties of hairpin formations.
    Theor. Comput. Sci. 2012, Volume 429 (0) 2012
    Journal article
    Volker Diekert, Andrew J. Duncan, Alexei G. Myasnikov.
    Cyclic rewriting and conjugacy problems.
    Groups Complexity Cryptology 2012, Volume 4 (0) 2012
    Conference paper
    Volker Diekert, Jürn Laun, Alexander Ushakov.
    Efficient Algorithms for Highly Compressed Data: the Word Problem in Higman's Group is in P.
    IJAC 2012, Volume 22 (0) 2012
    Journal article
    Volker Diekert, Steffen Kopecki.
    It Is NL-complete to Decide Whether a Hairpin Completion of Regular Languages Is Regular
    CoRR 2011, Volume 0 (0) 2011
    Conference paper
    Volker Diekert, Manfred Kufleitner.
    Fragments of First-Order Logic over Infinite Words.
    Theory Comput. Syst. 2011, Volume 48 (0) 2011
    Conference paper
    Volker Diekert, Dirk Nowotka.
    Preface.
    Int. J. Found. Comput. Sci. 2011, Volume 22 (0) 2011
    Journal article
    Volker Diekert, Jürn Laun.
    On Computing Geodesics in Baumslag-Solitar Groups.
    IJAC 2011, Volume 21 (0) 2011
    Book chapter
    Volker Claus, Volker Diekert, Holger Petersen.
    Marriage Broker.
    Algorithms Unplugged 2011 (0) 2011
    Conference paper
    Volker Diekert, Alexei G. Myasnikov.
    Solving Word Problems in Group Extensions over Infinite Words.
    Developments in Language Theory - 15th International Conference, DLT 2011, Milan, Italy, July 19-22, 2011. Proceedings 2011 (0) 2011
    Journal article
    Volker Diekert, Steffen Kopecki, Victor Mitrana.
    Deciding Regularity of Hairpin Completions of Regular Languages in Polynomial Time
    CoRR 2011, Volume 0 (0) 2011
    Conference paper
    Volker Diekert, Manfred Kufleitner, Benjamin Steinberg.
    The Krohn-Rhodes Theorem and Local Divisors
    CoRR 2011, Volume 0 (0) 2011
    Conference paper
    Volker Diekert, Manfred Kufleitner, Pascal Weil.
    Star-Free Languages are Church-Rosser Congruential
    CoRR 2011, Volume 0 (0) 2011
    Book chapter
    Volker Diekert, Anca Muscholl.
    Trace Theory.
    Encyclopedia of Parallel Computing 2011 (0) 2011
    Conference paper
    Volker Diekert, Steffen Kopecki.
    It is NL-Complete to Decide Whether a Hairpin Completion of Regular Languages is Regular.
    Int. J. Found. Comput. Sci. 2011, Volume 22 (0) 2011
    Journal article
    Volker Diekert, Alexei Myasnikov.
    Group extensions over infinite words
    CoRR 2010, Volume 0 (0) 2010
    Conference paper
    Volker Diekert, 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, Winnipeg, MB, Canada, August 12-15, 2010. Revised Selected Papers 2011 (0) 2010
    Journal article
    Sergei N. Artëmov, Volker Diekert, Dima Grigoriev.
    Preface.
    Theory Comput. Syst. 2010, Volume 46 (0) 2010
    Conference paper
    Sergei N. Artëmov, Volker Diekert, Alexander A. Razborov.
    Preface.
    Theory Comput. Syst. 2010, Volume 46 (0) 2010
    Conference paper
    Volker Diekert, Steffen Kopecki, Victor Mitrana.
    On the Hairpin Completion of Regular Languages.
    Theoretical Aspects of Computing - ICTAC 2009, 6th International Colloquium, Kuala Lumpur, Malaysia, August 16-20, 2009. Proceedings 2009 (0) 2009
    Conference paper
    Volker Diekert, Manfred Kufleitner.
    Fragments of first-order logic over infinite words
    CoRR 2009, Volume 0 (0) 2009
    Conference paper
    Volker Diekert, Dalia Krieger.
    Some remarks about stabilizers.
    Theor. Comput. Sci. 2009, Volume 410 (0) 2009
    Conference paper
    Volker Diekert, Manfred Kufleitner.
    Fragments of First-Order Logic over Infinite Words.
    26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings 2009 (0) 2009
    Conference paper
    Volker Diekert, Paul Gastin.
    First-order definable languages.
    Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]. 2008 (0) 2008
    Conference paper
    Volker Diekert, Markus Lohrey.
    Word Equations over Graph Products.
    IJAC 2008, Volume 18 (0) 2008
    Conference paper
    Volker Diekert, Nicole Ondrusch, Markus Lohrey.
    Algorithmic Problems on Inverse Monoids over Virtually Free Groups.
    IJAC 2008, Volume 18 (0) 2008
    Conference paper
    Volker Diekert, Paul Gastin, Manfred Kufleitner.
    A Survey on Small Fragments of First-Order Logic over Finite Words.
    Int. J. Found. Comput. Sci. 2008, Volume 19 (0) 2008
    Conference paper
    Sergei N. Artëmov, Volker Diekert, Dima Grigoriev.
    Foreword.
    Theory Comput. Syst. 2008, Volume 43 (0) 2008
    Book chapter
    Volker Claus, Volker Diekert, Holger Petersen.
    Partnerschaftsvermittlung.
    Taschenbuch der Algorithmen 2008 (0) 2008
    Conference paper
    Volker Diekert.
    Equations: From Words to Graph Products.
    LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications. 2007 (0) 2007
    Conference paper
    Volker Diekert, Manfred Kufleitner.
    On First-Order Fragments for Words and Mazurkiewicz Traces.
    Developments in Language Theory, 11th International Conference, DLT 2007, Turku, Finland, July 3-6, 2007, Proceedings 2007 (0) 2007
    Conference paper
    Volker Diekert, Martin Horsch, Manfred Kufleitner.
    On First-Order Fragments for Mazurkiewicz Traces.
    Fundam. Inform. 2007, Volume 80 (0) 2007
    Conference paper
    Volker Diekert, Bruno Durand.
    Foreword.
    Theory Comput. Syst. 2007, Volume 40 (0) 2007
    Conference paper
    Volker Diekert, Markus Lohrey, Alexander Miller.
    Partially Commutative Inverse Monoids.
    Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings 2006 (0) 2006
    Conference paper
    Volker Diekert, Paul Gastin.
    Pure future local temporal logics are expressively complete for Mazurkiewicz traces.
    Inf. Comput. 2006, Volume 204 (0) 2006
    Conference paper
    Volker Diekert, Anca Muscholl.
    Solvability of Equations in Graph Groups Is Decidable.
    IJAC 2006, Volume 16 (0) 2006
    Conference paper
    Volker Diekert, Michel Habib.
    Foreword.
    Theory Comput. Syst. 2006, Volume 39 (0) 2006
    Conference paper
    Volker Diekert, Paul Gastin.
    From local to global temporal logics over Mazurkiewicz traces.
    Theor. Comput. Sci. 2006, Volume 356 (0) 2006
    Conference paper
    Volker Diekert, Claudio Gutierrez, Christian Hagenah.
    The existential theory of equations with rational constraints in free groups is PSPACE-complete.
    Inf. Comput. 2005, Volume 202 (0) 2005
    Conference paper
    Holger Austinat, Volker Diekert, Ulrich Hertrampf, Holger Petersen.
    Regular frequency computations.
    Theor. Comput. Sci. 2005, Volume 330 (0) 2005
    Conference paper
    Volker Diekert, Paul Gastin.
    Pure Future Local Temporal Logics Are Expressively Complete for Mazurkiewicz Traces.
    LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004, Proceedings 2004 (0) 2004
    Conference paper
    Volker Diekert, Paul Gastin.
    Local temporal logic is expressively complete for cograph dependence alphabets.
    Inf. Comput. 2004, Volume 195 (0) 2004
    Conference paper
    Volker Diekert, Markus Lohrey.
    Existential and Positive Theories of Equations in Graph Products.
    Theory Comput. Syst. 2004, Volume 37 (0) 2004
    Conference paper
    Volker Diekert, Markus Lohrey.
    Word Equations over Graph Products.
    FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 23rd Conference, Mumbai, India, December 15-17, 2003, Proceedings 2003 (0) 2003
    Conference paper
    Holger Austinat, Volker Diekert, Ulrich Hertrampf.
    A structural property of regular frequency computations.
    Theor. Comput. Sci. 2003, Volume 292 (0) 2003
    Conference paper
    Volker Diekert, 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 [on occasion of his 60th birthday, March 14, 2002] 2002 (0) 2002
    Conference paper
    Volker Diekert, Manfred Kufleitner.
    A Remark about Quadratic Trace Equations.
    Developments in Language Theory, 6th International Conference, DLT 2002, Kyoto, Japan, September 18-21, 2002, Revised Papers 2003 (0) 2002
    Conference paper
    Volker Diekert, Markus Lohrey.
    Existential and Positive Theories of Equations in Graph Products.
    STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings 2002 (0) 2002
    Conference paper
    Volker Diekert, Markus Lohrey.
    A Note on The Existential Theory of Equations in Plain Groups.
    IJAC 2002, Volume 12 (0) 2002
    Conference paper
    Volker Diekert, Paul Gastin.
    LTL Is Expressively Complete for Mazurkiewicz Traces.
    J. Comput. Syst. Sci. 2002, Volume 64 (0) 2002
    Conference paper
    Volker Diekert, Anca Muscholl.
    Solvability of Equations in Free Partially Commutative Groups Is Decidable.
    Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings 2001 (0) 2001
    Conference paper
    Volker Diekert, Paul Gastin.
    Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets.
    Logic for Programming, Artificial Intelligence, and Reasoning, 8th International Conference, LPAR 2001, Havana, Cuba, December 3-7, 2001, Proceedings 2001 (0) 2001
    Conference paper
    Volker Diekert, Claudio Gutierrez, Christian Hagenah.
    The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-Complete.
    STACS 2001, 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001, Proceedings 2001 (0) 2001
    Conference paper
    Volker Diekert, Claudio Gutierrez, Christian Hagenah.
    The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-Complete
    CoRR 2001, Volume 0 (0) 2001
    Conference paper
    Volker Diekert, Paul Gastin.
    LTL Is Expressively Complete for Mazurkiewicz Traces.
    Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings 2000 (0) 2000
    Conference paper
    Volker Diekert, John Michael Robson.
    Quadratic Word Equations.
    Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa 1999 (0) 1999
    Conference paper
    Volker Diekert, Paul Gastin.
    An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces.
    Computer Science Logic, 13th International Workshop, CSL '99, 8th Annual Conference of the EACSL, Madrid, Spain, September 20-25, 1999, Proceedings 1999 (0) 1999
    Conference paper
    John Michael Robson, Volker Diekert.
    On Quadratic Word Equations.
    STACS 99, 16th Annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, March 4-6, 1999, Proceedings 1999 (0) 1999
    Conference paper
    Volker Diekert, Yuri Matiyasevich, Anca Muscholl.
    Solving Word Equations modulo Partial Commutations.
    Theor. Comput. Sci. 1999, Volume 224 (0) 1999
    Conference paper
    Volker Diekert, Paul Gastin.
    Approximating Traces.
    Acta Inf. 1998, Volume 35 (0) 1998
    Conference paper
    Béatrice Bérard, Antoine Petit, Volker Diekert, Paul Gastin.
    Characterization of the Expressive Power of Silent Transitions in Timed Automata.
    Fundam. Inform. 1998, Volume 36 (0) 1998
    Conference paper
    Volker Diekert.
    A Remark on Trace Equations.
    Foundations of Computer Science: Potential - Theory - Cognition, to Wilfried Brauer on the occasion of his sixtieth birthday 1997 (0) 1997
    Conference paper
    Volker Diekert, Yuri Matiyasevich, Anca Muscholl.
    Solving Trace Equations Using Lexicographical Normal Forms.
    Automata, Languages and Programming, 24th International Colloquium, ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings 1997 (0) 1997
    Conference paper
    Volker Diekert, Paul Gastin, Antoine Petit.
    Removing epsilon-Transitions in Timed Automata.
    STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27 - March 1, 1997, Proceedings 1997 (0) 1997
    Conference paper
    Volker Diekert, Anca Muscholl.
    Code Problems on Traces.
    Mathematical Foundations of Computer Science 1996, 21st International Symposium, MFCS'96, Cracow, Poland, September 2-6, 1996, Proceedings 1996 (0) 1996
    Conference paper
    Michael Bertol, Volker Diekert.
    Trace Rewriting: Computing Normal Forms in Time O(n log n).
    STACS 96, 13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, February 22-24, 1996, Proceedings 1996 (0) 1996
    Conference paper
    Volker Diekert, Anca Muscholl.
    A Note on Métivier's Construction of Asynchronous Automata for Triangulated Graphs.
    Fundam. Inform. 1996, Volume 25 (0) 1996
    Conference paper
    Volker Diekert, Paul Gastin, Antoine Petit.
    Recent Developments in Trace Theory.
    Developments in Language Theory 1995 (0) 1995
    Conference paper
    Volker Diekert, Paul Gastin.
    A Domain for Concurrent Termination: A Generalization of Mazurkiewicz Traces (Extended Abstract).
    Automata, Languages and Programming, 22nd International Colloquium, ICALP95, Szeged, Hungary, July 10-14, 1995, Proceedings 1995 (0) 1995
    Conference paper
    Volker Diekert, Anca Muscholl, Klaus Reinhardt.
    On Codings of Traces.
    STACS 1995 (0) 1995
    Conference paper
    Volker Diekert, Paul Gastin, Antoine Petit.
    Rational and Recognizable Complex Trace Languages
    Inf. Comput. 1995, Volume 116 (0) 1995
    Conference paper
    Celia Wrathall, Volker Diekert.
    On Confluence of One-Rule Trace-Rewriting Systems.
    Mathematical Systems Theory 1995, Volume 28 (0) 1995
    Conference paper
    Volker Diekert, Anca Muscholl.
    Deterministic Asynchronous Automata for Infinite Traces.
    Acta Inf. 1994, Volume 31 (0) 1994
    Conference paper
    Volker Diekert, Edward Ochmanski, Klaus Reinhardt.
    On Confluent Semi-commutations: Decidability and Complexity Results
    Inf. Comput. 1994, Volume 110 (0) 1994
    Conference paper
    Volker Diekert.
    A Partial Trace Semantics for Petri Nets.
    Theor. Comput. Sci. 1994, Volume 134 (0) 1994
    Conference paper
    Michael Bertol, Volker Diekert.
    On Efficient Reduction Algorithms for Some Trace Rewriting Systems.
    Term Rewriting, French Spring School of Theoretical Computer Science, Font Romeux, France, May 17-21, 1993, Advanced Course 1995 (0) 1993
    Conference paper
    Volker Diekert.
    Rewriting, Möbius Functions and Semi-Commutations.
    Fundamentals of Computation Theory, 9th International Symposium, FCT '93, Szeged, Hungary, August 23-27, 1993, Proceedings 1993 (0) 1993
    Conference paper
    Volker Diekert.
    Complex and Complex-Like Traces.
    Mathematical Foundations of Computer Science 1993, 18th International Symposium, MFCS'93, Gdansk, Poland, August 30 - September 3, 1993, Proceedings 1993 (0) 1993
    Conference paper
    Volker Diekert, Anca Muscholl.
    Deterministic Asynchronous Automata for Infinite Traces.
    STACS 93, 10th Annual Symposium on Theoretical Aspects of Computer Science, Würzburg, Germany, February 25-27, 1993, Proceedings 1993 (0) 1993
    Show item 1 to 100 of 121  

    Your query returned 121 matches in the database.