skip to content
STACS 84 : Symposium of Theoretical Aspects of Computer Science Paris, 11-13, 1984 Preview this item
ClosePreview this item
Checking...

STACS 84 : Symposium of Theoretical Aspects of Computer Science Paris, 11-13, 1984

Author: M Fontet; K Mehlhorn
Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1984.
Series: Lecture notes in computer science, 166.
Edition/Format:   eBook : Document : EnglishView all editions and formats
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

Genre/Form: Electronic books
Additional Physical Format: Printed edition
Material Type: Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: M Fontet; K Mehlhorn
ISBN: 9783540129202 3540129200 9783540388050 3540388052
OCLC Number: 851818274
Description: 1 online resource (338 pages).
Contents: Key-problems and key-methods in computational geometry --
Some recent results on squarefree words --
Transformations realizing fairness assumptions for parallel programs --
Computing the largest empty rectangle --
Approximation schemes for covering and packing problems in robotics and vlsi --
Covering polygons with minimum number of rectangles --
On expressive interpretations of a Hoare-logic for Clarke's language L4 --
Towards executable specifications using conditional axioms --
Proprietes Church-Rosser de systemes de reecriture equationnels ayant la propriete de terminaison faible --
On a general weight of trees --
From expanders to better superconcentrators without cascading --
Locally synchronous complexity in the light of the trans-box method --
A new definition of morphism on Petri nets --
Blocage et vivacité dans les réseaux a pile-file --
Denotational semantics of concurrent programs with shared memory --
Higher order data structures --
Computability in higher types and the universal domain P? --
On the structure of polynomial time degrees --
Optimal layouts of the tree of meshes with vertices on the perimeter of the bounding convex region --
Efficient simulations among several models of parallel computers (extended abstract) --
Bornes inferieures sur la complexite des facteurs des mots infinis engendres par morphismes iteres --
Adherence equivalence is decidable for DOL languages --
Pusdown space complexity and related full-A.F.L.s. --
Automates a pile sur des alphabets infinis --
Logic programs and many-valued logic --
Algebre de machines et logique temporelle --
Algebraic and topological theory of languages and computation --
A property of three-element codes --
Polynomial time inference of general pattern languages --
On extendibility of unavoidable sets.
Series Title: Lecture notes in computer science, 166.
Other Titles: Sponsored by AFCET (Association Francaise pour la Cybern; & AAe;tique Economique et Technique) and GI (Gesellschaft für Informatik)
Responsibility: edited by M. Fontet, K. Mehlhorn.

Reviews

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

Tags

Be the first.

