392 search results - page 5 / 79 » Reversal Complexity Revisited |
DAGSTUHL
2004
13 years 8 months ago
2004
If Alice has x, y, Bob has x, z and Carol has y, z can they determine if x + y + z = N? They can if (say) Alice broadcasts x to Bob and Carol; can they do better? Chandra, Furst, a...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
—We present a method to eliminate redundancy in the transition tables of Boolean automata: schema redescription with two symbols. One symbol is used to capture redundancy of indi...
COCOON
2009
Springer
14 years 2 months ago
2009
Springer
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...
ICASSP
2009
IEEE
14 years 2 months ago
2009
IEEE
STACS
1993
Springer
13 years 11 months ago
1993
Springer
