26. MFCS 2001:
Marianske Lazne, Czech Republic
: On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity.
Erik D. Demaine
: Playing Games with Algorithms: Algorithmic Combinatorial Game Theory.
: Some Recent Results on Data Mining and Search.
: The Strength of Non-size-increasing Computation (Introduction and Summary).
: Introduction 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.
: Improved Bounds on the Weak Pigeonhole Principle and Infinitely Many Primes from Weaker Axioms.
: Computing Reciprocals of Bivariate Power Series.
: Computable Versions of Baire's Category Theorem.
Giovanni Di Crescenzo
: Sharing One Secret vs. Sharing Many Secrets: Tight Bounds for the Max Improvement Ratio.
: Approximation Algorithms and Complexity Results for Path Problems in Trees of Rings.
: Quantifier Rank for Parity of Embedded Finite Models.
: Synchronizing Finite Automata on Eulerian Digraphs.
: Word Problems for 2-Homogeneous Monoids and Symmetric Logspace.
, Seinosuke Toda
: The Complexity of Computing the Number of Self-Avoiding Walks in Two-Dimensional Grid Graphs and in Hypercube Graphs.
: On Reducibility and Symmetry of Disjoint NP-Pairs.
: On the Approximability of the Steiner Tree Problem.
: Characterization of Context-Free Languages with Polynomially Bounded Ambiguity.