| 000 | 05993nam a22005775i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-44612-5 | ||
| 003 | DE-He213 | ||
| 005 | 20240423132551.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 121227s2000 gw | s |||| 0|eng d | ||
| 020 |
_a9783540446125 _9978-3-540-44612-5 |
||
| 024 | 7 |
_a10.1007/3-540-44612-5 _2doi |
|
| 050 | 4 | _aQA75.5-76.95 | |
| 072 | 7 |
_aUYA _2bicssc |
|
| 072 | 7 |
_aCOM014000 _2bisacsh |
|
| 072 | 7 |
_aUYA _2thema |
|
| 082 | 0 | 4 |
_a004.0151 _223 |
| 245 | 1 | 0 |
_aMathematical Foundations of Computer Science 2000 _h[electronic resource] : _b25th International Symposium, MFCS 2000 Bratislava, Slovakia, August 28 - September 1, 2000 Proceedings / _cedited by Mogens Nielsen, Branislav Rovan. |
| 250 | _a1st ed. 2000. | ||
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2000. |
|
| 300 |
_a710 p. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v1893 |
|
| 505 | 0 | _aInvited 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. | |
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aCompilers (Computer programs). | |
| 650 | 0 | _aComputer networks . | |
| 650 | 0 | _aComputer graphics. | |
| 650 | 1 | 4 | _aTheory of Computation. |
| 650 | 2 | 4 | _aCompilers and Interpreters. |
| 650 | 2 | 4 | _aComputer Communication Networks. |
| 650 | 2 | 4 | _aComputer Graphics. |
| 700 | 1 |
_aNielsen, Mogens. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 700 | 1 |
_aRovan, Branislav. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540679011 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783662182642 |
| 830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v1893 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/3-540-44612-5 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 912 | _aZDB-2-LNC | ||
| 912 | _aZDB-2-BAE | ||
| 942 | _cSPRINGER | ||
| 999 |
_c189208 _d189208 |
||