1686 search results - page 224 / 338 » Programs as polygraphs: computability and complexity |
129
click to vote
HPCC
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. The Ubiquitous Web requires novel programming paradigms and distributed architectures for the support of advanced services to a multitude of user devices and profiles. I...
123
click to vote
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
130
click to vote
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
144
click to vote
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
We study a clean machine model for external memory and stream processing. We show that the number of scans of the external data induces a strict hierarchy (as long as work space is...
120
click to vote
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract: The quantum adversary method is one of the most versatile lower-bound methods for quantum algorithms. We show that all known variants of this method are equivalent: spect...