We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
In the online bidding problem, a bidder is trying to guess a positive number T, by placing bids until the value of the bid is at least T. The bidder is charged with the sum of the...
We consider exploration problems where a robot has to construct a complete map of an unknown environment. We assume that the environment is modeled by a directed, strongly connecte...
We study three new techniques which will speed up the branch-and-bound algorithm for the MAX-2-SAT problem: The first technique is a new lower bound function for the algorithm an...
The timestamp problem captures a fundamental aspect of asynchronous distributed computing. It allows processes to label events throughout the system with timestamps that provide in...