Although there are many efficient algorithms for calculating the simulation preorder on finite Kripke structures, only two have been proposed of which the space complexity is of t...
In this paper we study the following problem: how to divide a cake among the children attending a birthday party such that all the children get the same amount of cake and the same...
Jin Akiyama, Atsushi Kaneko, Mikio Kano, Gisaku Na...
We consider the problem of constructing binary space partitions for the set P of d-dimensional objects in d-dimensional space. There are several classes of objects defined for su...
We are interested in verifying dynamic properties of finite state reactive systems under fairness assumptions by model checking. The systems we want to verify are specified throug...
Samir Chouali, Jacques Julliand, Pierre-Alain Mass...
Let λ be a partition, and denote by fλ the number of standard tableaux of shape λ. The asymptotic shape of λ maximizing fλ was determined in the classical work of Logan and S...