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

• Pubblicazione: Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991
• Edizione: 1st ed. 1991.
• Descrizione fisica: 1 online resource (XIII, 551 p.)
• Disciplina: 004
• Soggetto topico: Computers; Algorithms; Computer logic; Mathematical logic; Combinatorics; Theory of Computation; Computation by Abstract Devices; Algorithm Analysis and Problem Complexity; Logics and Meanings of Programs; Mathematical Logic and Formal Languages
• Persona (resp. second.): ChoffrutChristian; JantzenMatthias
• Note generali: Bibliographic Level Mode of Issuance: Monograph
• Nota di contenuto: Polymorphism, 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.
• Titolo autorizzato: STACS 91
• ISBN: 3-540-47002-6
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: 996465566003316
• Lo trovi qui: Univ. di Salerno
• Serie: Lecture Notes in Computer Science, . 0302-9743 ; ; 480