1805 search results - page 211 / 361 » Functional programming with structured graphs |
142
click to vote
ADHOCNOW
2004
Springer
15 years 6 months ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
126
click to vote
CSFW
2010
IEEE
15 years 4 months ago
2010
IEEE
Nowadays it is widely accepted to formulate the security of a protocol carrying out a given task via the "trusted-party paradigm," where the protocol execution is compar...
115
click to vote
PLDI
2011
ACM
14 years 4 months ago
2011
ACM
We consider the problem of specifying combinations of data structures with complex sharing in a manner that is both declarative lts in provably correct code. In our approach, abst...
95
Voted
STACS
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
107
click to vote
APPINF
2003
15 years 2 months ago
2003
In this paper we present optimum interval routing algorithms for message passing networks that have topological structure defined by k-caterpillars and maximal outer planar graph...