5128 search results - page 856 / 1026 » When Abstraction Fails |
186
click to vote
TCS
2011
15 years 1 months ago
2011
d Abstract) Hagit Attiya and Eshcar Hillel Department of Computer Science, Technion The design of concurrent data structures is greatly facilitated by the availability of synchroni...
185
click to vote
TIT
2011
15 years 1 months ago
2011
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...
211
click to vote
TSP
2011
15 years 1 months ago
2011
Abstract—In multinode cooperative communications, simultaneous transmissions from two or more nodes are challenging due to its asynchronous nature. In addition, channel estimatio...
184
click to vote
IFIP
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We consider two standard notions in formal security protocol analysis: message deducibility and static equivalence under equational theories. We present polynomial-time a...
196
click to vote
IFIP
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...