1818 search results - page 241 / 364 » Granularity-Adaptive Proof Presentation |
137
click to vote
TPHOL
2007
IEEE
15 years 10 months ago
2007
IEEE
We propose a method to extract purely functional contents from logical inductive types in the context of the Calculus of Inductive Constructions. This method is based on a mode con...
114
click to vote
AAECC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Here we study a weakness of the RC4 Key Scheduling Algorithm (KSA) that has already been noted by Mantin and Mironov. Consider the RC4 permutation S of N (usually 256) by...
215
Voted
ILC
2007
Springer
15 years 10 months ago
2007
Springer
Two-way alternating automata were introduced by Vardi in order to study the satisfiability problem for the modal µ-calculus extended with backwards modalities. In this paper, we ...
108
click to vote
ISAAC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
139
click to vote
ICNS
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper introduces a fault-tolerant group communication protocol that is aimed at grid and wide area environments. The protocol has two layers. The lower layer provides a total...