Sciweavers

3557 search results - page 200 / 712
» Authoring Presentation for OpenMath
Sort
View
IJNSEC
2007
83views more  IJNSEC 2007»
15 years 6 months ago
Secure Logging for Irrefutable Administration
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...
APPML
2005
67views more  APPML 2005»
15 years 6 months ago
Semiharmonic bicyclic graphs
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 ...
Stefan Grünewald, Dragan Stevanovic
TCS
2008
15 years 6 months ago
On varieties of meet automata
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...
Ondrej Klíma, Libor Polák
JAR
2007
85views more  JAR 2007»
15 years 6 months ago
User Interaction with the Matita Proof Assistant
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...
JCT
2007
112views more  JCT 2007»
15 years 6 months ago
On generalized Kneser hypergraph colorings
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...
Carsten E. M. C. Lange, Günter M. Ziegler