We investigate the complexity of the satisfiability problem of constraints over finite totally ordered domains. In our context, a clausal constraint is a disjunction of inequaliti...
Nadia Creignou, Miki Hermann, Andrei A. Krokhin, G...
Data-dependent (DD) permutations (DDP) are discussed as a cryptographic primitive for the design of fast hardware, firmware, and software encryption systems. DDP can be performed...
Nikolay A. Moldovyan, Peter A. Moldovyanu, Douglas...
When employing a consensus algorithm for state machine replication, should one optimize for the case that all communication links are usually timely, or for fewer timely links? Do...
We describe a new collaborative technology that bridges the gap between ad hoc collaboration in email and more formal collaboration in structured shared workspaces. Our approach is...
A new class of image information-restoration algorithms virtually different from traditional techniques are proposed. In comparison with other approaches, our methods not only use ...