IANDC
2008
13 years 11 months ago
2008
IANDC
2008
13 years 11 months ago
2008
We investigate code trees and search trees with cost functions that increase exponentially with the depth in the tree. While corresponding coding theorems have been considered in ...
IANDC
2008
13 years 11 months ago
2008
Abstract. Boolean grammars are an extension of context-free grammars, in which all propositional connectives are allowed. In this paper, the notion of ambiguity in Boolean grammars...
IANDC
2008
13 years 11 months ago
2008
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
IANDC
2008
13 years 11 months ago
2008
We consider a natural resource allocation problem in which we are given a set of items, where each item has a list of pairs associated with it. Each pair is a configuration of an a...
IANDC
2008
13 years 11 months ago
2008
Recently, attention has been given to formally characterize security policies that are enforceable by different kinds of security mechanisms. A very important research problem is ...
IANDC
2008
13 years 11 months ago
2008
IANDC
2008
13 years 11 months ago
2008
Automatic security protocol analysis is currently feasible only for small protocols. Since larger protocols quite often are composed of many small protocols, compositional analysi...
IANDC
2008
13 years 11 months ago
2008
A multi-party contract signing protocol allows a set of participants to exchange messages with each other with a view to arriving in a state in which each of them has a pre-agreed...