Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
Abstract. Trees can be conveniently compressed with linear straight-line contextfree tree grammars. Such grammars generalize straight-line context-free string grammars which are wi...
Markus Lohrey, Sebastian Maneth, Manfred Schmidt-S...
—In this work we study the portfolio problem which is to find a good combination of multiple heuristics to solve given instances on parallel resources in minimum time. The resou...
—We introduce extensions of first-order logic (FO) and fixed-point logic (FP) with operators that compute the rank of a definable matrix. These operators are generalizations o...
Anuj Dawar, Martin Grohe, Bjarki Holm, Bastian Lau...
Abstract. The GeometricXL algorithm is a geometrically invariant version of the XL algorithm that uses polynomials of a much smaller degree than either a standard Groebner basis al...