7840 search results - page 313 / 1568 » On generalized Ramsey numbers |
176
click to vote
JACM
2000
15 years 6 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
179
click to vote
COMBINATORICS
1998
15 years 6 months ago
1998
We show that the moments of the trace of a random unitary matrix have combinatorial interpretations in terms of longest increasing subsequences of permutations. To be precise, we s...
169
click to vote
JUCS
2002
15 years 6 months ago
2002
Abstract: We define rationally additive semirings that are a generalization of ()complete and (-)continuous semirings. We prove that every rationally additive semiring is an iterat...
166
click to vote
TC
1998
15 years 6 months ago
1998
—This paper suggests a technique for analyzing the performance of checkpointing schemes with task duplication. We show how this technique can be used to derive the average execut...
183
click to vote
SIAMCOMP
2002
15 years 6 months ago
2002
We consider sums of functions of subtrees of a random binary search tree, and obtain general laws of large numbers and central limit theorems. These sums correspond to random recur...