skip to content
STACS 87 : 4th Annual Symposium on Theoretical Aspects of Computer Science, Passau, Federal Republic of Germany, February 19-21, 1987, proceedings Preview this item
ClosePreview this item

STACS 87 : 4th Annual Symposium on Theoretical Aspects of Computer Science, Passau, Federal Republic of Germany, February 19-21, 1987, proceedings

Author: F J Brandenburg; G Vidal-Naquet; M Wirsing
Publisher: Berlin ; New York : Springer-Verlag, ©1987.
Series: Lecture notes in computer science, 247.
Edition/Format:   Book : Document : Conference publication   Computer File : EnglishView all editions and formats

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

More like this


Find a copy in the library

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


Genre/Form: Conference proceedings
Additional Physical Format: (OCoLC)15224433
Material Type: Conference publication, Document
Document Type: Book, Computer File
All Authors / Contributors: F J Brandenburg; G Vidal-Naquet; M Wirsing
ISBN: 038717219X 9780387172194 9783540172192 354017219X
OCLC Number: 321377105
Reproduction Notes: Electronic reproduction. Mode of access: World Wide Web.
Description: x, 483 p. : ill. ; 24 cm.
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, 247.
Responsibility: edited by F.J. Brandenburg, G. Vidal-Naquet, and M. Wirsing.
More information:


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


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

schema:name"Symposium on Theoretical Aspects of Computer Science 1987 : Passau, Germany)"
schema:genre"Conference proceedings"
schema:genre"Conference proceedings."
schema:name"STACS 87 4th Annual Symposium on Theoretical Aspects of Computer Science, Passau, Federal Republic of Germany, February 19-21, 1987, proceedings"

Content-negotiable representations

Close Window

Please sign in to WorldCat 

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