10608 search results - page 2048 / 2122 » Complexity of O'Hara's Algorithm |
EUROCRYPT
2004
Springer
14 years 2 months ago
2004
Springer
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...
GI
2004
Springer
14 years 2 months ago
2004
Springer
: Next to authentication, secure key exchange is considered the most critical and complex issue regarding ad-hoc network security. We present a low-cost, (i.e. low hardware-complex...
IWQOS
2004
Springer
14 years 2 months ago
2004
Springer
In this paper, we consider how to “construct” and “maintain” an overlay structured P2P network based on the “smallworld paradigm”. Two main attractive properties of a ...
JELIA
2004
Springer
14 years 2 months ago
2004
Springer
We briefly overview the most recent improvements we have incorporated to the existent implementations of the TAS methodology, the simplified ∆-tree representation of formulas i...
MFCS
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. We introduce a natural class of cellular automata characterised by a property of the local transition law without any assumption on the states set. We investigate some al...