| |
| 1999 | ||
|---|---|---|
| 8 | EE | Thomas Schwentick, Klaus Barthelmann: Local Normal Forms for First-Order Logic with Applications to Games and Automata. Discrete Mathematics & Theoretical Computer Science 3(3): 109-124 (1999) |
| 1998 | ||
| 7 | EE | Klaus Barthelmann: When Can an Equational Simple Graph Be Generated by Hyperedge Replacement? MFCS 1998: 543-552 |
| 6 | Thomas Schwentick, Klaus Barthelmann: Local Normal Forms for First-Order Logic with Applications to Games and Automata. STACS 1998: 444-454 | |
| 5 | EE | Klaus Barthelmann: Nondeterministic Operations on Finite Relational Structures. Theor. Comput. Sci. 200(1-2): 1-44 (1998) |
| 1995 | ||
| 4 | EE | Georg Schied, Klaus Barthelmann: Linear types for higher order processes with first class directed channels. Electr. Notes Theor. Comput. Sci. 2: (1995) |
| 1994 | ||
| 3 | Klaus Barthelmann: Process Specification and Verification. TAGT 1994: 225-239 | |
| 1993 | ||
| 2 | Klaus Barthelmann, Georg Schied: Graph-Grammar Semantics of a Higher-Order Programming Language for Distributed Systems. Dagstuhl Seminar on Graph Transformations in Computer Science 1993: 71-85 | |
| 1990 | ||
| 1 | Klaus Barthelmann: Describing Göttler's Operational Graph Grammars with Pushouts. Graph-Grammars and Their Application to Computer Science 1990: 98-112 | |
| 1 | Georg Schied | [2] [4] |
| 2 | Thomas Schwentick | [6] [8] |