The classical theory of deterministic automata is presented in terms of the notions of homomorphism and bisimulation, which are the cornerstones of the theory of universal coalgebr...
A group code defined over a group G is a subset of Gn which forms a group under componentwise group operation. The well known matrix characterization of MDS (Maximum Distance Sepa...
In this article we improve the butterfly and Loop's algorithm. As a result we obtain subdivision algorithms for triangular nets which can be used to generate G1- and G2surfac...
This paper is devoted to the speci cation of the Stanford FLASHcache coherence protocol within the ASM formalism. Correctness proofs related to data consistency are presented. Corn...
Suppose we sequentially throw m balls into n bins. It is a natural question to ask for the maximum number of balls in any bin. In this paper we shall derive sharp upper and lower b...