9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992. Proceedings Mitarbeit:Finkel, Alain; Jantzen, Matthias
9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992. Proceedings Mitarbeit:Finkel, Alain; Jantzen, Matthias
This volume gives the proceedings of the ninth Symposium onTheoretical Aspects of Computer Science (STACS). Thisannual symposium is held alternately in France and Germanyand is organized jointly by the Special Interest Group forFundamental Computer Science of the Association Francaisedes Sciences et Technologies de l'Information et desSyst mes (AFCET) and the Special Interest Group forTheoretical Computer Science of the Gesellschaft f}rInformatik (GI).The volume includes three invited lectures and sections onparallel algorithms, logic and semantics, computationalgeometry, automata and…mehr
This volume gives the proceedings of the ninth Symposium onTheoretical Aspects of Computer Science (STACS). Thisannual symposium is held alternately in France and Germanyand is organized jointly by the Special Interest Group forFundamental Computer Science of the Association Francaisedes Sciences et Technologies de l'Information et desSyst mes (AFCET) and the Special Interest Group forTheoretical Computer Science of the Gesellschaft f}rInformatik (GI).The volume includes three invited lectures and sections onparallel algorithms, logic and semantics, computationalgeometry, automata and languages, structural complexity,computational geometry and learning theory, complexity andcommunication, distributed systems, complexity, algorithms,cryptography, VLSI, words and rewriting, and systems.Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.
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 hierarchy.- Locally definable acceptance types for polynomial time machines.- The theory of the polynomial many-one degrees of recursive sets is undecidable.- A plane-sweep algorithm for finding a closest pair among convex planar objects.- Linear approximation of simple objects.- Language learning without overgeneralization.- The log-star revolution.- Separating counting communication complexity classes.- A nonlinear lower bound on the practical combinational complexity.- Characterizations of some complexity classes between ? 2 p and ? 2 p .- On complexity classes and algorithmically random languages.- New time hierarchy results for deterministic TMS.- Unconditional Byzantine agreement for any number of faulty processors.- Broadcasting in butterfly and debruijn networks.- Intervalapproximations of message causality in distributed executions.- On the approximability of the maximum common subgraph problem.- The complexity of colouring circle graphs.- Graph isomorphism is low for PP.- A simple linear time algorithm for triangulating three-colored graphs.- On locally optimal alignments in genetic sequences.- Secure commitment against a powerful adversary.- Communication efficient Zero-knowledge Proofs of knowledge.- Four results on randomized incremental constructions.- Enclosing many boxes by an optimal pair of boxes.- Performance driven k-layer wiring.- Synthesis for testability: Binary Decision Diagrams.- Compression and entropy.- Iterative devices generating infinite words.- On the factorization conjecture.- Conditional semi-Thue systems for presenting monoids.- A combinatorial bound for linear programming and related problems.- In-place linear probing sort.- Speeding up two string-matching algorithms.- The ANIGRAF system.- A programming language for symbolic computation of regular languages, automata and semigroups.- ?SPEED: a system for the specification and verification of microprocessors.- A discrete event simulator of communication algorithms in interconnection networks.- ALPHA DU CENTAUR: An environment for the design of systolic arrays.- Verification of communicating processes by means of automata reduction and abstraction.- Distributed system simulator (DSS).- An interactive proof tool for process algebras.- SPECI90 A term rewriting and narrowing system.
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 hierarchy.- Locally definable acceptance types for polynomial time machines.- The theory of the polynomial many-one degrees of recursive sets is undecidable.- A plane-sweep algorithm for finding a closest pair among convex planar objects.- Linear approximation of simple objects.- Language learning without overgeneralization.- The log-star revolution.- Separating counting communication complexity classes.- A nonlinear lower bound on the practical combinational complexity.- Characterizations of some complexity classes between ? 2 p and ? 2 p .- On complexity classes and algorithmically random languages.- New time hierarchy results for deterministic TMS.- Unconditional Byzantine agreement for any number of faulty processors.- Broadcasting in butterfly and debruijn networks.- Intervalapproximations of message causality in distributed executions.- On the approximability of the maximum common subgraph problem.- The complexity of colouring circle graphs.- Graph isomorphism is low for PP.- A simple linear time algorithm for triangulating three-colored graphs.- On locally optimal alignments in genetic sequences.- Secure commitment against a powerful adversary.- Communication efficient Zero-knowledge Proofs of knowledge.- Four results on randomized incremental constructions.- Enclosing many boxes by an optimal pair of boxes.- Performance driven k-layer wiring.- Synthesis for testability: Binary Decision Diagrams.- Compression and entropy.- Iterative devices generating infinite words.- On the factorization conjecture.- Conditional semi-Thue systems for presenting monoids.- A combinatorial bound for linear programming and related problems.- In-place linear probing sort.- Speeding up two string-matching algorithms.- The ANIGRAF system.- A programming language for symbolic computation of regular languages, automata and semigroups.- ?SPEED: a system for the specification and verification of microprocessors.- A discrete event simulator of communication algorithms in interconnection networks.- ALPHA DU CENTAUR: An environment for the design of systolic arrays.- Verification of communicating processes by means of automata reduction and abstraction.- Distributed system simulator (DSS).- An interactive proof tool for process algebras.- SPECI90 A term rewriting and narrowing system.
Es gelten unsere Allgemeinen Geschäftsbedingungen: www.buecher.de/agb
Impressum
www.buecher.de ist ein Internetauftritt der Steintor 70. V V GmbH (zukünftig firmierend: buecher.de internetstores GmbH)
Geschäftsführung: Monica Sawhney | Roland Kölbl
Sitz der Gesellschaft: Hannover
Amtsgericht Hannover HRB 227001
Steuernummer: 321/neu
