Sciweavers

IANDC
2008
84views more  IANDC 2008»
13 years 10 months ago
Authenticating ad hoc networks by comparison of short digests
We show how to design secure authentication protocols for a non-standard class of scenarios. In these authentication is not bootstrapped from a PKI, shared secrets or trusted thir...
L. H. Nguyen, A. W. Roscoe
IANDC
2008
139views more  IANDC 2008»
13 years 11 months ago
Computational complexity of dynamical systems: The case of cellular automata
Abstract. Cellular Automata can be considered discrete dynamical systems and at the same time a model of parallel computation. In this paper we investigate the connections between ...
Pietro di Lena, Luciano Margara
IANDC
2008
62views more  IANDC 2008»
13 years 11 months ago
Muller message-passing automata and logics
Benedikt Bollig, Dietrich Kuske
IANDC
2008
122views more  IANDC 2008»
13 years 11 months ago
Automata can show PSpace results for description logics
In the area of Description Logic (DL), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problem...
Franz Baader, Jan Hladik, Rafael Peñaloza
IANDC
2008
83views more  IANDC 2008»
13 years 11 months ago
Bases for parametrized iterativity
Jirí Adámek, Stefan Milius, Jiri Vel...
IANDC
2008
92views more  IANDC 2008»
13 years 11 months ago
Tree exploration with advice
We study the amount of knowledge about the network that is required in order to efficiently solve a task concerning this network. The impact of available information on the effici...
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
IANDC
2008
213views more  IANDC 2008»
13 years 11 months ago
Decision problem for shuffled genes
We consider a permutation-based model for the gene assembly process in ciliates. We give a procedure to decide whether a given micronuclear molecules may be assembled by using onl...
Ion Petre, Vladimir Rogojin
IANDC
2008
112views more  IANDC 2008»
13 years 11 months ago
Inclusion dynamics hybrid automata
Hybrid systems are dynamical systems with the ability to describe mixed discretecontinuous evolution of a wide range of systems. Consequently, at first glance, hybrid systems appe...
Alberto Casagrande, Carla Piazza, Alberto Policrit...
IANDC
2008
76views more  IANDC 2008»
13 years 11 months ago
The number of convex permutominoes
Permutominoes are polyominoes defined by suitable pairs of permutations. In this paper we provide a formula to count the number of convex permutominoes of given perimeter. To this ...
Paolo Boldi, Violetta Lonati, Roberto Radicioni, M...