| Description |
1 online resource : v.: digital |
| Series |
Lecture Notes in Computer Science, 0302-9743 ; 480 |
|
Lecture notes in computer science ; 480. 0302-9743
|
| Contents |
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 |
| Subject |
Computer science.
|
|
Computer Communication Networks
|
|
Computer software.
|
|
Logic design.
|
|
Combinatorial analysis.
|
|
Electronic Data Processing
|
|
Software
|
|
software.
|
|
Combinatorial analysis
|
|
Computer science
|
|
Computer software
|
|
Logic design
|
| Form |
Electronic book
|
| Author |
Choffrut, Christian.
|
|
Jantzen, Matthias, 1948-
|
| ISBN |
9783540470021 |
|
3540470026 |
|
