In this paper we investigate computational properties of the Diophantine...
In 1962 Ore initiated the study of geodetic graphs. A graph is called
ge...
It is a long-standing open question to determine the minimum number of
c...
The power word problem of a group G asks whether an expression p_1^x_1… ...
Testing isomorphism of infinite groups is a classical topic, but from th...
Power circuits have been introduced in 2012 by Myasnikov, Ushakov and Wo...
The study of the complexity of the equation satisfiability problem in fi...
Goldmann and Russell (2002) initiated the study of the complexity of the...
We give lower bounds on the complexity of the word problem of certain
no...
MergeInsertion, also known as the Ford-Johnson algorithm, is a sorting
a...
In this work we introduce a new succinct variant of the word problem in ...
QuickXsort is a highly efficient in-place sequential sorting scheme that...
The two most prominent solutions for the sorting problem are Quicksort a...
We consider the fundamental problem of internally sorting a sequence of ...
We present an algorithm for the following problem: given a context-free
...