This paper presents a method that allows for securely saving a temporal sequence of data (log lines) in a file. Log lines are signed by an authority, and are thus unalterable wit...
Paolo Dal Checco, Francesco Bergadano, Davide Cava...
Let the trunk of a graph G be the graph obtained by removing all leaves of G. We prove that, for every integer c 2, there are at most finitely many trunks of semiharmonic graphs ...
Eilenberg's variety theorem gives a bijective correspondence between varieties of languages and varieties of finite monoids. The second author gave a similar relation between...
Matita is a new, document-centric, tactic-based interactive theorem prover. This paper focuses on some of the distinctive features of the user interaction with Matita, characterize...
Andrea Asperti, Claudio Sacerdoti Coen, Enrico Tas...
In Ziegler (2002), the second author presented a lower bound for the chromatic numbers of hypergraphs KGr sssS, “generalized r-uniform Kneser hypergraphs with intersection multi...