Titlebook: STACS 97; 14th Annual Symposiu Rüdiger Reischuk,Michel Morvan Conference proceedings 1997 Springer-Verlag Berlin Heidelberg 1997 Automat.al

婚姻生活

Conference proceedings 1997any, in February/March 1997..The 46 revised full papers included were carefully selected from a total of 139 submissions; also included are three invited full papers. The papers presented span the whole scope of theoretical computer science. Among the topics covered are, in particular, algorithms an

无辜

薄荷醇

防水

Temporal logics for the specification of performance and reliability,fined with respect to timed systems that exhibit both probabilistic and nondeterministic behavior. We present model-checking algorithms for the algorithmic verification of the specifications, and we discuss their complexity.

Petechiae

红润

opinionated

Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial- this result establishes for the first time an at most polynomial gap between Las Vegas and determinism for a uniform computing model..On the other hand superlogarithmic many advice bits in nondeterministic computations can be more powerful than Las Vegas (even Monte Carlo) computations in a relativized word.

拥护

Gossiping and broadcasting versus computing functions in networks,ng in the network graph. A similar relation exists between computing functions with the output appearing at only one processor and the complexity of broadcasting. Our methods can also be applied to extend known lower bounds for broadcasting a bit on EREW PRAMs to the much more general (randomized) distributed memory machines (DMMs).

地牢

correspondent

Fast online multiplication of real numbers, more digits of the input reals, an algorithm for a real function produces more and more precise approximations of the desired result. An algorithm . is called online, if for every . ∈ ℕ the input-precision, which . requires for producing the result with precision (1/2)., is approximately the same as the topologically necessary precision.