Abstract. This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted graphs. We assume that the input graph is complete and the edge weigh...
How much can an imperfect source of randomness affect an algorithm? We examine several simple questions of this type concerning the long-term behavior of a random walk on a finite...
Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Nath...
We prove that the First Fit bin packing algorithm is stable under the input distribution U{k - 2, k} for all k 3, settling an open question from the recent survey by Coffman, Gar...
The paper presents a new technique of image enhancement. The described algorithm enables the suppression of noise and contrast enhancement. The interesting feature of this new alg...
Bogdan Smolka, Konrad W. Wojciechowski, Marek Szcz...