skip to content
Stacs 87. Preview this item
ClosePreview this item

Stacs 87.

Author: Franz J Brandenburg; Guy Vidal-Naquet; Martin Wirsing
Publisher: New York : Springer Oct. 2007.
Series: Lecture Notes in Computer Science Ser.
Edition/Format:   eBook : Document : EnglishView all editions and formats

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

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...


Material Type: Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: Franz J Brandenburg; Guy Vidal-Naquet; Martin Wirsing
ISBN: 9783540172192 354017219X
OCLC Number: 466133171
Description: 1 online resource (500 pages).
Contents: Towards a theory of relativizations: Positive relativizations.- Natural semantics.- On local routing of two-terminal nets.- Geometric relations among Voronoi diagrams.- Finding the largest empty rectangle on a grated surface.- Efficient graph algorithms using limited communication on a fixed-size array of processors.- On selecting the largest element in spite of erroneous information.- The correlation between the complexities of the non-hierarchical and hierarchical versions of graph problems.- Graph isomorphism is in the low hierarchy.- A hierarchy theorem for almost everywhere complex sets with application to polynomial complexity degrees.- Self-reducibility.- Probability one separation of the Boolean hierarchy.- Reversal complexity of multicounter and multihead machines.- Computing the counting function of context-free languages.- On the k-freeness of morphisms on free monoids.- Avoidable patterns on 2 letters.- Polynomial operations on rational languages.- Some structural aspects of hypergraph languages generated by hyperedge replacement.- Specification and implementation of concurrently accessed data structures: An abstract data type approach.- On implementations of loose abstract data type specifications and their vertical composition.- Are homomorphisms sufficient for behavioural implementations of deterministic and nondeterministic data types?.- Some remarks on presentations by finite Church-Rosser Thue systems.- Ground term confluence in parametric conditional equational specifications.- Describing semantic domains with sprouts.- Comparing direct and continuation semantics styles for concurrent languages.- Expressibility of first order logic with a nondeterministic inductive operator.- Bounded nondeterminism and the approximation induction principle in process algebra.- The step failure semantics.- On the complexity of containment, equivalence, and reachability for finite and 2-dimensional vector addition systems with states.- Closure properties of deterministic Petri nets.- Some results on fairness: The regular case.- Decidability questions for fairness in Petri nets.- Optimal sorting on multi-dimensionally mesh-connected computers.- On the contact-minimization-problem.- Making distributed spanning tree algorithms fault-resilient.- The derivation of on-the-fly garbage collection algorithms from distributed termination detection protocols.- On the expected complexity of distributed selection.- LPG: A generic, logic and functional programming language.- CEC.- ASSPEGIQUE.- REVEUR4 : A laboratory for conditional rewriting.- An interactive, incremental and portable computer algebra system for ?-calculus and combinatory logic based on video edition and rewriting techniques.- The Passau RAP System: Rapid prototyping for algebraic specifications.- SPRAC: A software engineering environment.- SLOG: A logic interpreter for equational clauses.- An algebraic transformation system for occam programs.- REVE a rewrite rule laboratory.
Series Title: Lecture Notes in Computer Science Ser.


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


Be the first.

Similar Items

Related Subjects:(2)

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

<> # Stacs 87.
    a schema:CreativeWork, schema:Book, schema:MediaObject ;
   library:oclcnum "466133171" ;
   library:placeOfPublication <> ;
   library:placeOfPublication <> ; # New York
   schema:about <> ; # Computer science
   schema:about <> ; # Computer Science
   schema:bookFormat schema:EBook ;
   schema:datePublished "Oct. 2007" ;
   schema:editor <> ; # Guy Vidal-Naquet
   schema:editor <> ; # Martin Wirsing
   schema:editor <> ; # Franz J. Brandenburg
   schema:exampleOfWork <> ;
   schema:inLanguage "en" ;
   schema:isPartOf <> ; # Lecture Notes in Computer Science Ser.
   schema:name "Stacs 87."@en ;
   schema:productID "466133171" ;
   schema:publication <> ;
   schema:publisher <> ; # Springer
   schema:url <> ;
   schema:workExample <> ;
   wdrs:describedby <> ;

Related Entities

<> # New York
    a schema:Place ;
   schema:name "New York" ;

<> # Franz J. Brandenburg
    a schema:Person ;
   schema:familyName "Brandenburg" ;
   schema:givenName "Franz J." ;
   schema:name "Franz J. Brandenburg" ;

<> # Guy Vidal-Naquet
    a schema:Person ;
   schema:familyName "Vidal-Naquet" ;
   schema:givenName "Guy" ;
   schema:name "Guy Vidal-Naquet" ;

<> # Martin Wirsing
    a schema:Person ;
   schema:familyName "Wirsing" ;
   schema:givenName "Martin" ;
   schema:name "Martin Wirsing" ;

<> # Lecture Notes in Computer Science Ser.
    a bgn:PublicationSeries ;
   schema:hasPart <> ; # Stacs 87.
   schema:name "Lecture Notes in Computer Science Ser." ;

<> # Computer science
    a schema:Intangible ;
   schema:name "Computer science"@en ;

    a schema:ProductModel ;
   schema:isbn "354017219X" ;
   schema:isbn "9783540172192" ;

Content-negotiable representations

Close Window

Please sign in to WorldCat 

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