721 search results - page 10 / 145 » Almost universal graphs |
107
click to vote
EUROCRYPT
2008
Springer
15 years 2 months ago
2008
Springer
Secure multi-party computation (MPC) is a central problem in cryptography. Unfortunately, it is well known that MPC is possible if and only if the underlying communication network...
88
Voted
STACS
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We address the problem of the density of intrinsically universal cellular automata among cellular automata or a subclass of cellular automata. We show that captive cellul...
91
Voted
ICPR
2002
IEEE
16 years 1 months ago
2002
IEEE
GraphGrep is an application-independent method for querying graphs, finding all the occurrences of a subgraph in a database of graphs. The interface to GraphGrep is a regular expr...
81
Voted
STOC
2004
ACM
16 years 1 months ago
2004
ACM
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...
131
Voted
COLT
2008
Springer
15 years 2 months ago
2008
Springer
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...