2137 search results - page 88 / 428 » Proving Abstract Non-interference |
APAL
2005
14 years 10 months ago
2005
Abstract. We prove that a finitely generated group is context-free whenever its Cayleygraph has a decidable monadic second-order theory. Hence, by the seminal work of Muller and Sc...
83
Voted
TOCL
2008
14 years 10 months ago
2008
fragment enjoys suitable noetherianity conditions and admits an abstract version of a `KeislerShelah like' isomorphism theorem. We show that this general decidability transfer...
4OR
2004
14 years 10 months ago
2004
Abstract. Based on the recent approach of Bertsimas and Sim (2004, 2003) to robust optimization in the presence of data uncertainty, we prove an easily computable and simple bound ...
59
Voted
COMBINATORICS
1999
14 years 9 months ago
1999
Abstract. Consider, for a permutation Sk, the number F(n, ) of permutations in Sn which avoid as a subpattern. The conjecture of Stanley and Wilf is that for every there is a c...
TIT
2002
14 years 9 months ago
2002
Abstract--In this paper, we establish a one-to-one correspondence between information inequalities and group inequalities. The major implication of our result is that we can prove ...