This volume contains the presentations of the Fifth Symposium on Theoretical Aspects of Computer Science (STACS 88) held at the University of Bordeaux, February 11-13, 1988. In addition to papers presented in the regular program the volume contains abstracts of software systems demonstrations which were included in this conference series in order to show applications of research results in theoretical computer science. The papers are grouped into the following thematic sections: algorithms, complexity, formal languages, rewriting systems and abstract data types, graph grammars, distributed algorithms, geometrical algorithms, trace languages, semantics of parallelism.5th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 11-13, 1988; ... Theorem 4.2 For any tree T with n vertices, N$(t) can be constructed in 0(n1+Io*Ara#39;a#39;logn) time. ... A question of interest regarding the problems considered in the previous sections is determining their steady-state solutions [A, Me]. For the ... Let ^4AdAd denote this vertex cover, let t^ be the time at which AAdAd becomes optimum, and let CAdAd(alt;) be the cost of AAdAd as a function of time.

Title | : | STACS 88 |

Author | : | Robert Cori, Martin Wirsing |

Publisher | : | Springer Science & Business Media - 1988-01-27 |

You must register with us as either a Registered User before you can Download this Book. You'll be greeted by a simple sign-up page.

Once you have finished the sign-up process, you will be redirected to your download Book page.

`1.`Register a free 1 month Trial Account.`2.`Download as many books as you like (Personal use)`3.`Cancel the membership at any time if not satisfied.