Sciweavers

155
Voted
CAAP
1994
15 years 4 months ago
Some Results on Top-Context-Free Tree Languages
Top-context-free tree languages (called cor gulier by Arnold and Dauchet 1, 2]) constitute a natural subclass of context-free tree languages. In this paper, we give further evidenc...
Dieter Hofbauer, Maria Huber, Gregory Kucherov
GI
1994
Springer
15 years 4 months ago
Tool-Based Business Process Modeling Using the SOM Approach
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...
Otto K. Ferstl, Elmar J. Sinz, Michael Amberg, Udo...
MFCS
1994
Springer
15 years 4 months ago
A Proof System for Asynchronously Communicating Deterministic Processes
We introduce in this paper new communication and synchronization constructs which allow deterministic processes, communicating asynchronously via unbounded FIFO bu ers, to cope wi...
Frank S. de Boer, M. van Hulst
135
Voted
STACS
1994
Springer
15 years 4 months ago
On the Complexity of the Maximum Cut Problem
The complexity of the simple maxcut problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the follo...
Hans L. Bodlaender, Klaus Jansen
Theoretical Computer Science
Top of PageReset Settings