In this paper, we present a variant of the dependency pair method for analysing runtime complexities of term rewrite systems automatically. This method is easy to implement, but si...
The key of overlapping structures or concurrent markup hierarchies in XML encodings of documents is that markup in one hierarchy is not necessarily well-formed with respect to the...
We present uniform approaches to establish complexity bounds for decision problems such as reachability and simulation, that arise naturally in the verification of timed software s...
Rohit Chadha, Axel Legay, Pavithra Prabhakar, Mahe...
Abstract. The swarm metaphor stands for dynamic, complex interaction networks with the possibility of emergent phenomena. In this work, we present two games that challenge the vide...
Abstract. In the paper we show that there is a close relationship between the energy complexity and the depth of threshold circuits computing any Boolean function although they hav...