1301 search results - page 74 / 261 » Bounded Version Vectors |
157
Voted
FCT
2005
Springer
15 years 9 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 ...
160
click to vote
ICQNM
2008
IEEE
15 years 10 months ago
2008
IEEE
—We study a protocol in which many parties use quantum communication to transfer a shared state to a receiver without communicating with each other. This protocol is a multiparty...
147
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
We consider the Gaussian Multiple Access Wire-Tap Channel (GMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and in...
124
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r(n), there are several furth...
128
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We study how the choice of packet scheduling algorithms influences end-to-end performance on long network paths. Taking a network calculus approach, we consider both deterministi...