This paper is motivated by a need of practical asynchronous network systems, i.e., a wait-free distributed mutual exclusion algorithm (WDME). The WDME algorithm is very appealing w...
A simple and efficient randomized algorithm is presented for solving single-query path planning problems in high-dimensional configuration spaces. The method works by incrementall...
In this paper we give a new decomposition algorithm that breaks a multilevel relation into single-level relations and a new recovery algorithmwhich reconstructs the original multi...
For many election systems, bribery (and related) attacks have been shown NP-hard using constructions on combinatorially rich structures such as partitions and covers. It is import...
Felix Brandt, Markus Brill, Edith Hemaspaandra, La...
The discontinuities in boundaries and exteriors that regions with holes expose offer opportunities for inferences that are impossible for regions without holes. A systematic study ...