Let M be a fixed finite monoid. We consider the problem of implementing a data type containing a vector x ϭ ( x1, x2, . . . , xn) ʦ Mn , initially (1, 1, . . . , 1), with two kin...
Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, S...
We consider the following scenario. A point robot is placed at some start location ¡ in a 2dimensional scene containing oriented rectangular obstacles. The robot must repeatedly ...
RSA-FDH and many other schemes secure in the Random-Oracle Model (ROM) require a hash function with output size larger than standard sizes. We show that the random-oracle instanti...
Two decades ago, Megiddo and Dyer showed that linear programming in two and three dimensions (and subsequently any constant number of dimensions) can be solved in linear time. In ...