STACS 91 : 8th Annual Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, February 14 16, 1991 : proceedings
Sábháilte in:
| Údar corparáideach: | |
|---|---|
| Rannpháirtithe: | , |
| Formáid: | Livre numérique |
| Teanga: | Anglais |
| Foilsithe / Cruthaithe: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Sraith: | Lecture notes in computer science
480 |
| Ábhair: | |
| Rochtain ar líne: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nóta: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • STACS 91, 8th Annual Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, February 14-16, 1991, proceedings, C. Choffrut, M. Jantzen, eds, Berlin, Springer-Verlag, 1991, 1 vol. (X-548 p.), Lecture notes in computer science, 0-387-53709-0 • STACS 91, Texte imprimé, 9783662213735 |
| LEADER | 05255nam a22004097a 4500 | ||
|---|---|---|---|
| 001 | 944159 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155177095 | ||
| 020 | |a 9783540470021 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 111 | 2 | |a Annual Symposium on Theoretical Aspects of Computer Science |n (08 |d :1991 |c :Hambourg). | |
| 245 | 1 | 0 | |a STACS 91 : |b 8th Annual Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, February 14 16, 1991 : proceedings |c [edited by] C. Choffrut, M. Jantzen. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 480 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a 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. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 650 | |a Informatique | ||
| 650 | |a Algorithmes | ||
| 650 | |a Réseaux d'ordinateurs | ||
| 650 | |a Logique symbolique et mathématique | ||
| 650 | |a Analyse combinatoire | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Jantzen, Matthias, |d 1948- |4 pbd | |
| 700 | 1 | |a Choffrut, Christian. |4 pbd | |
| 776 | 0 | |0 021880212 |t STACS 91 |o 8th Annual Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, February 14-16, 1991, proceedings |f C. Choffrut, M. Jantzen, eds |c Berlin |n Springer-Verlag |d 1991 |p 1 vol. (X-548 p.) |s Lecture notes in computer science |z 0-387-53709-0 | |
| 776 | 0 | |t STACS 91 |b Texte imprimé |z 9783662213735 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/BFb0020782 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-XSZ64SKX-J |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747922195 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/BFb0020782 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750934573 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/BFb0020782 |z Accès INSA CVL | |
| 997 | |0 944159 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||