In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
— This paper addresses the problem of efficiently computing robot navigation functions. Navigation functions are potential functions free of spurious local minima that present a...
Luciano C. A. Pimenta, Alexandre R. Fonseca, Guilh...
In this paper we describe the architecture and initial performance analysis results of the SERVOGrid Complexity Computational Environments (CCE). The CCE architecture is based on ...
Galip Aydin, Mehmet S. Aktas, Geoffrey Fox, Harsha...
Weighted threshold games are coalitional games in which each player has a weight (intuitively corresponding to its voting power), and a coalition is successful if the sum of its w...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...