Titlebook: STACS 99; 16th Annual Symposiu Christoph Meinel,Sophie Tison Conference proceedings 1999 Springer-Verlag Berlin Heidelberg 1999 Automat.alg

FIS

An Optimal Strategy for Searching in Unknown Streets the boundary so that the two boundary chains between them are weakly mutually visible. We are interested in the ratio of the search path length to the shortest path length which is called the . of the strategy. We present an optimal strategy whose competitive ratio matches the known lower bound of

calamity

極肥胖

Herpetologist

condescend

Cervical-Spine

Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructionsstruction of evolutionary trees: a new upper time-bound on the problem of constructing an evolutionary tree from experiments, and a relatively fast approximation algorithm for the maximum agreement subtree problem for binary trees for which the maximum number of leaves in an optimal solution is larg

歡樂東方

glamor

靈敏

An Optimal Strategy for Searching in Unknown Streetse shortest path length which is called the . of the strategy. We present an optimal strategy whose competitive ratio matches the known lower bound of √2, thereby closing the gap between the lower bound and the best known upper bound.

運(yùn)動(dòng)的我

Complexity of Some Problems in Universal Algebraf term operations?.In addition to the general case in which we allow arbitrary (finite) algebras, we consider each of these problems under the restrictions that all operations are unary, and that . and . have cardinality two. We briefly discuss the relationship of these problems to algebraic specification theory.