75 search results - page 5 / 15 » Definability of Combinatorial Functions and Their Linear Rec... |
TCS
2008
13 years 8 months ago
2008
We consider a large class of sequences, called admissible sequences, which are defined by systems of (possibly nonlinear) difference equations. A procedure for recursively enumera...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
The paper is organized as a self-contained literate Haskell program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmet...
CPM
2006
Springer
14 years 8 days ago
2006
Springer
We consider the problem of tiling a segment {0, . . . , n} of the discrete line. More precisely, we ought to characterize the structure of the patterns that tile a segment and thei...
TCS
2008
13 years 8 months ago
2008
It was proved few years ago that classes of Boolean functions definable by means of functional equations [9], or equivalently, by means of relational constraints [16], coincide wit...
ALGORITHMICA
1998
13 years 8 months ago
1998
Abstract. This paper presents moment analyses and characterizations of limit distributions for the construction cost of hash tables under the linear probing strategy. Two models ar...