12 citations · 64 across the 32 of their papers we have counts for
6 papers · 1 filter
QuickHeapsort: Modifications and improved analysis
Volker Diekert, Armin Weiss
We present a new analysis for QuickHeapsort splitting it into the analysis of the partition-phases and the analysis of the heap-phases. This enables us to consider samples of non-c…
On distributed monitoring of asynchronous systems
Volker Diekert, Anca Muscholl
Distributed systems are notoriously difficult to understand and analyze in order to assert their correction w.r.t. given properties. They often exhibit a huge number of different b…
Cyclic rewriting and conjugacy problems
Volker Diekert, Andrew Duncan, Alexei Myasnikov
Cyclic words are equivalence classes of cyclic permutations of ordinary words. When a group is given by a rewriting relation, a rewriting system on cyclic words is induced, which i…
Regular Languages are Church-Rosser Congruential
Volker Diekert, Manfred Kufleitner, Klaus Reinhardt +1
This paper proves a long standing conjecture in formal language theory. It shows that all regular languages are Church-Rosser congruential. The class of Church-Rosser congruential…
Context-Free Groups and Their Structure Trees
Volker Diekert, Armin Weiß
Let Gamma be a connected, locally finite graph of finite tree width and G be a group acting on it with finitely many orbits and finite node stabilizers. We provide an elementary an…
Logspace Computations in Coxeter Groups and Graph Groups
Volker Diekert, Jonathan Kausch, Markus Lohrey
Computing normal forms in groups (or monoids) is in general harder than solving the word problem (equality testing). However, normal form computation has a much wider range of appl…