


default search action
10th FCT 1995: Dresden, Germany
- Horst Reichel:

Fundamentals of Computation Theory, 10th International Symposium, FCT '95, Dresden, Germany, August 22-25, 1995, Proceedings. Lecture Notes in Computer Science 965, Springer 1995, ISBN 3-540-60249-6
Invited Lectures
- Jos C. M. Baeten, Jan A. Bergstra:

Discrete Time Process Algebra with Abstraction. 1-15 - Chaochen Zhou, Dang Van Hung, Xiaoshan Li:

A Duration Calculus with Infinite Intervals. 16-41 - Kathleen Fisher, John C. Mitchell:

A Delegation-based Object Calculus with Subtying. 42-61 - Kim Guldstrand Larsen, Paul Pettersson

, Wang Yi:
Model-Checking for Real-Time Systems. 62-88 - Ernst W. Mayr

:
On Polynomial Ideals, Their Complexity, and Applications. 89-105
Communications
- Roberto M. Amadio, Lone Leth Thomsen, 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 - Jan A. Bergstra, Gheorghe Stefanescu:

Processes with Multiple Entries and Exits. 136-145 - 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 N. 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 - Bruno Durand, Jacques Mazoyer:

Growing Patterns in 1D Cellular Automata. 211-220 - 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 - Maria C. F. Ferreira, Hans Zantema:

Dummy Elimination: Making Termination Easier. 243-252 - Anja Gronewold, Hans Fleischhack:

Computing Petri Net Languages by Reductions. 253-262 - 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 - Petr Jancar

, Frantisek Mráz
, Martin Plátek, Jörg Vogel:
Restarting Automata. 283-292 - Christoph W. Keßler, Thomas Rauber:

Optimal Continguous Expression DAG Evaluations. 293-302 - Hanna Klaudel, Elisabeth Pelz:

Communication as Unification in the Petri Box Calculus. 303-312 - Manfred Kudlek, Alexandru Mateescu:

Distributed Catenation and Chomsky Hierarchy. 313-322 - Martin Kummer, Frank Stephan:

The Power of Frequency Computation (Extended Abstract). 323-332 - 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 - G. S. Makanin, Habib Abdulrab, M. N. Maksimenko:

Formal Parametric Equations. 353-362 - Rolf Niedermeier, Peter Rossmanith:

PRAM's Towards Realistic Parallelism: BRAM's. 363-373 - Holger 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

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














