We propose an algorithm that tests membership for regular expressions and show that the algorithm is correct. This algorithm is written in the style of a sequent proof system. The...
We give the precise correspondence between polarized linear logic and polarized classical logic. The properties of focalization and reversion of linear proofs are at the heart of ...
Olivier Laurent, Myriam Quatrini, Lorenzo Tortora ...
Due to rapid information growth, peer-to-peer (P2P) systems have become a promising alternative to centralized, client/server-based approaches for large-scale data sharing. By all...
We establish central and local limit theorems for the number of vertices in the largest component of a random d-uniform hypergraph Hd(n, p) with edge probability p = c/ n−1 d−1...
Applications based on outsourcing computation require guarantees to the data owner that the desired computation has been performed correctly by the service provider. Methods based...