There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version,...
We present a formalization of a version of Abadi and Plotkin's logic for parametricity for a polymorphic dual intuitionistic / linear type theory with fixed points, and show,...
We study the existence of automatic presentations for various algebraic structures. An automatic presentation of a structure is a description of the universe of the structure by a...
Factorizations of the cyclic permutation (1 2 . . . N) into two permutations with respectively n and m cycles, or, equivalently, unicellular bicolored maps with N edges and n whit...
- Contiguity Analysis is a straightforward generalization of Linear Discriminant Analysis in which the partition of elements is replaced by a more general graph structure. Applied ...