10. FCT 1995: Dresden, Germany
Horst Reichel (Ed.): Fundamentals of Computation Theory, 10th International Symposium, FCT '95, Dresden, Germany, August 22-25, 1995, Proceedings. Springer 1995 Lecture Notes in Computer Science ISBN 3-540-60249-6
Invited Lectures
- Ernst W. Mayr: On Polynomial Ideals, Their Complexity, and Applications. 89-105
Communications
- Roberto M. Amadio, Lone Leth, Bent Thomsen: From a Concurrent Lambda-Calculus to the Pi-Calculus. 106-115
- Valentin M. Antimirov: Rewriting Regular Inequalities (Extended Abstract). 116-125
- Gilles Barthe: A Simple Abstract Semantics for Equational Theories. 126-135
- Michael Bertol: Efficient Rewriting in Cograph Trace Monoids. 146-155
- Cristian Calude, Marius Zimand: Effective Category and Measure in Abstract Complexity Theory (Extended Abstract). 156-170
- Thomas Chaboud: About Planar Cayley Graphs. 171-180
- Victor Chepoi, Feodor F. Dragan: On Condorcet and Median Points of Simple Rectilinear Polygons (Extended Abstract). 181-190
- Hristo Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis: Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs. 191-200
- Feodor F. Dragan, Falk Nicolai: r-Domination Problems on Homogeneously Ordered Graphs (Extended Abstract). 201-210
- Javier Esparza: Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes. 221-232
- Heinz Faßbender: Implementation of a UU-Algorithm for Primitive Recursive Tree Functions. 233-242
- Erik de Haas: Categorial Graphs (Extended Abstract). 263-272
- Juraj Hromkovic, Ralf Klasing, Dana Pardubská, Walter Unger, Juraj Waczulík, Hubert Wagener: Effective Systolic Algorithms for Gossiping in Cycles and Two-Dimensional Grids (Extended Abstract). 273-282
- Ngoc-Minh Lê: Randomized Incremental Construction of Simple Abstract Voronoi Diagrams in 3-Space (Extended Abstract). 333-342
- Ioan I. Macarie, Mitsunori Ogihara: Properties of Probabilistic Pushdown Automata (Extended Abstract). 343-352
- H. Petersen: Some Results Concerning Two-Dimensional Turing Machines and Finite Automata. 374-382
- Giovanni Pighizzini: How Hard is to Compute the Edit Distance. 383-392
- Klaus Reinhardt: On the Synchronization of Semi-Traces. 393-403
- Eric Rémila: Tiling with Bars and Satisfaction of Boolean Formulas. 404-413
- Vladimiro Sassone: Axiomatizing Petri Net Concatenable Processes. 414-423
- Klaus-Dieter Schewe: Functional Sorts in Data Type Specifications: A Geometric Approach to Semantics. 424-433
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-17T203624 by the dblp team