STACS 92 : 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992. Proceedings. 1st ed. 1992

種類:

電子ブック

責任表示:

edited by Alain Finkel, Matthias Jantzen

出版情報:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1992

著者名:

• Finkel, Alain.
• Jantzen, Matthias.
• SpringerLink (Online service)

シリーズ名:

Lecture Notes in Computer Science ; 577

ISBN:

9783540467755 [3540467750]    

注記:

Structuring and modularizing algebraic specifications: the PLUSS specification language, evolutions and perspectives -- The parallel complexity of tree embedding problems (extended abstract) -- A theory of strict P-completeness -- Fast and optimal simulations between CRCW PRAMs -- Suitability of the propositional temporal logic to express properties of real-time systems -- Axiomatizations of backtracking -- Joining k- and l-recognizable sets of natural numbers -- On the performance of networks with multiple busses -- Efficient algorithms for solving systems of linear equations and path problems -- Efficient sublinear time parallel algorithms for dynamic programming and context-free recognition -- A simplified technique for hidden-line elimination in terrains -- A competitive analysis of nearest neighbor based algorithms for searching unknown scenes -- Equality and disequality constraints on direct subterms in tree automata -- Deterministic regular languages -- The extended low hierarchy is an infinite hierarc
This volume gives the proceedings of the ninth Symposium on Theoretical Aspects of Computer Science (STACS). This annual symposium is held alternately in France and Germany and is organized jointly by the Special Interest Group for Fundamental Computer Science of the Association Francaise des Sciences et Technologies de l'Information et des Syst mes (AFCET) and the Special Interest Group for Theoretical Computer Science of the Gesellschaft f}r Informatik (GI). The volume includes three invited lectures and sections on parallel algorithms, logic and semantics, computational geometry, automata and languages, structural complexity, computational geometry and learning theory, complexity and communication, distributed systems, complexity, algorithms, cryptography, VLSI, words and rewriting, and systems.

ローカル注記:

学内専用E-BOOKS (local access only)