8 search results - page 2 / 2 » Polynomial Deterministic Rendezvous in Arbitrary Graphs |
111
click to vote
TAMC
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded. ...
122
click to vote
FCT
2005
Springer
15 years 5 months ago
2005
Springer
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 ...
STOC
2005
ACM
15 years 12 months ago
2005
ACM
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...