CSR
2010
Springer
14 years 4 months ago
2010
Springer
CSR
2010
Springer
14 years 4 months ago
2010
Springer
CSR
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. In this survey we compare the similarities, differences and the complexities of two very different approaches to solve a general constraint satisfaction probblems (CSP). ...
CSR
2010
Springer
14 years 4 months ago
2010
Springer
Let πw denote the failure function of the Knuth-Morris-Pratt algorithm for a word w. In this paper we study the following problem: given an integer array A [1 . . n], is there a w...
CSR
2010
Springer
14 years 4 months ago
2010
Springer
Algorithmic tools for graphs of small treewidth are used to address questions in complexity theory. For both arithmetic and Boolean circuits, it is shown that any circuit of size ...
CSR
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. We introduce dynamic communicating automata (DCA), an extension of communicating finite-state machines that allows for dynamic creation of processes. Their behavior can ...
CSR
2010
Springer
14 years 4 months ago
2010
Springer
By terms-allowed-in-types capacity, the Logic of Proofs LP includes formulas of the form t : ϕ(t), which have self-referential meanings. In this paper, “prehistoric phenomena...
SCCC
2002
IEEE
14 years 4 months ago
2002
IEEE
SCCC
2002
IEEE
14 years 4 months ago
2002
IEEE
The compression of binary texts using antidictionaries is a novel technique based on the fact that some substrings (called “antifactors”) never appear in the text. Let × be a...
SCCC
2002
IEEE
14 years 4 months ago
2002
IEEE
The distribution of keys by a hash function as used in hash search with chaining is studied by considering the distribution of keys a random function from keys to buckets would gi...