Sciweavers

1410 search results - page 183 / 282
» Proving theorems by reuse
Sort
View
CORR
2008
Springer
105views Education» more  CORR 2008»
13 years 10 months ago
A compact topology for sand automata
In this paper, we exhibit a strong relation between the sand automata configuration space and the cellular automata configuration space. This relation induces a compact topology f...
Alberto Dennunzio, Pierre Guillon, Benoît Ma...
CORR
2010
Springer
126views Education» more  CORR 2010»
13 years 10 months ago
Automatic Verification of Parametric Specifications with Complex Topologies
The focus of this paper is on reducing the complexity in verification by exploiting modularity at various levels: in specification, in verification, and structurally. For specifica...
Johannes Faber, Carsten Ihlemann, Swen Jacobs, Vio...
DAM
2010
92views more  DAM 2010»
13 years 10 months ago
Enumeration of matchings in families of self-similar graphs
The number of matchings of a graph G is an important graph parameter in various contexts, notably in statistical physics (dimer-monomer model). Following recent research on graph p...
Elmar Teufl, Stephan Wagner
DCC
2008
IEEE
13 years 10 months ago
A characterization of quadrics by intersection numbers
This work is inspired by a paper of Hertel and Pott on maximum non-linear functions [8]. Geometrically, these functions correspond with quasi-quadrics; objects introduced in [5]. ...
Jeroen Schillewaert
ALGORITHMICA
2006
84views more  ALGORITHMICA 2006»
13 years 10 months ago
Large Deviations for the Weighted Height of an Extended Class of Trees
We use large deviations to prove a general theorem on the asymptotic edge-weighted height Hn of a large class of random trees for which Hn c log n for some positive constant c. A...
Nicolas Broutin, Luc Devroye