475 search results - page 51 / 95 » Z3-Connectivity with Independent Number 2 |
159
click to vote
CRYPTO
2006
Springer
15 years 9 months ago
2006
Springer
We present a robust multiparty computation protocol. The protocol is for the cryptographic model with open channels and a polytime adversary, and allows n parties to actively secur...
159
click to vote
APN
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. The research domain of process discovery aims at constructocess model (e.g. a Petri net) which is an abstract representation of an execution log. Such a Petri net should ...
167
Voted
STOC
2009
ACM
16 years 6 months ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
145
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
An ancestry labeling scheme labels the nodes of any tree in such a way that ancestry queries between any two nodes can be answered just by looking at their corresponding labels. T...
153
click to vote
STACS
2007
Springer
16 years 5 days ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...