8 search results - page 2 / 2 » Polynomial Deterministic Rendezvous in Arbitrary Graphs |
TAMC
2010
Springer
14 years 15 days 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. ...
FCT
2005
Springer
14 years 27 days 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
14 years 7 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...