We obtain the strongest separation between quantum and classical query complexity known to date--specifically, we define a black-box problem that requires exponentially many querie...
We provide the first classification of different types of Random Boolean Networks (RBNs). We study the differences of RBNs depending on the degree of synchronicity and determinism...
This paper reports findings from a study of how a guidebook was used by pairs of visitors touring a historic house. We describe how the guidebook was incorporated into their visit...
Rebecca E. Grinter, Paul M. Aoki, Margaret H. Szym...
In this paper we show that it is possible to model observable behaviour of coalgebras independently from their internal dynamics, but within the general framework of representing ...
The possibility of two or more actions to be performed consecutively at the same point in time is not excluded in the process algebras from the framework of process algebras with t...