7064 search results - page 1412 / 1413 » From States to Histories |
STOC
2007
ACM
14 years 6 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
MOBIHOC
2008
ACM
14 years 5 months ago
2008
ACM
We study the multicast capacity of a random wireless network consisting of ordinary wireless nodes and base stations, known as a hybrid network. Assume that n ordinary wireless no...
ACNS
2009
Springer
14 years 26 days ago
2009
Springer
In this paper, we present a pseudo-collision attack on the compression function of all Twister variants (224,256,384,512) with complexity of about 226.5 compression function evalua...
ATVA
2009
Springer
14 years 25 days ago
2009
Springer
: In this paper, we address the problem of synthesizing opaque systems. A secret predicate S over the runs of a system G is opaque to an external user having partial observability ...
STACS
2007
Springer
14 years 11 days ago
2007
Springer
We consider commutative string rewriting systems (Vector Addition Systems, Petri nets), i.e., string rewriting systems in which all pairs of letters commute. We are interested in r...