Sciweavers

SIAMCOMP
2002
139views more  SIAMCOMP 2002»
13 years 11 months ago
Limit Laws for Sums of Functions of Subtrees of Random Binary Search Trees
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...
Luc Devroye
RSA
2002
71views more  RSA 2002»
13 years 11 months ago
The infamous upper tail
Let be a finite index set and k 1 a given integer. Let further S []k be an arbitrary family of k element subsets of . Consider a (binomial) random subset p of , where p = (pi :...
Svante Janson, Andrzej Rucinski
RSA
2002
75views more  RSA 2002»
13 years 11 months ago
On the expected value of the minimum assignment
: We prove the main conjecture of the paper "On the expected value of the minimum assignment" by Marshall W. Buck, Clara S. Chan, and David P. Robbins [Random Structures ...
Marshall W. Buck, Clara S. Chan, David P. Robbins
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
13 years 11 months ago
Universal Limit Laws for Depths in Random Trees
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
Luc Devroye
RSA
2000
97views more  RSA 2000»
13 years 11 months ago
On the distribution of rank of a random matrix over a finite field
Let M = (mij) be a random n
Colin Cooper
CPC
2002
95views more  CPC 2002»
13 years 11 months ago
Permutation Pseudographs And Contiguity
The space of permutation pseudographs is a probabilistic model of 2-regular pseudographs on n vertices, where a pseudograph is produced by choosing a permutation of {1, 2, . . . ...
Catherine S. Greenhill, Svante Janson, Jeong Han K...
COMBINATORICS
2000
89views more  COMBINATORICS 2000»
13 years 11 months ago
A Note on the Non-Colorability Threshold of a Random Graph
In this paper we consider the problem of establishing a value r0 such that almost all random graphs with n vertices and rn edges, r > r0, are asymptotically not 3-colorable. In...
Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C....
CN
2000
109views more  CN 2000»
13 years 11 months ago
On near-uniform URL sampling
We consider the problem of sampling URLs uniformly at random from the Web. A tool for sampling URLs uniformly can be used to estimate various properties of Web pages, such as the ...
Monika Rauch Henzinger, Allan Heydon, Michael Mitz...
LOGCOM
2007
89views more  LOGCOM 2007»
13 years 11 months ago
Algorithmic Randomness of Closed Sets
We investigate notions of randomness in the space C[2N ] of nonempty closed subsets of {0, 1}N . A probability measure is given and a version of the Martin-L¨of test for randomne...
George Barmpalias, Paul Brodhead, Douglas Cenzer, ...
JSAC
2007
78views more  JSAC 2007»
13 years 11 months ago
VMesh: Distributed Segment Storage for Peer-to-Peer Interactive Video Streaming
Abstract—Provisioning random access functions in peer-topeer on-demand video streaming is challenging, due to not only the asynchronous user interactivity but also the unpredicta...
Wai-Pun Ken Yiu, Xing Jin, Shueng-Han Gary Chan