ISAAC
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. Buhrman, Cleve and Wigderson gave a general communication protocol for block-composed functions f(g1(x1 , y1 ), · · · , gn(xn , yn )) by simulating a decision tree com...
ISAAC
2009
Springer
14 years 4 months ago
2009
Springer
Toric ideals have many applications including solving integer programs. Several algorithms for computing the toric ideal of an integer matrix are available in the literature. Since...
ISAAC
2009
Springer
14 years 4 months ago
2009
Springer
Connected bipartite permutation graphs without vertex labels are investigated. First, the number of connected bipartite permutation graphs of n vertices is given. Based on the num...
ISAAC
2009
Springer
14 years 4 months ago
2009
Springer
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
ISAAC
2009
Springer
14 years 4 months ago
2009
Springer
ISAAC
2009
Springer
14 years 4 months ago
2009
Springer
ISAAC
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...
ISAAC
2009
Springer
14 years 4 months ago
2009
Springer
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...
ISAAC
2009
Springer
14 years 4 months ago
2009
Springer
ICCS
2009
Springer
14 years 4 months ago
2009
Springer
Many bioinformatics studies require the analysis of RNA or DNA structures. More specifically, extensive work is done to elaborate efficient algorithms able to predict the 2-D fold...