## STACS 91 [electronic resource] : 8th Annual Symposium on Theoretical Aspects of Computer Science Hamburg, Germany, February 14–16, 1991 Proceedings / edited by Christian Choffrut, Matthias Jantzen.

Material type: TextLanguage: English Series: Lecture Notes in Computer Science: 480Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1991Description: XIII, 551 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540470021Subject(s): Computer science | Computer Communication Networks | Computer software | Logic design | Combinatorics | Computer Science | Computation by Abstract Devices | Algorithm Analysis and Problem Complexity | Logics and Meanings of Programs | Mathematical Logic and Formal Languages | Combinatorics | Computer Communication NetworksAdditional physical formats: Printed edition:: No titleDDC classification: 004.0151 LOC classification: QA75.5-76.95Online resources: Click here to access onlinePolymorphism, parameterization and typing: An algebraic specification perspective -- Executable higher-order algebraic specifications -- Efficient memory access in large-scale computation -- l-occurrences of avoidable patterns -- Rational relations with bounded delay -- On the power of several queues -- On aperiodic trace languages -- Recognizable and rational languages of finite and infinite traces -- On the concatenation of infinite traces -- Tight RNC approximations to Max Flow -- A natural metric for curves — Computing the distance for polygonal chains and approximation algorithms -- The worst case complexity of MC Diarmid and Reed's variant of BOTTOM-UP-HEAT SORT is less than n log n+1.1n -- Decision problems for term rewriting systems and recognizable tree languages -- Decidable sentences for context-free groups -- The owner concept for PRAMs -- Actors as a parallel programming model -- Average case analysis of unification algorithms -- Methodology for proving the termination of logic programs -- Polynomial size constant depth circuits with a limited number of negations -- Randomized polynomials, threshold circuits, and the polynomial hierarchy -- Computationally convincing proofs of knowledge -- Interactive proof systems and alternating time-space complexity -- Optimal tradeoffs between time and bit complexity in distributed synchronous rings -- Unconditional Byzantine Agreement with good majority -- A new compacting garbage-collection algorithm with a good average-case performance -- Bisimulation and action refinement -- Testing for unboundedness of Fifo channels -- Detection of deadlocks in an infinite family of nets -- Nondeterminism within P -- Structure and importance of logspace-MOD-classes -- Complexity classification of Truth Maintenance systems -- Reachability in reversible Free Choice systems -- Compositional generation of home states in free choice systems -- Bounded reductions -- Functional oracle queries as a measure of parallel time -- Optimal parallel recognition of bracket languages on hypercubes -- Constant queue routing on a mesh -- The complexity of the max word problem -- The expressive power of second order Horn logic -- Tight bounds on the path length of binary trees -- The random testability of the n-input AND gate -- An observational subset of first-order logic cannot specify the behaviour of a counter (extended abstract) -- Unfolding, procedural and fixpoint semantics of logic programs -- A modal semantics for the negation as failure and the closed world assumption rules -- The relview-system -- Geometry models design system ?POM -- The prospectra system -- Prototype of a verification tool -- IPG — An interactive parser generator -- A placement system for constrained blocks with flexible shapes -- Algebraic programm interpreter APREX2.

There are no comments on this title.