We continue the study of the linear complexity of binary sequences, independently introduced by Sidel'nikov and Lempel, Cohn, and Eastman. These investigations were originated...
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
The Private Network-to-Network Interface (PNNI) is a scalable hierarchical protocol that allows ATM switches to be aggregated into clusters called peer groups. To provide good acc...
Abstract— For many evolving application scenarios like ubiquitous and autonomic computing systems, trustworthy computing solutions are essential. However the fact that the autono...
Dynamic complexity investigates the required effort to maintain knowledge about a property of a structure under changing operations. This article introduces a refined notion of ...