Mathematical Foundations of Computer Science 2000: 25th International Symposium, MFCS 2000 Bratislava, Slovakia, August 28 - September 1, 2000 ProceedingsSpringer Science & Business Media, 14 de ago. de 2000 - 710 páginas 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 in Planar 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.- Abstract Syntax and Variable Binding for Linear Binders.- Regularity of Congruential Graphs.- Sublinear Ambiguity.- An Automata-Based Recognition Algorithm for Semi-extended Regular Expressions. |
Conteúdo
Region Analysis and a Calculus with Groups | 1 |
Abstract Data Types in Computer Algebra | 21 |
What Do We Learn from Experimental Algorithmics | 36 |
AndOr Hierarchies and Round Abstraction | 52 |
Electoral Systems | 64 |
A Survey | 84 |
On Algorithms and Interaction | 99 |
On the Use of Duality and Geometry in Layouts for ATM Networks | 114 |
PeriodicLike Words | 264 |
The Monadic Theory of Morphic Infinite Words and Generalizations | 275 |
Optical Routing of Uniform Instances in Tori | 285 |
Factorizing Codes and Schützenberger Conjectures | 295 |
Compositional Characterizations of Terms Using Intersection Types Extended Abstract | 304 |
Time and Message Optimal Leader Election in Asynchronous Oriented Complete Networks | 314 |
Subtractive Reductions and Complete Problems for Counting Complexity Classes | 323 |
On the Autoreducibility of Random Sequences | 333 |
On the Lower Bounds for OneWay Quantum Automata | 132 |
Axiomatizing Fully Complete Models for ML Polymorphic Types | 141 |
Measure Theoretic Completeness Notions for the Exponential Time Classes | 152 |
EdgeBisection of Chordal Rings | 162 |
Equation Satisfiability and Program Satisfiability for Finite Monoids | 172 |
XML Grammars | 182 |
Simplifying Flow Networks | 192 |
Balanced kColorings | 202 |
A Compositional Model for Confluent Dynamic DataFlow Networks | 212 |
Restricted Nondeterministic ReadOnce Branching Programs and an Exponential Lower Bound for Integer Multiplication Extended Abstract | 222 |
Expressiveness of Updatable Timed Automata | 232 |
Iterative Arrays with Small Time Bounds | 243 |
Embedding Fibonacci Cubes into Hypercubes with Faulty Nodes | 253 |
Iteration Theories of Boolean Functions | 343 |
An Algorithm Constructing the Semilinear Post for 2Dim ResetTransfer VASS Extended Abstract | 353 |
NPCompleteness Results and Efficient Approximations for Radiocoloring in Planar Graphs | 363 |
Explicit Fusions | 373 |
State Space Reduction Using Partial Confluence | 383 |
Reducing the Number of Solutions of NP Functions | 394 |
Regular Collections of Message Sequence Charts Extended Abstract | 405 |
Alternating and Empty Alternating Auxiliary Stack Automata | 415 |
Decidable Properties and Applications to Verification Problems | 426 |
A Family of NFAs Which Need Deterministic States | 436 |
Applications of Fractional Graph Coloring | 446 |
Matching Modulo Associativity and Idempotency Is NPComplete | 456 |
Outras edições - Ver todos
Mathematical Foundations of Computer Science 2000: 25th International ... Mogens Nielsen Prévia não disponível - 2000 |
Termos e frases comuns
Abstract algebra algorithm assignment automata automaton axioms Berlin Heidelberg 2000 binary bisimulation Boolean functions branching programs calculus codes color complexity classes consider construction contains context-free corresponding decision problem defined Definition denote deterministic edge equations equivalent example exists exponential finite set first-order formula given grammar graph G Hence hierarchy infinite input integer interactive interactive machine iteration labelled transition system language layout Lemma linear LNCS lower bound MFCS minimal modal modal logic monoid morphism nodes nondeterministic normal form NP-complete NP-hard OBDDs obtained operation optimal output paper path permutation planar graphs polynomial prefix problem Proc proof properties Proposition prove PSpace reachable recursive reduction regular expressions relation result Rovan Eds satisfies second-order logic semantics sequence structure subset symbol temporal logics Theorem theory transition system tree Turing machines variables vertex vertices word