STACS 94 : 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24 26, 1994 : proceedings
This volume constitutes the proceedings of the 11th annual Symposium on Theoretical Aspects of Computer Science (STACS '94), held in Caen, France, February 24-26, 1994. Besides three prominent invited papers, the proceedings contains 60 accepted contributions chosen by the international program...
Enregistré dans:
| 企業作者: | |
|---|---|
| 其他作者: | , , |
| 格式: | Livre numérique |
| 語言: | Anglais |
| 出版: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| 叢編: | Lecture notes in computer science
775 |
| 主題: | |
| 在線閱讀: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| 提示: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994, proceedings, P. Enjalbert, E.W. Mayr, K.W. Wagner (Eds.), Berlin, Springer-Verlag, 1994, 1 vol. (XIV-782 p.), Lecture notes in computer science, 3-540-57785-8 • STACS 94, Texte imprimé, 9783662165089 |
| LEADER | 06711nam a22004337a 4500 | ||
|---|---|---|---|
| 001 | 945285 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155221736 | ||
| 020 | |a 9783540483328 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 111 | 2 | |a Symposium on Theoretical Aspects of Computer Science |n (11 |d :1994 |c :Caen, France). | |
| 245 | 1 | 0 | |a STACS 94 : |b 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24 26, 1994 : proceedings |c [edited by] P. Enjalbert, E.W. Mayr, K.W. Wagner. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 775 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a The nature and meaning of perturbations in geometric computing -- One binary horn clause is enough -- Transforming constraint logic programs -- A hierarchy of temporal logics with past -- The complexity of resource-bounded first-order classical logic -- Two proof procedures for a cardinality based language in propositional calculus -- The alternation hierarchy for machines with sublogarithmic space is infinite -- Quasilinear time complexity theory -- Space-efficient deterministic simulation of probabilistic automata -- Reachability and the power of local ordering -- Are parallel machines always faster than sequential machines? -- Ground reducibility and automata with disequality constraints -- Perpetuality and strong normalization in orthogonal term rewriting systems -- About changing the ordering during Knuth-Bendix completion -- Combination of matching algorithms -- Periodic constant depth sorting networks -- Optimal pattern matching on meshes -- Faster sorting and routing on grids with diagonals -- Deterministic 1 -k routing on meshes with applications to worm-hole routing -- A unifying type-theoretic framework for objects -- Operational specifications with built-ins -- Reactive variables for system specification and design -- A new parallel vector model, with exact characterization of NCk -- On adaptive dlogtime and polylogtime reductions -- NCk(NP)=AC k?1(NP) -- Hypertransition systems -- On the star operation and the finite power property in free partially commutative monoids -- Coding with traces -- Monadic second-order logic over pictures and recognizability by tiling systems -- Q-grammars: Results, implementation -- A topology for complete semirings -- The global power of additional queries to random oracles -- Cook versus Karp-Levin: Separating completeness notions if NP is not small -- Onsets bounded truth-table reducible to P-selective sets -- Two refinements of the polynomial hierarchy -- On different reducibility notions for function classes -- Optimal parallelization of Las Vegas algorithms -- Efficient parallel algorithms for geometric k-clustering problems -- A simple optimal parallel algorithm for reporting paths in a tree -- Parallel detection of all palindromes in a string -- On the structure of parameterized problems in NP -- On the approximability of finding maximum feasible subsystems of linear systems -- On the acceptance power of regular languages -- Complexity classes with finite acceptance types -- The complete axiomatization of Cs-congruence -- Transition system specifications in stalk format with bisimulation as a congruence -- Decidability questions for bisimilarity of Petri nets and some related problems -- The variable membership problem: Succinctness versus complexity -- Economy of description for single-valued transducers -- Automaticity: Properties of a measure of descriptional complexity -- Towards a theory of recursive structures -- Finding minimal generalizations for unions of pattern languages and its application to inductive inference from positive data -- Nondeterminism in patterns -- Upper bounds for the expected length of a longest common subsequence of two binary sequences -- The ambiguity of primitive words -- On codes having no finite completion -- A new approach to information theory -- On Voronoi diagrams in the L p -metric in higher dimensions -- Total protection of analytic invariant information in cross tabulated tables -- Dominating cliques in graphs with hypertree structure -- On vertex ranking for permutation and other graphs -- Finding all minimal separators of a graph -- On the complexity of the maximum cut problem. | |
| 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 volume constitutes the proceedings of the 11th annual Symposium on Theoretical Aspects of Computer Science (STACS '94), held in Caen, France, February 24-26, 1994. Besides three prominent invited papers, the proceedings contains 60 accepted contributions chosen by the international program committee during a highly competitive reviewing process from a total of 234 submissions for 38 countries. The volume competently represents most areas of theoretical computer science with a certain emphasis on (parallel) algorithms and complexity. | ||
| 650 | |a Informatique | ||
| 650 | |a Algorithmes | ||
| 650 | |a Systèmes d'exploitation (ordinateurs) | ||
| 650 | |a Ordinateurs | ||
| 650 | |a Logique symbolique et mathématique | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Enjalbert, Patrice. |4 pbd | |
| 700 | 1 | |a Wagner, Klaus W. |4 pbd | |
| 700 | 1 | |a Mayr, Ernst W., |d 1950- |4 pbd | |
| 776 | 0 | |0 018127134 |t STACS 94 |o 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994 |o proceedings |f P. Enjalbert, E.W. Mayr, K.W. Wagner (Eds.) |c Berlin |n Springer-Verlag |d 1994 |p 1 vol. (XIV-782 p.) |s Lecture notes in computer science |z 3-540-57785-8 | |
| 776 | 0 | |t STACS 94 |b Texte imprimé |z 9783662165089 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-57785-8 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-FQ6S0V0H-W |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747912009 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-57785-8 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750924799 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-57785-8 |z Accès INSA CVL | |
| 997 | |0 945285 |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/ | ||