1552 search results - page 56 / 311 » On the Complexity of Constant Propagation |
183
click to vote
EUROCRYPT
2004
Springer
15 years 11 months ago
2004
Springer
We prove a tight lower bound for generic protocols for secure multicast key distribution where the messages sent by the group manager for rekeying the group are obtained by arbitra...
158
click to vote
CIAC
2010
Springer
15 years 9 months ago
2010
Springer
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
162
click to vote
COCOON
2008
Springer
15 years 8 months ago
2008
Springer
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
154
click to vote
IJAC
2007
15 years 6 months ago
2007
Abstract. We say the endomorphism problem is solvable for an element W in a free group F if it can be decided effectively whether, given U in F , there is an endomorphism φ of F ...
135
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
Abstract. Monadic second-order unification is second-order unification where all function constants occurring in the equations are unary. Here we prove that the problem of deciding...