Titlebook: Automata, Languages and Programming; 28th International C Fernando Orejas,Paul G. Spirakis,Jan Leeuwen Conference proceedings 2001 Springer

Musket

Bürger und Gemeinwesen in Europare are computations whose optimal schedule does vary with the access function. In particular, we exhibit some computations for which any schedule is bound to be a polynomial factor slower than optimal on at least one of two sufficiently different machines. On the positive side, we show that relative

Insulin

斥責(zé)

Integrating Semantics for Object—Oriented System Modelsodels, where each viewpoint model, due to its partiality, admits a set of possible interpretations. In this paper such an integrating semantic domain is sketched and an application to structure and behaviour models of the Unified Modeling Language is discussed.

撫育

Infusion

Gewaltenteilung und Parteien im Wandeln a box. We provide a quasi-polynomial algorithm for the latter dualization problem. These results imply, in particular, that the problem of incrementally generating minimal integer solutions of a monotone system of linear inequalities can be done in quasi-polynomial time.

Obliterate

CESS

ERUPT

Diuretic

使苦惱

The Complexity of Constructing Evolutionary Trees Using Experimentser bound, matching our upper bounds and improving the previous best lower bound by a factor .(log..). Central to our algorithm is the construction and maintenance of separator trees of small height, which may be of independent interest.