STACS 87 : 4th Annual Symposium on theoretical aspects of computer science, Passau, Federal Republic of Germany, February 19 21, 1987 : proceedings
Kaydedildi:
| Müşterek Yazar: | |
|---|---|
| Diğer Yazarlar: | , , |
| Materyal Türü: | Livre numérique |
| Dil: | Anglais |
| Baskı/Yayın Bilgisi: |
Berlin ; Heidelberg :
Springer-Verlag : Springer e-books
[20..].
Cham : Springer Nature |
| Seri Bilgileri: | Lecture notes in computer science
247 |
| Konular: | |
| Online Erişim: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Not: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • STACS 87, 4th Annual Symposium on Theoretical Aspects of Computer Science, Passau, Federal Republic of Germany, February 19-21, 1987, proceedings, edited by F.J. Brandenburg, G. Vidal-Naquet, and M. Wirsing, 1987, Berlin, Springer-Verlag, 1 volume (X-483 p.), Lecture notes in computer science, 0-387-17219-X • STACS 87, Texte imprimé, 9783662170397 |
| LEADER | 05526nam a22003857a 4500 | ||
|---|---|---|---|
| 001 | 945390 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN15522574X | ||
| 020 | |a 9783540474197 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 111 | 2 | |a Annual Symposium on Theoretical Aspects of Computer Science |n (04 |d :1987 |c :Passau, Allemagne). | |
| 245 | 1 | 0 | |a STACS 87 : |b 4th Annual Symposium on theoretical aspects of computer science, Passau, Federal Republic of Germany, February 19 21, 1987 : proceedings |c edited by F. J. Brandenburg, G. Vidal-Naquet and M. Wirsing. |
| 260 | |a Berlin ; |a Heidelberg : |b Springer-Verlag : |b Springer e-books. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 247 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Towards a theory of relativizations: Positive relativizations -- Natural semantics -- On local routing of two-terminal nets -- Geometric relations among Voronoi diagrams -- Finding the largest empty rectangle on a grated surface -- Efficient graph algorithms using limited communication on a fixed-size array of processors -- On selecting the largest element in spite of erroneous information -- The correlation between the complexities of the non-hierarchical and hierarchical versions of graph problems -- Graph isomorphism is in the low hierarchy -- A hierarchy theorem for almost everywhere complex sets with application to polynomial complexity degrees -- Self-reducibility -- Probability one separation of the Boolean hierarchy -- Reversal complexity of multicounter and multihead machines -- Computing the counting function of context-free languages -- On the k-freeness of morphisms on free monoids -- Avoidable patterns on 2 letters -- Polynomial operations on rational languages -- Some structural aspects of hypergraph languages generated by hyperedge replacement -- Specification and implementation of concurrently accessed data structures: An abstract data type approach -- On implementations of loose abstract data type specifications and their vertical composition -- Are homomorphisms sufficient for behavioural implementations of deterministic and nondeterministic data types? -- Some remarks on presentations by finite Church-Rosser Thue systems -- Ground term confluence in parametric conditional equational specifications -- Describing semantic domains with sprouts -- Comparing direct and continuation semantics styles for concurrent languages -- Expressibility of first order logic with a nondeterministic inductive operator -- Bounded nondeterminism and the approximation induction principle in processalgebra -- The step failure semantics -- On the complexity of containment, equivalence, and reachability for finite and 2-dimensional vector addition systems with states -- Closure properties of deterministic Petri nets -- Some results on fairness: The regular case -- Decidability questions for fairness in Petri nets -- Optimal sorting on multi-dimensionally mesh-connected computers -- On the contact-minimization-problem -- Making distributed spanning tree algorithms fault-resilient -- The derivation of on-the-fly garbage collection algorithms from distributed termination detection protocols -- On the expected complexity of distributed selection -- LPG: A generic, logic and functional programming language -- CEC -- ASSPEGIQUE -- REVEUR4 : A laboratory for conditional rewriting -- An interactive, incremental and portable computer algebra system for ?-calculus and combinatory logic based on video edition and rewriting techniques -- The Passau RAP System: Rapid prototyping for algebraic specifications -- SPRAC: A software engineering environment -- SLOG: A logic interpreter for equational clauses -- An algebraic transformation system for occam programs -- REVE a rewrite rule laboratory. | |
| 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 Actes de congrès | ||
| 700 | 1 | |a Wirsing, Martin, |d 1948- |4 pbd | |
| 700 | 1 | |a Vidal-Naquet, Guy, |d 1946- |4 pbd | |
| 700 | 1 | |a Brandenburg, Franz J. |4 pbd | |
| 776 | 0 | |0 020148909 |t STACS 87 |o 4th Annual Symposium on Theoretical Aspects of Computer Science, Passau, Federal Republic of Germany, February 19-21, 1987, proceedings |f edited by F.J. Brandenburg, G. Vidal-Naquet, and M. Wirsing |d 1987 |c Berlin |n Springer-Verlag |p 1 volume (X-483 p.) |s Lecture notes in computer science |z 0-387-17219-X | |
| 776 | 0 | |t STACS 87 |b Texte imprimé |z 9783662170397 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/BFb0039590 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-CZ1F4WHR-C |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747910936 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/BFb0039590 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750923814 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/BFb0039590 |z Accès INSA CVL | |
| 997 | |0 945390 |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/ | ||