In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
Hierarchical radiosity is a very demanding process in terms of computation time and memory ressources even for scenes of moderate complexity. To handle complex environments, not f...
Abstract. In this paper we study the problem of determining threedimensional orientations for noisy projections of randomly oriented identical particles. The problem is of central ...
We resolve the computational complexity of determining the treelength of a graph, thereby solving an open problem of Dourisboure and Gavoille, who introduced this parameter, and a...
Dominance links were introduced in grammars to model long distance scrambling phenomena, motivating the definition of multiset-valued linear indexed grammars (MLIGs) by Rambow (19...