11345 search results - page 1779 / 2269 » Foundations of Computer Science |
124
click to vote
FCT
2009
Springer
15 years 11 months ago
2009
Springer
The n-ary first and second recursion theorems formalize two distinct, yet similar, notions of self-reference. Roughly, the n-ary first recursion theorem says that, for any n algo...
121
click to vote
FSTTCS
2009
Springer
15 years 11 months ago
2009
Springer
We present a symbolic framework for refinement and composition of security protocols. ework uses the notion of ideal functionalities. These are abstract systems which are secure b...
157
click to vote
FSTTCS
2009
Springer
15 years 11 months ago
2009
Springer
ABSTRACT. A non-local box is an abstract device into which Alice and Bob input bits x and y respectively and receive outputs a and b respectively, where a, b are uniformly distribu...
136
click to vote
ICCS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. The high level of abstraction necessary to teach data structures and algorithmic schemes has been more than a hindrance to students. In order to make a proper approach to...
141
Voted
SAT
2009
Springer
15 years 11 months ago
2009
Springer
Induced (chord-free) cycles in binary hypercubes have many applications in computer science. The state of the art for computing such cycles relies on genetic algorithms, which are,...