Conferences in DBLP

Fundamentals of Computation Theory (FCT) (fct)
1995 (conf/fct/1995)

1. Jos C. M. Baeten, Jan A. Bergstra
   Discrete Time Process Algebra with Abstraction. [Citation Graph (0, 0)][DBLP]
   FCT, 1995, pp:1-15 [Conf]
   
2. Chaochen Zhou, Dang Van Hung, Xiaoshan Li
   A Duration Calculus with Infinite Intervals. [Citation Graph (0, 0)][DBLP]
   FCT, 1995, pp:16-41 [Conf]
   
3. Kathleen Fisher, John C. Mitchell
   A Delegation-based Object Calculus with Subtying. [Citation Graph (0, 0)][DBLP]
   FCT, 1995, pp:42-61 [Conf]
   
4. Kim Guldstrand Larsen, Paul Pettersson, Wang Yi
   Model-Checking for Real-Time Systems. [Citation Graph (0, 0)][DBLP]
   FCT, 1995, pp:62-88 [Conf]
   
5. Ernst W. Mayr
   On Polynomial Ideals, Their Complexity, and Applications. [Citation Graph (0, 0)][DBLP]
   FCT, 1995, pp:89-105 [Conf]
   
6. Roberto M. Amadio, Lone Leth, Bent Thomsen
   From a Concurrent Lambda-Calculus to the Pi-Calculus. [Citation Graph (0, 0)][DBLP]
   FCT, 1995, pp:106-115 [Conf]
   
7. Valentin M. Antimirov
   Rewriting Regular Inequalities (Extended Abstract). [Citation Graph (0, 0)][DBLP]
   FCT, 1995, pp:116-125 [Conf]
   
8. Gilles Barthe
   A Simple Abstract Semantics for Equational Theories. [Citation Graph (0, 0)][DBLP]
   FCT, 1995, pp:126-135 [Conf]
   
9. Jan A. Bergstra, Gheorghe Stefanescu
   Processes with Multiple Entries and Exits. [Citation Graph (0, 0)][DBLP]
   FCT, 1995, pp:136-145 [Conf]
   
10. Michael Bertol
    Efficient Rewriting in Cograph Trace Monoids. [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:146-155 [Conf]
    
11. Cristian Calude, Marius Zimand
    Effective Category and Measure in Abstract Complexity Theory (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:156-170 [Conf]
    
12. Thomas Chaboud
    About Planar Cayley Graphs. [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:171-180 [Conf]
    
13. Victor Chepoi, Feodor F. Dragan
    On Condorcet and Median Points of Simple Rectilinear Polygons (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:181-190 [Conf]
    
14. Hristo Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis
    Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs. [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:191-200 [Conf]
    
15. Feodor F. Dragan, Falk Nicolai
    r-Domination Problems on Homogeneously Ordered Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:201-210 [Conf]
    
16. Bruno Durand, Jacques Mazoyer
    Growing Patterns in 1D Cellular Automata. [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:211-220 [Conf]
    
17. Javier Esparza
    Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes. [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:221-232 [Conf]
    
18. Heinz Faßbender
    Implementation of a UU-Algorithm for Primitive Recursive Tree Functions. [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:233-242 [Conf]
    
19. Maria C. F. Ferreira, Hans Zantema
    Dummy Elimination: Making Termination Easier. [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:243-252 [Conf]
    
20. Anja Gronewold, Hans Fleischhack
    Computing Petri Net Languages by Reductions. [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:253-262 [Conf]
    
21. Erik de Haas
    Categorial Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:263-272 [Conf]
    
22. 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). [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:273-282 [Conf]
    
23. Petr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel
    Restarting Automata. [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:283-292 [Conf]
    
24. Christoph W. Keßler, Thomas Rauber
    Optimal Continguous Expression DAG Evaluations. [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:293-302 [Conf]
    
25. Hanna Klaudel, Elisabeth Pelz
    Communication as Unification in the Petri Box Calculus. [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:303-312 [Conf]
    
26. Manfred Kudlek, Alexandru Mateescu
    Distributed Catenation and Chomsky Hierarchy. [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:313-322 [Conf]
    
27. Martin Kummer, Frank Stephan
    The Power of Frequency Computation (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:323-332 [Conf]
    
28. Ngoc-Minh Lê
    Randomized Incremental Construction of Simple Abstract Voronoi Diagrams in 3-Space (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:333-342 [Conf]
    
29. Ioan I. Macarie, Mitsunori Ogihara
    Properties of Probabilistic Pushdown Automata (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:343-352 [Conf]
    
30. G. S. Makanin, Habib Abdulrab, M. N. Maksimenko
    Formal Parametric Equations. [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:353-362 [Conf]
    
31. Rolf Niedermeier, Peter Rossmanith
    PRAM's Towards Realistic Parallelism: BRAM's. [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:363-373 [Conf]
    
32. H. Petersen
    Some Results Concerning Two-Dimensional Turing Machines and Finite Automata. [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:374-382 [Conf]
    
33. Giovanni Pighizzini
    How Hard is to Compute the Edit Distance. [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:383-392 [Conf]
    
34. Klaus Reinhardt
    On the Synchronization of Semi-Traces. [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:393-403 [Conf]
    
35. Eric Rémila
    Tiling with Bars and Satisfaction of Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:404-413 [Conf]
    
36. Vladimiro Sassone
    Axiomatizing Petri Net Concatenable Processes. [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:414-423 [Conf]
    
37. Klaus-Dieter Schewe
    Functional Sorts in Data Type Specifications: A Geometric Approach to Semantics. [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:424-433 [Conf]