Mathematical foundations of computer science 1981 : proceedings, 10th symposium, Štrbské Pleso, Czechoslovakia, August 31-September 4, 1981
Uloženo v:
| Korporativní autor: | |
|---|---|
| Další autoři: | , |
| Médium: | Livre numérique |
| Jazyk: | Anglais |
| Vydáno: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Edice: | Lecture notes in computer science
118 |
| 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: | • Mathematical foundations of computer science 1981, proceedings, 10th symposium, Štrbské Pleso, Czechoslovakia, August 31-September 4, 1981, edited by J. Gruska and M. Chytil, Berlin, Springer-Verlag, 1981, 1 vol. (XI-589 p.), Lecture notes in computer science, 0-387-10856-4 • Mathematical Foundations of Computer Science 1981, Texte imprimé, 9783662209301 |
| LEADER | 05775nam a22004217a 4500 | ||
|---|---|---|---|
| 001 | 945412 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155226460 | ||
| 020 | |a 9783540387695 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 082 | |a 511 | ||
| 111 | 2 | |a Symposium on mathematical foundations of computer science |n (10 |d :1981 |c :Strbské Pleso, Slovaquie). | |
| 245 | 1 | 0 | |a Mathematical foundations of computer science 1981 : |b proceedings, 10th symposium, Štrbské Pleso, Czechoslovakia, August 31-September 4, 1981 |c edited by J. Gruska and M. Chytil. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 118 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a The complexity of manipulating hierarchically defined sets of rectangles -- The transformational machine: Theme and variations -- Probabilistic two-way machines -- A survey of some recent results on computational complexity in weak theories of arithmetic -- A survey on oracle techniques -- Time and space bounded complexity classes and bandwidth constrained problems -- Representations of graphs by means of products and their complexity -- Parsing strategies: A concise survey -- The art of dynamizing -- Fast parallel computation of polynomials using few processors -- Generalizations of Petri nets -- Partial match retrieval in implicit data structures -- A characterization of Floyd-provable programs -- Semantics of CSP via translation into CCS -- More about the "geography" of context-free languages -- On the power of algebraic specifications -- An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages -- On the complexity of word problems in certain Thue systems -- On the transformation of derivation graphs to derivation trees -- Pushdown automata with restricted use of storage symbols -- Structured nets -- Retraceability, repleteness and busy beaver sets -- Combining T and level-N -- On realization and implementation -- Multiplicative complexity of a bilinear form over a commutative ring -- Making dynamic logic first-order -- Partial interpretations of program schemata -- Closure properties of the family of languages recognized by one-way two-head deterministic finite state automata -- Another hierarchy defined by multihead finite automata -- An extension of Rabin's complete proof concept -- How to find invariants for coloured Petri nets -- Relationships between probabilistic and deterministic tape complexity -- Grammatical levels of the position restricted grammars -- A general framework for comparing sequential and parallel rewriting -- A bin packing algorithm with complexity O(n log n) and performance 1 in the stochastic limit -- Codings of nonnegative integers -- The maximum k-flow in a network -- On the constructive description of graph languages accepted by finite automata -- Weighted multidimensional B-trees used as nearly optimal dynamic dictionaries -- Maximum flow in planar networks -- Probabilistic combinatorial optimization -- Time-processor trade-offs for universal parallel computers -- Negative results on the size of deterministic right parsers -- Key-equivalence of functional dependency statements systems -- On representation of dynamic algebras with reversion -- A framework for studying grammars -- On existence of complete predicate calculus in metamathematics without exponentiation -- On structural similarity of context-free grammars -- Axioms for the term-wise correctness of programs -- Complexity and entropy -- Axiomatic semantics of indirect addressing -- Testing of join dependency preserving by a modified chase method -- A starvation-free solution of the dining philosophers' problem by use of interaction systems -- Admissible representations of effective cpo's -- Preserving total order in constant expected time -- Constructive category theory (No. 1) -- Two pebbles don't suffice. | |
| 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 Langages formels | ||
| 650 | |a Algorithmes | ||
| 650 | |a Automates mathématiques, Théorie des | ||
| 650 | |a Complexité de calcul (informatique) | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Gruska, Jozef, |d 1933- |4 pbd | |
| 700 | 1 | |a Chytil, Michal, |d 1949- |4 pbd | |
| 776 | 0 | |0 02428680X |t Mathematical foundations of computer science 1981 |o proceedings, 10th symposium, Štrbské Pleso, Czechoslovakia, August 31-September 4, 1981 |f edited by J. Gruska and M. Chytil |c Berlin |n Springer-Verlag |d 1981 |p 1 vol. (XI-589 p.) |s Lecture notes in computer science |z 0-387-10856-4 | |
| 776 | 0 | |t Mathematical Foundations of Computer Science 1981 |b Texte imprimé |z 9783662209301 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-10856-4 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-TNZMZMGQ-9 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747910766 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-10856-4 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750923644 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-10856-4 |z Accès INSA CVL | |
| 997 | |0 945412 |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/ | ||