We consider the problem of computing a watchman route in a polygon with holes. We show that the problem of finding a minimum-link watchman route is NP...
In this paper we present a simple and efficient implementation of a min-max priority queue, reflected min-max priority queues. The main merits of our...
We consider cuckoo hashing as proposed by Pagh and Rodler in 2001. We show that the expected construction time of the hash table is O(n) as long as th...
In the data-accumulating paradigm, inputs arrive continuously in real time, and the computation terminates when all the already received data are proc...
