2143 search results - page 112 / 429 » corr 2010 |
111
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract This paper proposes a design for a system to generate constraint solvers that are specialised for specific problem models. It describes the design in detail and gives prel...
127
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We show that a large fraction of the data-structure lower bounds known today in fact follow by reduction from the communication complexity of lopsided (asymmetric) set disjointness...
125
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
The packing chromatic number (G) of a graph G is the least integer k for which there exists a mapping f from V (G) to {1, 2, . . ., k} such that any two vertices of color i
134
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. In this paper a tight bound on the worst-case number of comparisons for Floyd's well known heap construction algorithm, is derived. It is shown that at most 2n - 2
127
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
A coding method using binary sequences is presented for different computation problems related to Catalan numbers. This method proves in a very easy way the equivalence of these pr...