STACS 97 : 14th Annual Symposium on Theoretical Aspects of Computer Science Lübeck, Germany February 27 March 1, 1997 : proceedings
This book constitutes the refereed proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science, STACS 97, held in Lübeck, Germany, in February/March 1997. The 46 revised full papers included were carefully selected from a total of 139 submissions; also included are three invi...
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
1200 |
| 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: | • STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27-March 1, 1997, proceedings, Rüdiger Reischuk, Michel Morvan (eds.), 1997, Berlin, Springer, 1 vol. (XIII-611 p.), Lecture notes in computer science, 3-540-62616-6 • STACS 97, Texte imprimé, 9783662186329 |
| LEADER | 06159nam a22004217a 4500 | ||
|---|---|---|---|
| 001 | 969681 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155177761 | ||
| 020 | |a 9783540683421 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 111 | 2 | |a Symposium on Theoretical Aspects of Computer Science |n (14 |d :1997 |c :Lübeck, Allemagne). | |
| 245 | 1 | 0 | |a STACS 97 : |b 14th Annual Symposium on Theoretical Aspects of Computer Science Lübeck, Germany February 27 March 1, 1997 : proceedings |c [edited by] Rüdiger Reischuk, Michel Morvan. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 1200 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Unifying models -- Predecessor queries in dynamic integer sets -- Semi-dynamic shortest paths and breadth-first search in digraphs -- Greibach normal form transformation, revisited -- Translating regular expressions into small ?-free nondeterministic finite automata -- Memory management for Union-Find algorithms -- Fast online multiplication of real numbers -- The operators min and max on the polynomial hierarchy -- Resource-bounded kolmogorov complexity revisited -- Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations -- Interactive proof systems with public coin: Lower space bounds and hierarchies of complexity classes -- MODp-tests, almost independence and small probability spaces -- Hybrid diagrams: A deductive-algorithmic approach to hybrid system verification -- Temporal logics for the specification of performance and reliability -- Efficient scaling-invariant checking of timed bisimulation -- Gossiping and broadcasting versus computing functions in networks -- On the descriptive and algorithmic power of parity ordered binary decision diagrams -- A reducibility concept for problems defined in terms of ordered binary decision diagrams -- On the classification of computable languages -- A conditional-logical approach to minimum cross-entropy -- Undecidability results on two-variable logics -- Methods and applications of (max,+) linear algebra -- Regular expressions and context-free grammars for picture languages -- Measuring nondeterminism in pushdown automata -- On polynomially D verbose sets -- A downward translation in the polynomial hierarchy -- Strict sequential P-completeness -- An unambiguous class possessing a complete set -- Deadlock-free interval routing schemes -- Power consumption in packet radio networks -- Thecomplexity of generating test instances -- Efficient constructions of Hitting Sets for systems of linear functions -- Protocols for collusion-secure asymmetric fingerprinting -- Minimal transition systems for history-preserving bisimulation -- On ergodic linear cellular automata over Zm -- Intrinsic universality of a 1-dimensional reversible Cellular Automaton -- The computational complexity of some problems of linear algebra -- Algebraic and logical characterizations of deterministic linear time classes -- Finding the k shortest paths in parallel -- Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs -- Distance approximating spanning trees -- A better upper bound on the bisection width of de Bruijn networks -- An information-theoretic treatment of random-self-reducibility -- Equivalence of measures of complexity classes -- Better algorithms for minimum weight vertex-connectivity problems -- RNC-approximation algorithms for the steiner problem -- Pattern matching in trace monoids -- Removing ?-transitions in timed automata -- Probabilistic proof systems A survey. | |
| 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 | ||
| 520 | |a This book constitutes the refereed proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science, STACS 97, held in Lübeck, Germany, in February/March 1997. The 46 revised full papers included were carefully selected from a total of 139 submissions; also included are three invited full papers. The papers presented span the whole scope of theoretical computer science. Among the topics covered are, in particular, algorithms and data structures, computational complexity, automata and formal languages, structural complexity, parallel and distributed systems, parallel algorithms, semantics, specification and verification, logic, computational geometry, cryptography, learning and inductive inference. | ||
| 650 | |a Informatique | ||
| 650 | |a Langages de programmation | ||
| 650 | |a Ordinateurs | ||
| 650 | |a Complexité de calcul (informatique) | ||
| 650 | |a Ordinateurs | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Reischuk, Rüdiger, |d 1955- |4 pbd | |
| 700 | 1 | |a Morvan, Michel, |d 1966- |4 pbd | |
| 776 | 0 | |0 02801281X |t STACS 97 |o 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27-March 1, 1997 |o proceedings |f Rüdiger Reischuk, Michel Morvan (eds.) |d 1997 |c Berlin |n Springer |p 1 vol. (XIII-611 p.) |s Lecture notes in computer science |z 3-540-62616-6 | |
| 776 | 0 | |t STACS 97 |b Texte imprimé |z 9783662186329 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/BFb0023443 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-SH764P70-X |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:750671378 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/BFb0023443 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:754020193 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/BFb0023443 |z Accès INSA CVL | |
| 997 | |0 969681 |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/ | ||