In this paper we present an efficient general simulation strategy for computations designed for fully operational BSP machines of n ideal processors, on n-processor dynamic-fault-p...
Spyros C. Kontogiannis, Grammati E. Pantziou, Paul...
In this paper we consider the complexity of several problems involving finite algebraic structures. Given finite algebras A and B, these problems ask the following. (1) Do A and B ...
Document search is generally based on individual terms in the document. However, for collections within limited domains it is possible to provide more powerful access tools. This ...
We describe the use of a domain-specific language (DSL) for expressing critical design values and constraints in an intrusion detection application. Through the use of this specia...
A computer network consists of a set of computing nodes interconnected via communication channels. It is commonly assumed that, for each pair of network nodes u and v, there is at...