Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
STACS 90 [[electronic resource] ] : 7th Annual Symposium on Theoretical Aspects of Computer Science. Rouen, France, February 22-24, 1990. Proceedings / / edited by Christian Choffrut, Thomas Lengauer
| STACS 90 [[electronic resource] ] : 7th Annual Symposium on Theoretical Aspects of Computer Science. Rouen, France, February 22-24, 1990. Proceedings / / edited by Christian Choffrut, Thomas Lengauer |
| Edizione | [1st ed. 1990.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1990 |
| Descrizione fisica | 1 online resource (X, 318 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Algorithms Computer logic Mathematical logic Theory of Computation Computation by Abstract Devices Algorithm Analysis and Problem Complexity Logics and Meanings of Programs Mathematical Logic and Formal Languages |
| ISBN | 3-540-46945-1 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A note on the almost-everywhere hierarchy for nondeterministic time -- The ring of k-regular sequences -- Minimal pairs and complete problems -- Hiding instances in multioracle queries -- Counting classes: Thresholds, parity, mods, and fewness -- Playing games of incomplete information -- Caterpillars and context-free languages -- Semi-commutations and algebraic languages -- Towards a process semantics in the logic programming style -- Parallel computations on strings and arrays -- Minimum vertex hulls for polyhedral domains -- Combinatorial rewriting on traces -- Kolmogorov complexity, restricted nondeterminism and generalized spectra -- Relation-sorted algebraic specifications with built-in coercers: Basic notions and results -- Computational power of one-way multihead finite automata -- Updating almost complete trees or one level makes all the difference -- Sorting the sums (xi+yj) in O(n2) comparisons -- Efficient checking of computations -- Hard promise problems and nonuniform complexity -- On the construction of abstract voronoi diagrams -- Approximation of convex figures by pairs of rectangles -- Nonblocking graphs: Greedy algorithms to compute disjoint paths -- Infinite trees and automaton definable relations over ?-words -- Enumerative Combinatorics and Computer Science -- Failures semantics based on interval semiwords is a congruence for refinement -- The analysis of local search problems and their heuristics. |
| Record Nr. | UNISA-996465613103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1990 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
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
| 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 |
| Edizione | [1st ed. 1991.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 |
| Descrizione fisica | 1 online resource (XIII, 551 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| 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 |
| ISBN | 3-540-47002-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| 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. |
| Record Nr. | UNISA-996465566003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||