Bulletin of the EATCS, Volume 87

Volume 87, October 2005

• Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch: Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms. 47-77

• Peter Høyer, Robert Spalek: Lower Bounds on Quantum Query Complexity. 78-103

• Catuscia Palamidessi, Frank D. Valencia: Recursion vs Replication in Process Calculi: Expressiveness. 105-125

• Barbara König, Vitali Kozioura: Augur - A Tool for the Analysis of Graph Transformation Systems. 126-137

• Julia Padberg: Integration of the Generic Component Concepts for System Modeling with Adhesive HLR Systems. 138-154

• Jan Van den Bussche: First-order Topology Properties. 155-164

• Yasubumi Sakakibara: Development of a Bacteria Computer: From in silico Finite Automata to in virto AND in vivo. 165-178

• Pedro García, Manuel Vazquez de Parga: A note about mergible states in large NFA. 181-184
• Olivier Finkel: On Decision Problems for Timed Automata. 185-190
• Pál Dömösi, Géza Horváth: The Language of Primitive Words in not Regular: Two Simple Proofs. 191-194

Last update Mon May 20 00:54:49 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page