Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
erate (Extended Abstract) Patrick Bindjeme1† and James Allen Fill1 1 Department of Applied Mathematics and Statistics, The Johns Hopkins University, 34th and Charles Streets, Bal...
The Chernoff-Hoeffding bounds are fundamental probabilistic tools. An elementary approach is presented to obtain a Chernoff-type upper-tail bound for the number of prime factors o...
We establish the asymptotic normality of the number of upper records in a sequence of iid geometric random variables. Large deviations and local limit theorems as well as approxim...
Internet topology information is only made available in aggregate form by standard routing protocols. Connectivity information and latency characteristicsmust therefore be inferre...