1410 search results - page 183 / 282 » Proving theorems by reuse |
163
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
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...
138
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
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...
136
click to vote
DAM
2010
15 years 6 months ago
2010
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...
153
click to vote
DCC
2008
IEEE
15 years 6 months ago
2008
IEEE
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]. ...
209
click to vote
ALGORITHMICA
2006
15 years 6 months ago
2006
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...