13306 search results - page 423 / 2662 » Theoretical Computer Science |
175
click to vote
RTA
1997
Springer
15 years 11 months ago
1997
Springer
Series-parallel orders are de ned as the least class of partial orders containing the one-element order and closed by ordinal sum and disjoint union. From this inductive de nition,...
157
click to vote
RTA
1997
Springer
15 years 11 months ago
1997
Springer
We present a technique to prove innermost normalisation of term rewriting systems TRSs automatically. In contrast to previous methods, our technique is able to prove innermost n...
184
click to vote
STACS
1997
Springer
15 years 11 months ago
1997
Springer
Abstract. This paper deals with simulation and reversibility in the context of Cellular Automata (ca). We recall the de nitions of ca and of the Block (bca) and Partitioned (pca) s...
179
click to vote
WG
1997
Springer
15 years 11 months ago
1997
Springer
In this paper we present a parallel algorithm that decides whether a graph G has treewidth at most two, and if so, construct a tree decomposition or path decomposition of minimum ...
228
click to vote
GI
1994
Springer
15 years 11 months ago
1994
Springer
Business processes play an important role in analyzing and designing a company's behaviour and organization. Modeling business processes is an integral part of the Semantic O...