STACS 91 - neues Buch

EAN (ISBN-13): 9783540470021
Herausgeber: Springer Science+Business Media

Buch in der Datenbank seit 2017-06-04T12:06:54+02:00 (Zurich)
Detailseite zuletzt geändert am 2021-10-27T13:30:36+02:00 (Zurich)
ISBN/EAN: 9783540470021

ISBN - alternative Schreibweisen:
978-3-540-47002-1
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: matthias

---

Daten vom Verlag:

Autor/in: Christian Choffrut; Matthias Jantzen
Titel: Lecture Notes in Computer Science; STACS 91 - 8th Annual Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, February 14-16, 1991. Proceedings
Verlag: Springer; Springer Berlin
551 Seiten
Erscheinungsjahr: 2005-11-13
Berlin; Heidelberg; DE
Sprache: Englisch
96,29 € (DE)
99,00 € (AT)
118,00 CHF (CH)
Available
XIII, 551 p.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Algorithms; Algorithmus; Computational Geometry; Concurrency; Geometrische Algorithmen; Random Access Memory; Theoretical Computer Science; Theoretische Informatik; Verteilte Verarbeitung; algorithm; complexity; computer science; logic; semantics; verification; algorithm analysis and problem complexity; combinatorics; C; Theory of Computation; Algorithms; Computer Science Logic and Foundations of Programming; Formal Languages and Automata Theory; Discrete Mathematics; Computer Science; Algorithmen und Datenstrukturen; Diskrete Mathematik; BC

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