182 search results - page 18 / 37 » A Theory of Strict P-completeness |
LICS
2009
IEEE
14 years 2 months ago
2009
IEEE
The search for an expressive calculus of datatypes in which canonical algorithms can be easily written and proven correct has proved to be an enduring challenge to the theoretical ...
DNA
2007
Springer
14 years 1 months ago
2007
Springer
While algorithmic DNA self-assembly is, in theory, capable of forming complex patterns, its experimental demonstration has been limited by significant assembly errors. In this pa...
SIGCOMM
2006
ACM
14 years 1 months ago
2006
ACM
Traditional studies of routing problems often assumed strict preferences on paths, by eliminating ambiguity in path comparisons, or imposing a priori deterministic tie-breaking. S...
STORAGESS
2005
ACM
14 years 1 months ago
2005
ACM
We study cryptographic modeling and encryption-based design techniques for guaranteeing privacy of data that is first stored in some type of computer memory and then deleted. We ...
EMSOFT
2005
Springer
14 years 1 months ago
2005
Springer
We propose a programming model dedicated to real-time videostreaming applications for embedded media devices, including highdefinition TVs. This model is built on the synchronous...