Sciweavers

106 search results - page 13 / 22
» Two Element Unavoidable Sets of Partial Words
Sort
View
SIAMDM
2008
190views more  SIAMDM 2008»
13 years 8 months ago
On the Complexity of Ordered Colorings
We introduce two variants of proper colorings with imposed partial ordering on the set of colors. One variant shows very close connections to some fundamental problems in graph the...
Arvind Gupta, Jan van den Heuvel, Ján Manuc...
PVM
2009
Springer
14 years 3 months ago
Fine-Grained Data Distribution Operations for Particle Codes
Abstract This paper proposes a new fine-grained data distribution operation MPI Alltoall specific that allows an element-wise distribution of data elements to specific target pro...
Michael Hofmann, Gudula Rünger
SAT
2010
Springer
141views Hardware» more  SAT 2010»
14 years 14 days ago
Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT
Non-trivial linear straight-line programs over the Galois field of two elements occur frequently in applications such as encryption or high-performance computing. Finding the shor...
Carsten Fuhs, Peter Schneider-Kamp
CORR
2010
Springer
97views Education» more  CORR 2010»
13 years 8 months ago
Bulking II: Classifications of Cellular Automata
This paper is the second part of a series of two papers dealing with bulking: a way to define quasi-order on cellular automata by comparing space-time diagrams up to rescaling. In...
Marianne Delorme, Jacques Mazoyer, Nicolas Ollinge...
SIAMDM
2002
94views more  SIAMDM 2002»
13 years 8 months ago
How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems
A quorum system is a collection of sets (quorums) every two of which intersect. Quorum systems have been used for many applications in the area of distributed systems, including mu...
David Peleg, Avishai Wool