195
click to vote
ICALP
15 years 8 months ago
2010 Springer 
We study bargaining games between suppliers and manufacturers in a network context. Agents wish to enter into contracts in order to generate surplus which then must be divided amon...
146
click to vote
ICALP
15 years 9 months ago
2010 Springer 
We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
164
click to vote
ICALP
15 years 11 months ago
2010 Springer
Abstract. This paper tackles three algorithmic problems for probabilistic automata on finite words: the Emptiness Problem, the Isolation Problem and the Value 1 Problem. The Empti...
190
click to vote
ICALP
15 years 11 months ago
2010 Springer 
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...
160
click to vote
ICALP
15 years 11 months ago
2010 Springer
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...
|
Programming Languages