Author Description

This Book Presents The Proceedings Of The 12th Annual Symposium On Theoretical Aspects Of Computer Science (stacs 95), Held In Munich, Germany In March 1995. Besides Three Invited Talks, The Book Contains Revised Versions Of 53 Research Papers Selected From A Total Of 180 Submissions. The Contributions Address All Current Aspects Of Theoretical Computer Science; They Are Organized In Sections On Complexity Theory, Automata Theory, Algorithms, Logic, Theory Of Parallel Computing, Communication Theory, Graph Theory And Databases, And Computational Geometry.--publisher's Website. On The Synthesis Of Strategies In Infinite Games / W. Thomas -- Finding The Maximum With Linear Error Probabilities: A Sequential Analysis Approach / G. Louchard -- Completeness And Weak Completeness Under Polynomial-size Circuits / D.w. Juedes And J.h. Lutz -- Communication Complexity Of Key Agreement On Small Ranges / J.-y. Cai, R.j. Lipton, L. Longpre, M. Ogihara, K.w. Regan And D. Sivakumar -- Pseudorandom Generators And The Frequency Of Simplicity / Y. Han And L.a. Hemaspaandra -- Classes Of Bounded Counting Type And Their Inclusion Relations / U. Hertrampf -- Lower Bounds For Depth-three Circuits With Equals And Mod-gates / F. Green -- On Realizing Iterated Multiplication By Small Depth Threshold Circuits / M. Krause -- A Random Np-complete Problem For Inversion Of 2d Cellular Automata / B. Durand -- On The Subword Equivalence Problem For Infinite Words / I. Fagnot -- On The Separators On An Infinite Word Generated By A Morphism / E. Garel. Ernst W. Mayr, Claude Puech, Eds. Includes Bibliographical References And Index.