612 search results - page 44 / 123 » Hardness assumptions in the foundations of theoretical compu... |
SENSYS
2006
ACM
14 years 1 months ago
2006
ACM
We explore fundamental performance limits of tracking a target in a two-dimensional field of binary proximity sensors, and design algorithms that attain those limits. In particul...
ENTCS
2006
13 years 7 months ago
2006
This paper has the purpose of reviewing some of the established relationships between logic and concurrency, and of exploring new ones. Concurrent and distributed systems are noto...
SOFSEM
2009
Springer
14 years 4 months ago
2009
Springer
We introduce the first process algebra with non-blocking reading actions for modelling concurrent asynchronous systems. We study the impact this new kind of actions has on fairnes...
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
We present a non-malleable commitment scheme that retains its security properties even when concurrently executed a polynomial number of times. That is, a manin-the-middle adversa...
RTA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. For narrowing to be an efficient evaluation mechanism, several lazy narrowing strategies have been proposed, although typically for the restricted case of left-linear con...