Mathematical foundations of computer science 2000 : ; proceedings 25th international symposium, MFCS 2000, Bratislava, Slovakia, August 28 - September 1, 2000
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
1893 |
| 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 2000, 25th international symposium, MFCS 2000, Bratislava, Slovakia, August 28 - September 1, 2000, Mogens Nielsen, Branislav Rovan (eds.), 2000, Berlin, Springer, 1 vol. (XIII-710 p.), Lecture notes in computer science, 3-540-67901-4 • Mathematical Foundations of Computer Science 2000, Texte imprimé, 9783662182642 |
| LEADER | 06411nam a22004217a 4500 | ||
|---|---|---|---|
| 001 | 949401 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155236555 | ||
| 020 | |a 9783540446125 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004.0151 | ||
| 082 | |a 004 | ||
| 111 | 2 | |a Symposium on mathematical foundations of computer science |n (25 |d :2000 |c :Bratislava, Slovaquie). | |
| 245 | 1 | 0 | |a Mathematical foundations of computer science 2000 : ; proceedings |b 25th international symposium, MFCS 2000, Bratislava, Slovakia, August 28 - September 1, 2000 |c [edited by] Mogens Nielsen, Branislav Rovan. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 1893 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Invited Talks -- Region Analysis and a ?-Calculus with Groups -- Abstract Data Types in Computer Algebra -- What Do We Learn from Experimental Algorithmics? -- And/Or Hierarchies and Round Abstraction -- Computational Politics: Electoral Systems -- 0 1 Laws for Fragments of Existential Second-Order Logic: A Survey -- On Algorithms and Interaction -- On the Use of Duality and Geometry in Layouts for ATM Networks -- Contributed Papers -- On the Lower Bounds for One-Way Quantum Automata -- Axiomatizing Fully Complete Models for ML Polymorphic Types -- Measure Theoretic Completeness Notions for the Exponential Time Classes -- Edge-Bisection of Chordal Rings -- Equation Satisfiability and Program Satisfiability for Finite Monoids -- XML Grammars -- Simplifying Flow Networks -- Balanced k-Colorings -- A Compositional Model for Confluent Dynamic Data-Flow Networks -- Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication -- Expressiveness of Updatable Timed Automata -- Iterative Arrays with Small Time Bounds -- Embedding Fibonacci Cubes into Hypercubes with ?(2cn) Faulty Nodes -- Periodic-Like Words -- The Monadic Theory of Morphic Infinite Words and Generalizations -- Optical Routing of Uniform Instances in Tori -- Factorizing Codes and Schützenberger Conjectures -- Compositional Characterizations of ?-Terms Using Intersection Types -- Time and Message Optimal Leader Election in Asynchronous Oriented Complete Networks -- Subtractive Reductions and Complete Problems for Counting Complexity Classes -- On the Autoreducibility of Random Sequences -- Iteration Theories of Boolean Functions -- An Algorithm Constructing the Semilinear Post for 2-Dim Reset/Transfer VASS -- NP-Completeness Results and Efficient Approximations for Radiocoloring inPlanar Graphs -- Explicit Fusions -- State Space Reduction Using Partial ?-Confluence -- Reducing the Number of Solutions of NP Functions -- Regular Collections of Message Sequence Charts -- Alternating and Empty Alternating Auxiliary Stack Automata -- Counter Machines: Decidable Properties and Applications to Verification Problems -- A Family of NFA s Which Need 2n ? Deterministic States -- Preemptive Scheduling on Dedicated Processors: Applications of Fractional Graph Coloring -- Matching Modulo Associativity and Idempotency Is NP Complete -- On NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems -- Algebraic and Uniqueness Properties of Parity Ordered Binary Decision Diagrams and Their Generalization -- Formal Series over Algebras -- ?-Calculus Synthesis -- The Infinite Versions of LogSpace ? P Are Consistent with the Axioms of Set Theory -- Timed Automata with Monotonic Activities -- On a Generalization of Bi-Complement Reducible Graphs -- Automatic Graphs and Graph D0L-Systems -- Bilinear Functions and Trees over the (max, +) Semiring -- Derivability in Locally Quantified Modal Logics via Translation in Set Theory -- ?-Calculus, Structured Coalgebras, and Minimal HD-Automata -- Informative Labeling Schemes for Graphs -- Separation Results for Rebound Automata -- Unary Pushdown Automata and Auxiliary Space Lower Bounds -- Binary Decision Diagrams by Shared Rewriting -- Verifying Single and Multi-mutator Garbage Collectors with Owicki-Gries in Isabelle/HOL -- Why so Many Temporal Logics Climb up the Trees? -- Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems -- A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism -- On Diving in Trees Thomas Schwentick -- AbstractSyntax and Variable Binding for Linear Binders -- Regularity of Congruential Graphs -- Sublinear Ambiguity -- An Automata-Based Recognition Algorithm for Semi-extended Regular Expressions. | |
| 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 de programmation | ||
| 650 | |a Réseaux d'ordinateurs | ||
| 650 | |a Informatique |x Mathématiques | ||
| 650 | |a Ordinateurs | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Rovan, Branislav, |d 1947- |4 pbd | |
| 700 | 1 | |a Nielsen, Mogens, |d 1949- |4 pbd | |
| 776 | 0 | |0 052245756 |t Mathematical foundations of computer science 2000 |o 25th international symposium, MFCS 2000, Bratislava, Slovakia, August 28 - September 1, 2000 |f Mogens Nielsen, Branislav Rovan (eds.) |d 2000 |c Berlin |n Springer |p 1 vol. (XIII-710 p.) |s Lecture notes in computer science |z 3-540-67901-4 | |
| 776 | 0 | |t Mathematical Foundations of Computer Science 2000 |b Texte imprimé |z 9783662182642 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-44612-5 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-4H5M2K36-V |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:748059962 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-44612-5 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:751511471 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-44612-5 |z Accès INSA CVL | |
| 997 | |0 949401 |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/ | ||