DMTCS
2011
13 years 1 months ago
2011
Abstract. We present an algorithm that for 2-colorable 3-uniform hypergraphs, finds a 2-coloring in average running time O(n5 log2 n).
CASC
2011
Springer
13 years 1 months ago
2011
Springer
Abstract. We study continuous dynamical systems defined by autonomous ordinary differential equations, themselves given by parametric rational functions. For such systems, we pro...
CASC
2011
Springer
13 years 1 months ago
2011
Springer
We investigate two practical divide-and-conquer style algorithms for univariate polynomial arithmetic. First we revisit an algorithm originally described by Brent and Kung for comp...
CALCO
2011
Springer
13 years 1 months ago
2011
Springer
Abstract. We propose a probabilistic interpretation of a class of reversible communicating processes. The rate of forward and backward computing steps, instead of being given expli...
CALCO
2011
Springer
13 years 1 months ago
2011
Springer
Abstract. The free algebra adjunction, between the category of algebras of a monad and the underlying category, induces a comonad on the category of algebras. The coalgebras of thi...
CALCO
2011
Springer
13 years 1 months ago
2011
Springer
This paper extends the fibrational approach to induction and coinduction pioneered by Hermida and Jacobs, and developed by the current authors, in two key directions. First, we pr...
CALCO
2011
Springer
13 years 1 months ago
2011
Springer
Fusion is arguably the simplest way to combine modal logics. For normal modal logics with Kripke semantics, many properties such as completeness and decidability are known to trans...
CALCO
2011
Springer
13 years 1 months ago
2011
Springer
Abstract. We investigate the phenomenon that every monad is a linear state monad. We do this by studying a fully-complete state-passing translation from an impure call-by-value lan...
0
posts
with
0
views
0
views
Homepage