Mathematical Foundations of Computer Science 2001: 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001 Proceed by Jiri SgallMathematical Foundations of Computer Science 2001: 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001 Proceed by Jiri Sgall

Mathematical Foundations of Computer Science 2001: 26th International Symposium, MFCS 2001…

byJiri SgallEditorAles Pultr, Petr Kolman

Paperback | August 15, 2001

Pricing and Purchase Info

$192.95 online 
$233.50 list price save 17%
Earn 965 plum® points

Prices and offers may vary in store


In stock online

Ships free on orders over $25

Not available in stores


This volume contains papers selected for presentation at the 26th International Symposium on Mathematical Foundations of Computer Science - MFCS 2001, held in Mari´ansk´eL´azn?e, Czech Republic, August 27 - 31, 2001. MFCS 2001 was organized by the Mathematical Institute (Academy of S- ences of the Czech Republic), the Institute for Theoretical Computer Science (Charles University, Faculty of Mathematics and Physics), the Institute of C- puter Science (Academy of Sciences of the Czech Republic), and Action M Agency. It was supported by the European Research Consortium for Informatics and Mathematics, the Czech Research Consortium for Informatics and Ma- ematics, and the European Association for Theoretical Computer Science. We gratefully acknowledge the support of all these institutions. The series of MFCS symposia, organized on a rotating basis in Poland, S- vakia, and the Czech Republic, has a well-established tradition. The aim is to encourage high-quality research in all branches of theoretical computer science and bring together specialists who do not usually meet at specialized confer- ? ences. Previous meetings tookplace in Jablonna, 1972; Strbsk´e Pleso, 1973; J- wisin, 1974; Marian ´ sk´eL´azn?e, 1975; Gdan ´sk, 1976; Tatransk´a Lomnica, 1977; Za- ? kopane, 1978; Olomouc, 1979; Rydzina, 1980; Strbsk´e Pleso, 1981; Prague, 1984; Bratislava, 1986; Karlovy Vary, 1988; Porabk ¸ a-Kozubnik, 1989; Bansk´aBystrica, 1990; Kazimierz Dolny, 1991; Prague, 1992; Gdan ´sk, 1993; Ko?sice, 1994; Prague, 1995; Krak´ow, 1996; Bratislava, 1997; Brno, 1998; Szklarska Por¸eba, 1999; and Bratislava, 2000.
Title:Mathematical Foundations of Computer Science 2001: 26th International Symposium, MFCS 2001…Format:PaperbackDimensions:718 pages, 23.3 × 15.5 × 0.01 inPublished:August 15, 2001Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3540424962

ISBN - 13:9783540424963

Look for similar items by category:


Table of Contents

Invited Talks.- A New Category for Semantics.- On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity.- Playing Games with Algorithms: Algorithmic Combinatorial Game Theory.- Some Recent Results on Data Mining and Search.- Hypertree Decompositions: A Survey.- The Strength of Non-size-increasing Computation (Introduction and Summary).- to Recent Quantum Algorithms.- Decomposition Methods and Sampling Circuits in the Cartesian Lattice.- New Algorithms for k-SAT Based on the Local Search Principle.- Linear Temporal Logic and Finite Semigroups.- Contributed Talks.- Refined Search Tree Technique for Dominating Set on Planar Graphs.- The Computational Power of a Family of Decision Forests.- Exact Results for Accepting Probabilities of Quantum Automata.- Improved Bounds on the Weak Pigeonhole Principle and Infinitely Many Primes from Weaker Axioms.- Analysis Problems for Sequential Dynamical Systems and Communicating State Machines.- The Complexity of Tensor Circuit Evaluation.- Computing Reciprocals of Bivariate Power Series.- Automatic Verification of Recursive Procedures with One Integer Parameter.- Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds.- Computable Versions of Baire's Category Theorem.- Automata on Linear Orderings.- Algorithmic Information Theory and Cellular Automata Dynamics.- The k-Median Problem for Directed Trees.- On Pseudorandom Generators in NC0.- There Are No Sparse NPw-Hard Sets.- Sharing One Secret vs. Sharing Many Secrets: Tight Bounds for the Max Improvement Ratio.- (H,C,K) -Coloring: Fast, Easy, and Hard Cases.- Randomness and Reductibility.- On the Computational Complexity of Infinite Words.- Lower Bounds for On-Line Single-Machine Scheduling.- Approximation Algorithms and Complexity Results for Path Problems in Trees of Rings.- A 3-Approximation Algorithm for Movement Minimization in Conveyor Flow Shop Processing.- Quantifier Rank for Parity of Embedded Finite Models.- Space Hierarchy Theorem Revised.- Converting Two-Way Nondeterministic Unary Automata into Simpler Automata.- The Complexity of the Minimal Polynomial.- Note on Minimal Finite Automata.- Synchronizing Finite Automata on Eulerian Digraphs.- A Time Hierarchy for Bounded One-Way Cellular Automata.- Checking Amalgamability Conditions forCasl Architectural Specifications.- On-Line Scheduling with Tight Deadlines.- Complexity Note on Mixed Hypergraphs.- News from the Online Traveling Repairman.- Word Problems for 2-Homogeneous Monoids and Symmetric Logspace.- Variations on a Theorem of Fine & Wilf.- Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs.- Satisfiability of Systems of Equations over Finite Monoids.- Rational Graphs Trace Context-Sensitive Languages.- Towards Regular Languages over Infinite Alphabets.- Partial Information and Special Case Algorithms.- The Complexity of Computing the Number of Self-Avoiding Walks in Two-Dimensional Grid Graphs and in Hypercube Graphs.- From Bidirectionality to Alternation.- Syntactic Semiring of a Language.- On Reducibility and Symmetry of Disjoint NP-Pairs.- Hierarchy of Monotonically Computable Real Numbers.- On the Equational Definition of the Least Prefixed Point.- On the Periods of Partial Words.- The Size of Power Automata.- On the Approximability of the Steiner Tree Problem.- Alignment between Two RNA Structures.- Characterization of Context-Free Languages with Polynomially Bounded Ambiguity.