skip to content
STACS 92 : 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992. Proceedings Preview this item
ClosePreview this item
Checking...

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

Author: Alain Finkel; Matthias Jantzen
Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1992.
Series: Lecture notes in computer science, 577.
Edition/Format:   eBook : Document : EnglishView all editions and formats
Publication:Springer e-books.
Summary:
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  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Additional Physical Format: STACS 92
(NL-LeOCL)093713282
(OCoLC)25246117
Material Type: Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: Alain Finkel; Matthias Jantzen
ISBN: 9783540552109 3540552103 9783540467755 3540467750
OCLC Number: 793077222
Description: 1 online resource : v.: digital.
Contents: 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 --
Interval approximations 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.
Series Title: Lecture notes in computer science, 577.
Responsibility: by Alain Finkel, Matthias Jantzen.

Abstract:

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.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/793077222> # STACS 92 : 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992. Proceedings
    a schema:CreativeWork, schema:Book, schema:MediaObject ;
    library:oclcnum "793077222" ;
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/1104428918#Place/berlin_heidelberg> ; # Berlin, Heidelberg
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/gw> ;
    schema:about <http://experiment.worldcat.org/entity/work/data/1104428918#Topic/logics_and_meanings_of_programs> ; # Logics and Meanings of Programs
    schema:about <http://id.worldcat.org/fast/868961> ; # Combinatorial analysis
    schema:about <http://id.worldcat.org/fast/1041273> ; # Numerical analysis
    schema:about <http://id.worldcat.org/fast/1002045> ; # Logic design
    schema:about <http://experiment.worldcat.org/entity/work/data/1104428918#Topic/combinatorics> ; # Combinatorics
    schema:about <http://id.worldcat.org/fast/872527> ; # Computer software
    schema:about <http://dewey.info/class/004.0151/e23/> ;
    schema:about <http://experiment.worldcat.org/entity/work/data/1104428918#Topic/computer_science> ; # Computer Science
    schema:about <http://experiment.worldcat.org/entity/work/data/1104428918#Topic/engineering_&_applied_sciences> ; # Engineering & Applied Sciences
    schema:about <http://experiment.worldcat.org/entity/work/data/1104428918#Topic/algorithm_analysis_and_problem_complexity> ; # Algorithm Analysis and Problem Complexity
    schema:about <http://experiment.worldcat.org/entity/work/data/1104428918#Topic/mathematical_logic_and_formal_languages> ; # Mathematical Logic and Formal Languages
    schema:about <http://experiment.worldcat.org/entity/work/data/1104428918#Topic/computation_by_abstract_devices> ; # Computation by Abstract Devices
    schema:about <http://id.worldcat.org/fast/872451> ; # Computer science
    schema:about <http://experiment.worldcat.org/entity/work/data/1104428918#Topic/numerical_analysis> ; # Numerical Analysis
    schema:bookFormat schema:EBook ;
    schema:contributor <http://viaf.org/viaf/85206799> ; # Matthias Jantzen
    schema:creator <http://viaf.org/viaf/101593837> ; # Alain Finkel
    schema:datePublished "1992" ;
    schema:description "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 -- Interval approximations 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."@en ;
    schema:description "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."@en ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/1104428918> ;
    schema:inLanguage "en" ;
    schema:isPartOf <http://worldcat.org/issn/0302-9743> ; # Lecture notes in computer science ;
    schema:isSimilarTo <http://www.worldcat.org/oclc/25246117> ;
    schema:name "STACS 92 : 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992. Proceedings"@en ;
    schema:productID "793077222" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/793077222#PublicationEvent/berlin_heidelberg_springer_berlin_heidelberg_1992> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/1104428918#Agent/springer_berlin_heidelberg> ; # Springer Berlin Heidelberg
    schema:url <http://link.springer.com/10.1007/3-540-55210-3> ;
    schema:url <http://dx.doi.org/10.1007/3-540-55210-3> ;
    schema:workExample <http://worldcat.org/isbn/9783540467755> ;
    schema:workExample <http://worldcat.org/isbn/9783540552109> ;
    schema:workExample <http://dx.doi.org/10.1007/3-540-55210-3> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/793077222> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/1104428918#Agent/springer_berlin_heidelberg> # Springer Berlin Heidelberg
    a bgn:Agent ;
    schema:name "Springer Berlin Heidelberg" ;
    .

