STACS 85 : 2nd annual symposium on theoretical aspects of computer science, Saarbrücken, January 3-5, 1985
Guardado en:
| Autor Corporativo: | |
|---|---|
| Otros Autores: | |
| Formato: | Livre numérique |
| Lenguaje: | Anglais |
| Publicado: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Colección: | Lecture notes in computer science
182 |
| Materias: | |
| Acceso en línea: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • STACS 85, 2nd annual symposium on theoretical aspects of computer science, Saarbrücken, January 3-5, 1985, edited by K. Mehlhorn, Berlin, Springer, 1985, 1 vol. (VII-374 p.), Lecture notes in computer science, 3-540-13912-5 • STACS 85, Texte imprimé, 9783662211229 |
| LEADER | 04462nam a22003977a 4500 | ||
|---|---|---|---|
| 001 | 945414 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN15522655X | ||
| 020 | |a 9783540391364 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 001.64 | ||
| 082 | |a 004 | ||
| 245 | 0 | 0 | |a STACS 85 : |b 2nd annual symposium on theoretical aspects of computer science, Saarbrücken, January 3-5, 1985 |c edited by K. Mehlhorn. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 182 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a On the relative complexity of subproblems of intractable problems -- On Lovász' lattice reduction and the nearest lattice point problem -- Layouts with wires of balanced length -- On the single-operation worst-case time complexity of the disjoint set union problem -- Deterministic languages and non-generators -- Simulation of large networks on smaller networks -- Petri nets and algebraic calculi of processes -- Non-deterministic two-tape automata are more powerful than deterministic ones -- Construction of a family of factorizing codes -- On hotz groups and homomorphic images of sentential form languages -- Using domain algebras to prove the correctness of a compiler -- Sorting and recognition problems for ordered sets -- Tree automata and logic programs -- Structure of relations satisfying certain families of dependencies -- A single source shortest path algorithm for a planar distributed network -- An algorithm for two-layer channel routing -- New algorithms for special cases of the hidden line elimination problem -- An algorithm to construct Minkowski-reduced lattice-bases -- Base Non Finie de Varietes -- Proximity on a grid -- An O(N1.5+?) expected time algorithm for canonization and isomorphism testing of trivalent graphs -- On the complexity of deadlock recovery -- On the planar monotone computation of threshold functions -- Planar circuits have short specifications -- Shortest paths on polyhedral surfaces -- Fairness in context Free grammars under canonical derivations -- Distributed termination in CSP symmetric solutions with minimal storage -- A dynamization of the All Pairs Least Cost Path Problem -- Boundedness, empty channel detection and synchronization for communicating finite state machines -- Deriving stack semantics congruent to standard denotational semantics -- Translatingpolygons in the plane -- Geometric containment is not reducible to Pareto dominance -- The volume of the union of many spheres and point inclusion problems -- Combined simplicity and immunity in relativized NP -- Groups, codes and unambiguous automata -- Reduced memory space for multi-dimensional search trees (extended abstract). | |
| 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 Ordinateurs | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Mehlhorn, Kurt, |d 1949- |4 pbd | |
| 711 | 2 | |a Symposium on Theoretical Aspects of Computer Science |n (02 |d :1985 |c :Saarbrücken). |4 aut | |
| 776 | 0 | |0 026157160 |t STACS 85 |o 2nd annual symposium on theoretical aspects of computer science, Saarbrücken, January 3-5, 1985 |f edited by K. Mehlhorn |c Berlin |n Springer |d 1985 |p 1 vol. (VII-374 p.) |s Lecture notes in computer science |z 3-540-13912-5 | |
| 776 | 0 | |t STACS 85 |b Texte imprimé |z 9783662211229 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/BFb0023988 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-5GRX2CDJ-2 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:74791074X |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/BFb0023988 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750923628 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/BFb0023988 |z Accès INSA CVL | |
| 997 | |0 945414 |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/ | ||