Theoretical computer science : 6th GI-conference, Dortmund, January 5-7, 1983
Uloženo v:
| Korporativní autor: | |
|---|---|
| Další autoři: | , |
| Médium: | Livre numérique |
| Jazyk: | Anglais Français |
| Vydáno: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Edice: | Lecture notes in computer science
145 |
| Témata: | |
| On-line přístup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Poznámka: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Theoretical computer science, 6th GI-conference, Dortmund, January 5-7, 1983, 1982, Berlin, Springer-Verlag, 1 vol. (X-366 p.), Lecture notes in computer science, 3-540-11973-6 • Theoretical Computer Science, Texte imprimé, 9783662189313 |
| LEADER | 04222nam a22003857a 4500 | ||
|---|---|---|---|
| 001 | 944067 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155173685 | ||
| 020 | |a 9783540394211 (PDF) | ||
| 041 | 0 | |a eng |a fre | |
| 082 | |a 001.6401 | ||
| 082 | |a 004 | ||
| 111 | 2 | |a GI symposium on theoretical computer science |n (6 |d :1983 |c :Dortmund, Allemagne). | |
| 245 | 1 | 0 | |a Theoretical computer science : |b 6th GI-conference, Dortmund, January 5-7, 1983 |c edited by A.B. Cremers and H.P. Kriegel. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 145 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Partial functions in comstructive formal theories -- A Monte Carlo factoring algorithm with finite storage -- Theory of concurrency control -- Interprocedural data flow systems -- On the crossing-free, rectangular embedding of weighted graphs in the plane -- Discreteness, K-density and D-continuity of occurrence nets -- Controlled relativizations of P and NP -- The computational complexity of certain graph grammars -- Inconsistencies of pure LISP -- FIFO nets: A new model of parallel computation -- Une extension aux mots infinis de la notion de transduction rationnelle -- Algebraic and operational semantics of exceptions and errors -- The expected number of nodes and leaves at level k in ordered trees -- Complexity theory on real numbers and functions -- A multifit algorithm for uniform multiprocessor scheduling -- Analysis of polynomial approximation algorithms for constraint expressions -- Heuristics for minimum edge length rectangular partitions of rectilinear figures -- An axiomatic approach to semantics of specification languages -- Efficiency of universal parallel computers -- Coroutines and processes in block structured languages -- A general scheme for some deterministically parsable grammars and their strong equivalents -- A decidability result about sufficient-completeness of axiomatically specified abstract data types -- Two remarks on the power of counting -- Some operations and transductions that preserve rationality -- On algebras of computation sequences and proofs of equivalence of operational and denotational semantics -- Sur les morphismes qui engendrent des mots infinis ayant des facteurs prescrits -- The equivalence problem for N.T.S. languages is deoidable -- Weakest expressible preconditions: A new tool for proving completeness results about Hoare calculi -- A hierarchy of sets of infinite trees -- Maintaining order in a generalized linked list -- Periodic versus arbitrary tessellations of the plane using polyominos of a single type. | |
| 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 Cremers, Armin B., |d 1946- |4 pbd | |
| 700 | 1 | |a Kriegel, Hans-Peter. |4 pbd | |
| 776 | 0 | |0 024977268 |t Theoretical computer science |f 6th GI-conference, Dortmund, January 5-7, 1983 |d 1982 |c Berlin |n Springer-Verlag |p 1 vol. (X-366 p.) |s Lecture notes in computer science |z 3-540-11973-6 | |
| 776 | 0 | |t Theoretical Computer Science |b Texte imprimé |z 9783662189313 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/BFb0036464 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-420VZH78-B |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747923086 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/BFb0036464 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750935375 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/BFb0036464 |z Accès INSA CVL | |
| 997 | |0 944067 |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/ | ||