Similar Items

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/851818274> # STACS 84 : Symposium of Theoretical Aspects of Computer Science Paris, 11-13, 1984
    a schema:MediaObject, schema:CreativeWork, schema:Book ;
   library:oclcnum "851818274" ;
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/gw> ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/892413207#Place/berlin_heidelberg> ; # Berlin, Heidelberg
   schema:about <http://id.worldcat.org/fast/1002045> ; # Logic design
   schema:about <http://id.worldcat.org/fast/872451> ; # Computer science
   schema:about <http://id.worldcat.org/fast/872527> ; # Computer software
   schema:about <http://dewey.info/class/005.1/e23/> ;
   schema:alternateName "Sponsored by AFCET (Association Francaise pour la Cybern; & AAe;tique Economique et Technique) and GI (Gesellschaft für Informatik)" ;
   schema:bookFormat schema:EBook ;
   schema:contributor <http://viaf.org/viaf/67022101> ; # K. Mehlhorn
   schema:creator <http://viaf.org/viaf/91717699> ; # M. Fontet
   schema:datePublished "1984" ;
   schema:description "Key-problems and key-methods in computational geometry -- Some recent results on squarefree words -- Transformations realizing fairness assumptions for parallel programs -- Computing the largest empty rectangle -- Approximation schemes for covering and packing problems in robotics and vlsi -- Covering polygons with minimum number of rectangles -- On expressive interpretations of a Hoare-logic for Clarke's language L4 -- Towards executable specifications using conditional axioms -- Proprietes Church-Rosser de systemes de reecriture equationnels ayant la propriete de terminaison faible -- On a general weight of trees -- From expanders to better superconcentrators without cascading -- Locally synchronous complexity in the light of the trans-box method -- A new definition of morphism on Petri nets -- Blocage et vivacité dans les réseaux a pile-file -- Denotational semantics of concurrent programs with shared memory -- Higher order data structures -- Computability in higher types and the universal domain P? -- On the structure of polynomial time degrees -- Optimal layouts of the tree of meshes with vertices on the perimeter of the bounding convex region -- Efficient simulations among several models of parallel computers (extended abstract) -- Bornes inferieures sur la complexite des facteurs des mots infinis engendres par morphismes iteres -- Adherence equivalence is decidable for DOL languages -- Pusdown space complexity and related full-A.F.L.s. -- Automates a pile sur des alphabets infinis -- Logic programs and many-valued logic -- Algebre de machines et logique temporelle -- Algebraic and topological theory of languages and computation -- A property of three-element codes -- Polynomial time inference of general pattern languages -- On extendibility of unavoidable sets."@en ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/892413207> ;
   schema:genre "Electronic books"@en ;
   schema:inLanguage "en" ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/892413207#Series/lecture_notes_in_computer_science> ; # Lecture notes in computer science ;
   schema:isPartOf <http://worldcat.org/issn/0302-9743> ; # Lecture Notes in Computer Science,
   schema:isSimilarTo <http://worldcat.org/entity/work/data/892413207#CreativeWork/> ;
   schema:name "STACS 84 : Symposium of Theoretical Aspects of Computer Science Paris, 11-13, 1984"@en ;
   schema:productID "851818274" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/851818274#PublicationEvent/berlin_heidelberg_springer_berlin_heidelberg_1984> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/892413207#Agent/springer_berlin_heidelberg> ; # Springer Berlin Heidelberg
   schema:url <http://link.springer.com/10.1007/3-540-12920-0> ;
   schema:url <http://link.springer.com/openurl?genre=book&isbn=978-3-540-12920-2> ;
   schema:url <http://dx.doi.org/10.1007/3-540-12920-0> ;
   schema:workExample <http://worldcat.org/isbn/9783540388050> ;
   schema:workExample <http://worldcat.org/isbn/9783540129202> ;
   schema:workExample <http://dx.doi.org/10.1007/3-540-12920-0> ;
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/851818274> ;
    .


Related Entities

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

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

<http://experiment.worldcat.org/entity/work/data/892413207#Series/lecture_notes_in_computer_science> # Lecture notes in computer science ;
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/851818274> ; # STACS 84 : Symposium of Theoretical Aspects of Computer Science Paris, 11-13, 1984
   schema:name "Lecture notes in computer science ;" ;
    .

<http://id.worldcat.org/fast/1002045> # Logic design
    a schema:Intangible ;
   schema:name "Logic design"@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://link.springer.com/10.1007/3-540-12920-0>
   rdfs:comment "from Springer" ;
   rdfs:comment "(Unlimited Concurrent Users)" ;
    .

<http://viaf.org/viaf/67022101> # K. Mehlhorn
    a schema:Person ;
   schema:familyName "Mehlhorn" ;
   schema:givenName "K." ;
   schema:name "K. Mehlhorn" ;
    .

<http://viaf.org/viaf/91717699> # M. Fontet
    a schema:Person ;
   schema:familyName "Fontet" ;
   schema:givenName "M." ;
   schema:name "M. Fontet" ;
    .

<http://worldcat.org/entity/work/data/892413207#CreativeWork/>
    a schema:CreativeWork ;
   schema:description "Printed edition" ;
   schema:isSimilarTo <http://www.worldcat.org/oclc/851818274> ; # STACS 84 : Symposium of Theoretical Aspects of Computer Science Paris, 11-13, 1984
    .

<http://worldcat.org/isbn/9783540129202>
    a schema:ProductModel ;
   schema:isbn "3540129200" ;
   schema:isbn "9783540129202" ;
    .

<http://worldcat.org/isbn/9783540388050>
    a schema:ProductModel ;
   schema:isbn "3540388052" ;
   schema:isbn "9783540388050" ;
    .

<http://worldcat.org/issn/0302-9743> # Lecture Notes in Computer Science,
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/851818274> ; # STACS 84 : Symposium of Theoretical Aspects of Computer Science Paris, 11-13, 1984
   schema:issn "0302-9743" ;
   schema:name "Lecture Notes in Computer Science," ;
    .

<http://www.worldcat.org/title/-/oclc/851818274>
    a genont:InformationResource, genont:ContentTypeGenericResource ;
   schema:about <http://www.worldcat.org/oclc/851818274> ; # STACS 84 : Symposium of Theoretical Aspects of Computer Science Paris, 11-13, 1984
   schema:dateModified "2018-03-10" ;
   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.