The ability to perform permutations of large data sets in place reduces the amount of necessary available disk storage. The simplest way to perform a permutation often is to read ...
In this paper we present a new compression scheme for signature tree structures. Beyond the reduction of storage space, compression attains significant savings in terms of query pr...
Maria Kontaki, Yannis Manolopoulos, Alexandros Nan...
We present a new algorithm for computing the solution of large Markov chain models whose generators can be represented in the form of a generalized tensor algebra, such as network...
This paper describes the simulation of a foraging agent in an environment with a simple ecological structure, alternatively using one of three different control systems with varyi...
Proving termination of sequential programs is an important problem, both for establishing the total correctness of systems and as a component of proving more general termination an...
William R. Harris, Akash Lal, Aditya V. Nori, Srir...