Sciweavers

Share
IANDC
2007
151views more  IANDC 2007»
9 years 11 months ago
Transducer-based analysis of cryptographic protocols
Cryptographic protocols can be divided into (1) protocols where the protocol steps are simple from a computational point of view and can thus be modeled by simple means, for insta...
Ralf Küsters, Thomas Wilke
IANDC
2007
152views more  IANDC 2007»
9 years 11 months ago
The reactive simulatability (RSIM) framework for asynchronous systems
We define reactive simulatability for general asynchronous systems. Roughly, simulatability means that a real system implements an ideal system (specification) in a way that pre...
Michael Backes, Birgit Pfitzmann, Michael Waidner
IANDC
2007
81views more  IANDC 2007»
9 years 11 months ago
Some natural conditions on incremental learning
The present study aims at insights into the nature of incremental learning in the context of Gold’s model of identification in the limit. With a focus on natural requirements s...
Sanjay Jain, Steffen Lange, Sandra Zilles
IANDC
2007
83views more  IANDC 2007»
9 years 11 months ago
Cluster computing and the power of edge recognition
Lane A. Hemaspaandra, Christopher M. Homan, Sven K...
IANDC
2007
76views more  IANDC 2007»
9 years 11 months ago
Controlling information release in the pi-calculus
Silvia Crafa, Sabina Rossi
IANDC
2007
94views more  IANDC 2007»
9 years 11 months ago
Mediating secure information flow policies
In this paper we study secure information flow policies in the sense of Meadows [12] and others for aggregated datasets, collectively. We first present a method for combining di...
Guo-Qiang Zhang
IANDC
2007
66views more  IANDC 2007»
9 years 11 months ago
Exponential lower bounds for the number of words of uniform length avoiding a pattern
We study words on a finite alphabet avoiding a finite collection of patterns. Given a pattern p in which every letter that occurs in p occurs at least twice, we show that the nu...
Jason P. Bell, Teow Lim Goh
IANDC
2007
107views more  IANDC 2007»
9 years 11 months ago
Task automata: Schedulability, decidability and undecidability
We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes th...
Elena Fersman, Pavel Krcál, Paul Pettersson...
IANDC
2007
117views more  IANDC 2007»
9 years 11 months ago
Computing the edit distance of a regular language
The edit distance (or Levenshtein distance) between two words is the smallest number of substitutions, insertions, and deletions of symbols that can be used to transform one of the...
Stavros Konstantinidis
IANDC
2007
123views more  IANDC 2007»
9 years 11 months ago
Hardness of fully dense problems
In the past decade, there has been a stream of work in designing approximation schemes for dense instances of NP-Hard problems. These include the work of Arora, Karger and Karpins...
Nir Ailon, Noga Alon
books