Abstract. Total Exchange is one of the most important collective communication patterns for scientific applications. In this paper we propose an algorithm called LG for the total e...
In this paper it is shown that a class of almost-median graphs that includes all planar almost-median graphs can be recognized in O(m log n) time, where n denotes the number of ve...
For the unbiased Maker-Breaker game, played on the hypergraph H, let τM (H) be the smallest integer t such that Maker can win the game within t moves (if the game is a Breaker’...
Dan Hefetz, Michael Krivelevich, Milos Stojakovic,...
We present a new contrast enhancing color to grayscale conversion algorithm which works in real-time. It incorporates novel techniques for image sampling and dimensionality reduct...
We present Pro3Gres, a deep-syntactic, fast dependency parser that combines a handwritten competence grammar with probabilistic performance disambiguation and that has been used i...
Gerold Schneider, Kaarel Kaljurand, Fabio Rinaldi,...