<http://experiment.worldcat.org/entity/work/data/1104428918#Place/berlin_heidelberg> # Berlin, Heidelberg
    a schema:Place ;
    schema:name "Berlin, Heidelberg" ;
    .

<http://experiment.worldcat.org/entity/work/data/1104428918#Topic/algorithm_analysis_and_problem_complexity> # Algorithm Analysis and Problem Complexity
    a schema:Intangible ;
    schema:name "Algorithm Analysis and Problem Complexity"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/1104428918#Topic/computation_by_abstract_devices> # Computation by Abstract Devices
    a schema:Intangible ;
    schema:name "Computation by Abstract Devices"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/1104428918#Topic/engineering_&_applied_sciences> # Engineering & Applied Sciences
    a schema:Intangible ;
    schema:name "Engineering & Applied Sciences"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/1104428918#Topic/logics_and_meanings_of_programs> # Logics and Meanings of Programs
    a schema:Intangible ;
    schema:name "Logics and Meanings of Programs"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/1104428918#Topic/mathematical_logic_and_formal_languages> # Mathematical Logic and Formal Languages
    a schema:Intangible ;
    schema:name "Mathematical Logic and Formal Languages"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/1104428918#Topic/numerical_analysis> # Numerical Analysis
    a schema:Intangible ;
    schema:name "Numerical Analysis"@en ;
    .

<http://id.worldcat.org/fast/1002045> # Logic design
    a schema:Intangible ;
    schema:name "Logic design"@en ;
    .

<http://id.worldcat.org/fast/1041273> # Numerical analysis
    a schema:Intangible ;
    schema:name "Numerical analysis"@en ;
    .

<http://id.worldcat.org/fast/868961> # Combinatorial analysis
    a schema:Intangible ;
    schema:name "Combinatorial analysis"@en ;
    .

<http://id.worldcat.org/fast/872451> # Computer science
    a schema:Intangible ;
    schema:name "Computer science"@en ;
    .

<http://id.worldcat.org/fast/872527> # Computer software
    a schema:Intangible ;
    schema:name "Computer software"@en ;
    .

<http://viaf.org/viaf/101593837> # Alain Finkel
    a schema:Person ;
    schema:familyName "Finkel" ;
    schema:givenName "Alain" ;
    schema:name "Alain Finkel" ;
    .

<http://viaf.org/viaf/85206799> # Matthias Jantzen
    a schema:Person ;
    schema:birthDate "1948" ;
    schema:familyName "Jantzen" ;
    schema:givenName "Matthias" ;
    schema:name "Matthias Jantzen" ;
    .

<http://worldcat.org/isbn/9783540467755>
    a schema:ProductModel ;
    schema:isbn "3540467750" ;
    schema:isbn "9783540467755" ;
    .

<http://worldcat.org/isbn/9783540552109>
    a schema:ProductModel ;
    schema:isbn "3540552103" ;
    schema:isbn "9783540552109" ;
    .

<http://worldcat.org/issn/0302-9743> # Lecture notes in computer science ;
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/793077222> ; # STACS 92 : 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992. Proceedings
    schema:issn "0302-9743" ;
    schema:name "Lecture notes in computer science ;" ;
    schema:name "Lecture Notes in Computer Science," ;
    .

<http://www.worldcat.org/oclc/25246117>
    a schema:CreativeWork ;
    rdfs:label "STACS 92" ;
    schema:isSimilarTo <http://www.worldcat.org/oclc/793077222> ; # STACS 92 : 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992. Proceedings
    .

<http://www.worldcat.org/title/-/oclc/793077222>
    a genont:InformationResource, genont:ContentTypeGenericResource ;
    schema:about <http://www.worldcat.org/oclc/793077222> ; # STACS 92 : 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992. Proceedings
    schema:dateModified "2018-10-26" ;
    void:inDataset <http://purl.oclc.org/dataset/WorldCat> ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.