1389 search results - page 145 / 278 » Parallel Algorithms for Treewidth Two |
122
click to vote
STACS
2012
Springer
13 years 5 months ago
2012
Springer
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
COCO
1997
Springer
15 years 2 months ago
1997
Springer
In this paper we design a nonadaptive NC checker for permutation group intersection, sharpening a result from Blum and Kannan 3]. This is a consequence of two results. First we sh...
PODC
1990
ACM
15 years 2 months ago
1990
ACM
Emulators that translate algorithms from the shared-memory model to two different message-passing models are presented. Both are achieved by implementing a wait-free, atomic, singl...
ESCIENCE
2007
IEEE
15 years 1 months ago
2007
IEEE
Provenance management has become increasingly important to support scientific discovery reproducibility, result interpretation, and problem diagnosis in scientific workflow enviro...
CONCUR
1991
Springer
15 years 1 months ago
1991
Springer
This paper deals with verification methods based on equivalence relations between labeled transition systems. More precisely, we are concerned by two practical needs: how to effi...