06069nam a22005415i 4500001001800000003000900018005001700027007001500044008004100059020001800100024003100118050001700149072001500166072001600181072002300197072002300220082001700243245025500260264006100515300003400576336002600610337002600636338003600662347002400698490005800722505274600780520136503526650002204891650003604913650001504949650003504964650002404999650001905023650002205042650002705064650004605091650003705137650004005174650001905214700003705233700003205270700003305302710003405335773002005369776003605389830005805425856004405483978-3-540-48340-3DE-He21320170515111507.0cr nn 008mamaa121227s1999 gw | s |||| 0|eng d a97835404834037 a10.1007/3-540-48340-32doi 4aQA75.5-76.95 7aUY2bicssc 7aUYA2bicssc 7aCOM0140002bisacsh 7aCOM0310002bisacsh04a004.015122310aMathematical Foundations of Computer Science 1999h[electronic resource] :b24th International Symposium, MFCS’99 Szklarska Poręba, Poland, September 6–10,1999 Proceedings /cedited by Mirosław Kutyłowski, Leszek Pacholski, Tomasz Wierzbicki. 1aBerlin, Heidelberg :bSpringer Berlin Heidelberg,c1999. aXII, 464 p.bonline resource. atextbtxt2rdacontent acomputerbc2rdamedia aonline resourcebcr2rdacarrier atext filebPDF2rda1 aLecture Notes in Computer Science,x0302-9743 ;v16720 aComputing 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 -- Counting Problems -- 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. aThis 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 theoretical aspects and mathematical foundations of computer science. The scientific program of the symposium consists of five invited talks given by Martin Dyer, Dexter Kozen, Giovanni Manzini, Sergio Rajsbaum, and Mads Tofte, and 37 accepted papers chosen out of 68 submissions. The volume contains all accepted contributed papers, and three invited papers. The contributed papers have been selected for presentation based on their scientific quality, novelty, and interest for the general audience of MFCS par ticipants. Each paper has been reviewed by at least three independent referees — PC members and/or sub-referees appointed by them. The papers were se lected for presentation during a fully electronic virtual meeting of the program committee on May 7, 1999. The virtual PC meeting was supported by software written by Artur Zgoda, Ph.D. student at the University of Wroclaw. The entire communication and access to quite a sensitive database at PC headquarters in Wroclaw was secured by cryptographic protocols based on technology of certificates. 0aComputer science. 0aComputer communication systems. 0aComputers. 0aComputer sciencexMathematics. 0aMathematical logic. 0aCombinatorics.14aComputer Science.24aTheory of Computation.24aDiscrete Mathematics in Computer Science.24aComputer Communication Networks.24aMathematical Logic and Foundations.24aCombinatorics.1 aKutyłowski, Mirosław.eeditor.1 aPacholski, Leszek.eeditor.1 aWierzbicki, Tomasz.eeditor.2 aSpringerLink (Online service)0 tSpringer eBooks08iPrinted edition:z9783540664086 0aLecture Notes in Computer Science,x0302-9743 ;v167240uhttp://dx.doi.org/10.1007/3-540-48340-3