We analyze Markov chains for generating a random k-coloring of a random graph Gn,d/n. When the average degree d is constant, a random graph has maximum degree (log n/ log log n), ...
Martin E. Dyer, Abraham D. Flaxman, Alan M. Frieze...
Abstract. The worst-case complexity of an implementation of Quicksort depends on the random number generator that is used to select the pivot elements. In this paper we estimate th...
There exist a wide variety of network design problems that require a traffic matrix as input in order to carry out performance evaluation. The research community has not had at it...
The input-output weight enumeration (distribution) function of the ensemble of serially concatenated turbo codes is derived, where the ensemble is generated by a uniform choice ov...
Abstract. ESIGN is an efficient signature scheme that has been proposed in the early nineties (see [14]). Recently, an effort was made to lay ESIGN on firm foundations, using the...