Mathematical foundations of computer science 1999 : 24th international symposium, MFCS'99 Szklarska Por©eba, Poland, September 6-10, 1999 : proceedings
This volume contains papers selected for presentation during the 24th Interna tional Symposium on Mathematical Foundations of Computer Science held on September 6-10, 1999 in Szklarska Por^ba, Poland. The symposium, organized alternately in the Czech Republic, Slovakia, and Poland, focuses on theore...
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
1672 |
| 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 1999, 24th international symposium, MFCS'99 Szklarska Por©eba, Poland, September 6-10, 1999, proceedings, Mirosław Kutyłowski, Leszek Pacholski, Tomasz Wierzbicki, eds, 1999, New York, Springer, 1 vol. (XII-453 p.), Lecture notes in computer science, 3-540-66408-4 • Mathematical Foundations of Computer Science 1999, Texte imprimé, 9783662197271 |
Obsah:
- Computing Over Reals
- On-Line Addition in Real Base
- Query Languages for Real Number Databases Based on Descriptive Complexity over R
- The Arithmetical Hierarchy of Real Numbers
- Compression Techniques
- The Burrows-Wheeler Transform: Theory and Practice
- Efficiency of Fast Parallel Pattern Searching in Highly Compressed Texts
- Foundations of Programming
- Computing and Comparing Semantics of Programs in Four-Valued Logics
- Foundations of Modular SOS
- Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces
- Complexity and Algorithms
- On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System
- The Complexity of the Extended GCD Problem
- Complexity Results for Confluence Problems
- Model Checking
- Is Your Model Checker on Time?
- Clausal Resolution for CTL
- Model Checking and Higher-Order Recursion
- Distributed Computing
- Multiparty Communication Complexity: Very Hard Functions
- New Perspectives in Distributed Computing
- Functional Programming
- An Improved Disjunctive Strictness Analysis for Lazy Functional Languages
- Unique Fixed Point Induction for McCarthy s Amb
- Automata
- On Some Topological Properties of Linear Cellular Automata
- Real-Time Language Recognition by One-Way and Two-Way Cellular Automata
- Average State Complexity of Operations on Unary Automata
- Fooling Rebound Automata
- Algorithms and Complexity
- The Complexity of Minimizing FBDDs
- Efficient Strongly Universal and Optimally Universal Hashing
- Lower and Upper Bounds for the Problem of Page Replication in Ring Networks
- Security
- Language-Based Security
- Logic
- An Algebraic Approach to Knowledge Representation
- On the Structure of the Monadic Logic of the Binary Tree
- A New Space Bound for the Modal Logics K4, KD4 and S4
- CountingProblems
- On Approximating the Number of Bases of Exchange Preserving Matroids
- Processes and Bisimulation
- The Semantic Foundations of a Compositional Proof Method for Synchronously Communicating Processes
- On Plain and Hereditary History-Preserving Bisimulation
- Approximating Weak Bisimulation on Basic Process Algebras
- Graph Algorithms
- Edge Coloring of Bipartite Graphs with Constraints
- An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover
- On Minimum Edge Ranking Spanning Trees
- Complexity
- Football Elimination Is Hard to Decide Under the 3-Point-Rule
- Generalized Regular Counting Classes
- A Foundation of Programming a Multi-tape Quantum Turing Machine
- Types: Theory and Applications
- A Type Discipline for Solving Year 2000 Problems in COBOL Programs
- Type Reconstruction for Functional Programs with Subtyping over a Lattice of Atomic Types.