154 search results - page 8 / 31 » rsa 2006 |
RSA
2002
14 years 11 months ago
2002
Let Bd n denote the family which consists of all subsets S1
RSA
2002
14 years 11 months ago
2002
: We analyze the (3, 2, 1)-Shell Sort algorithm under the usual random permutation model.
RSA
2006
14 years 11 months ago
2006
We study the question as to when a random graph with n vertices and m edges contains a copy of almost all graphs with n vertices and cn/2 edges, c
104
click to vote
RSA
2000
14 years 11 months ago
2000
A succinct series expression is derived for describing the limit distribution of the number of times r consecutive elements are all records (in a sequence of independent and ident...
RSA
2000
14 years 11 months ago
2000
The creation and growth of components of a given complexity in a random graph process are studied. In particular, the expected number and total size of all such components is found...