2137 search results - page 105 / 428 » Proving Abstract Non-interference |
135
Voted
ESORICS
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Researchers have proposed formal definitions of quantitative information flow based on information theoretic notions such as the Shannon entropy, the min entropy, the gue...
124
Voted
ACTA
2010
15 years 2 months ago
2010
We study the observational theory of Thielecke's CPS-calculus, a distillation of the target language of Continuation-Passing Style transforms. We define a labelled transition...
114
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Abstract--In this paper, we propose a linear complexity encoding method for arbitrary LDPC codes. We start from a simple graph-based encoding method "label-and-decide." W...
104
Voted
EJC
2010
15 years 2 months ago
2010
Abstract. We prove that the combinatorial distance between any two reduced expressions of a given permutation of {1, ..., n} in terms of transpositions lies in O(n4), a sharp bound...
92
Voted
CORR
2007
Springer
15 years 2 months ago
2007
Springer
Abstract. Holzer and Holzer [7] proved that the TantrixTM rotation puzzle problem with four colors is NP-complete, and they showed that the infinite variant of this problem is und...