Sciweavers

12459 search results - page 50 / 2492
» cans 2006
Sort
View
COMBINATORICS
1999
70views more  COMBINATORICS 1999»
13 years 7 months ago
Tilings of Diamonds and Hexagons with Defects
We show how to count tilings of Aztec diamonds and hexagons with defects using determinants. In several cases these determinants can be evaluated in closed form. In particular, we...
Harald Helfgott, Ira M. Gessel
JCS
2002
94views more  JCS 2002»
13 years 7 months ago
Model-Based Analysis of Configuration Vulnerabilities
Vulnerability analysis is concerned with the problem of identifying weaknesses in computer systems that can be exploited to compromise their security. In this paper we describe a ...
C. R. Ramakrishnan, R. C. Sekar
JSYML
2002
66views more  JSYML 2002»
13 years 7 months ago
Proving Consistency of Equational Theories in Bounded Arithmetic
We consider equational theories for functions defined via recursion involving equations between closed terms with natural rules based on recursive definitions of the function symb...
Arnold Beckmann
JSYML
2002
114views more  JSYML 2002»
13 years 7 months ago
Interpolation for First Order S5
An interpolation theorem holds for many standard modal logics, but first order S5 is a prominent example of a logic for which it fails. In this paper it is shown that a first orde...
Melvin Fitting
JUCS
2002
108views more  JUCS 2002»
13 years 7 months ago
Heyting Algebras and Formal Languages
: By introducing a new operation, the exponentiation of formal languages, we can define Heyting algebras of formal languages. It turns out that some well known families of language...
Werner Kuich, Norbert Sauer, Friedrich J. Urbanek