STACS 86 : 3rd Annual Symposium on Theoretical Aspects of Computer Science Orsay, France, January 16 18, 1986
Enregistré dans:
| Institution som forfatter: | |
|---|---|
| Andre forfattere: | , |
| Format: | Livre numérique |
| Sprog: | Anglais Français |
| Udgivet: |
Berlin ; Heidelberg :
Springer-Verlag : Springer e-books
[20..].
Cham : Springer Nature |
| Serier: | Lecture notes in computer science
210 |
| Fag: | |
| Online adgang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Kommentar: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • STACS 86, 3rd Annual Symposium on Theoretical Aspects of Computer Science, Orsay, France, January 16-18, 1986, edited by B. Monien and G. Vidal-Naquet, 1986, Berlin, Springer, 1 vol. (IX-368 p.), Lecture notes in computer science, 0-387-16078-7 • STACS 86, Texte imprimé, 9783662162118 |
| LEADER | 04309nam a22003857a 4500 | ||
|---|---|---|---|
| 001 | 945178 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155217046 | ||
| 020 | |a 9783540397588 (PDF) | ||
| 041 | 0 | |a eng |a fre | |
| 082 | |a 004 | ||
| 111 | 2 | |a Symposium on Theoretical Aspects of Computer Science |n (03 |d :1986 |c :Orsay, Essonne). | |
| 245 | 1 | 0 | |a STACS 86 : |b 3rd Annual Symposium on Theoretical Aspects of Computer Science Orsay, France, January 16 18, 1986 |c edited by B. Monien and G. Vidal-Naquet. |
| 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 210 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Abstract interpretation of denotational definitions -- Temporal reasoning under generalized fairness constraints -- Decidabilite de l'egalite des Langages Algebriques Infinitaires Simples -- Some probabilistic powerdomains in the category SFP -- Ions and local definitions in logic programming -- Input sensitive, optimal parallel randomized algorithms for addition and identification -- A parallel statistical cooling algorithm -- Subgraph isomorphism for biconnected outerplanar graphs in cubic time -- Polynomial time algorithms for finding integer relations among real numbers -- New upperbounds for decentralized extrema-finding in a ring of processors -- Algorithms for visibility representations of planar graphs -- Speeding up random access machines by few processors -- Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs -- On sparseness, ambiguity and other decision problems for acceptors and transducers -- Varietes de Semis Groupes et Mots Infinis -- Equations in free partially commutative monoids -- Separating and testing -- Decomposition de Fonctions Rationnelles -- Long unavoidable patterns -- Abstract implementations and correctness proofs -- Strictness and serializability -- Towards specification and proof of asynchronous systems -- Monotone boolean formulas, distributive lattices, and the complexities of logics, algebraic structures, and computation structures (preliminary report) -- Concurrent conciseness of degree, probabilistic, nondeterministic and deterministic finite automata -- Logspace hierarchies, polynomial time and the complexity of fairness problems concerning ?-machines -- On sparse oracles separating feasible complexity classes -- On generalized kolmogorov complexity -- Area-time optimal division for T=?((logn)1+? ) -- A time-spacetradeoff for element distinctness -- Parallel machines and their communication theoretical limits. | |
| 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 Logique symbolique et mathématique | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Monien, Burkhard, |d 1943- |4 pbd | |
| 700 | 1 | |a Vidal-Naquet, Guy, |d 1946- |4 pbd | |
| 776 | 0 | |0 029375126 |t STACS 86 |o 3rd Annual Symposium on Theoretical Aspects of Computer Science, Orsay, France, January 16-18, 1986 |f edited by B. Monien and G. Vidal-Naquet |d 1986 |c Berlin |n Springer |p 1 vol. (IX-368 p.) |s Lecture notes in computer science |z 0-387-16078-7 | |
| 776 | 0 | |t STACS 86 |b Texte imprimé |z 9783662162118 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-16078-7 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-HLV0DK0C-R |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:74791298X |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-16078-7 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750925752 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-16078-7 |z Accès INSA CVL | |
| 997 | |0 945178 |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/ | ||