Although there are many efficient algorithms for calculating the simulation preorder on finite Kripke structures, only two have been proposed of which the space complexity is of t...
Restricting the search space {0, 1}n to the set of truth tables of “easy” Boolean functions on log n variables, as well as using some known hardness-randomness tradeoffs, we ...
Russell Impagliazzo, Valentine Kabanets, Avi Wigde...
This paper presents a simulation performance improvement of the application of the Multicomponent Discrete Time System Specification (MultiDTSS) formalism to a fire spread. Multic...
Abstract. A new realization of a space-efficient deque is presented. The data structure is constructed from three singly resizable arrays, each of which is a blockwiseallocated pil...
In this paper, we present optimal in time algorithms to compute the distance transform, the reverse distance transform and the discrete medial axis on digital objects embedded on ...