| 2008 |
|---|
| 25 | EE | Cezara Dragoi,
Gheorghe Stefanescu:
On Compiling Structured Interactive Programs with Registers and Voices.
SOFSEM 2008: 259-270 |
| 24 | EE | Cezara Dragoi,
Gheorghe Stefanescu:
AGAPIA v0.1: A Programming Language for Interactive Systems and Its Typing System.
Electr. Notes Theor. Comput. Sci. 203(3): 69-94 (2008) |
| 2007 |
|---|
| 23 | EE | Cristian S. Calude,
Gheorghe Stefanescu,
Marius Zimand:
Combinatorics and Related Areas A Collection of Papers in Honour of the 65th Birthday of Ioan Tomescu.
J. UCS 13(11): 1498-1500 (2007) |
| 22 | EE | Alexandru Popa,
Alexandru Sofronia,
Gheorghe Stefanescu:
High-level Structured Interactive Programs with Registers and Voices.
J. UCS 13(11): 1722-1754 (2007) |
| 2006 |
|---|
| 21 | EE | Gheorghe Stefanescu:
Interactive Systems with Registers and Voices.
Fundam. Inform. 73(1-2): 285-305 (2006) |
| 2001 |
|---|
| 20 | EE | Gheorghe Stefanescu:
Interactive Systems: From Folklore to Mathematics.
RelMiCS 2001: 197-211 |
| 19 | EE | Manfred Broy,
Gheorghe Stefanescu:
The algebra of stream processing functions.
Theor. Comput. Sci. 258(1-2): 99-129 (2001) |
| 2000 |
|---|
| 18 | EE | Cristian Calude,
Gheorghe Stefanescu:
Automata, Logic, and Computability: J.UCS Special Issue Dedicated to Professor Sergiu Rudeanu Festschrift.
J. UCS 6(1): 1-2 (2000) |
| 17 | EE | Radu Grosu,
Dorel Lucanu,
Gheorghe Stefanescu:
Mixed Relations as Enriched Semiringal Categories.
J. UCS 6(1): 112-129 (2000) |
| 1999 |
|---|
| 16 | EE | Gheorghe Stefanescu:
Preface.
Electr. Notes Theor. Comput. Sci. 28: (1999) |
| 1998 |
|---|
| 15 | EE | Radu Grosu,
Gheorghe Stefanescu,
Manfred Broy:
Visual Formalisms Revisited.
ACSD 1998: 41-51 |
| 14 | | Gheorghe Stefanescu:
On space-time duality in computing: Imperative programming versus wave computation.
RelMiCS 1998: 197-201 |
| 13 | EE | Gheorghe Stefanescu:
Reaction and Control I. Mixing Additive and Multiplicative Network Algebras.
Logic Journal of the IGPL 6(2): 348-369 (1998) |
| 1997 |
|---|
| 12 | | Gheorghe Stefanescu:
Axiomatizing Mixed Relations.
RelMiCS 1997: 177-186 |
| 1996 |
|---|
| 11 | | Jan A. Bergstra,
Gheorghe Stefanescu:
Processes with Multiple Entries and Exits Modulo Isomorphism and Modulo Bisimulation.
Fundam. Inform. 27(1): 37-56 (1996) |
| 1995 |
|---|
| 10 | | Jan A. Bergstra,
Gheorghe Stefanescu:
Processes with Multiple Entries and Exits.
FCT 1995: 136-145 |
| 1994 |
|---|
| 9 | EE | Virgil Emil Cazanescu,
Gheorghe Stefanescu:
Classes of finite relations as initial abstract data types - II.
Discrete Mathematics 126(1-3): 47-65 (1994) |
| 8 | | Jan A. Bergstra,
Gheorghe Stefanescu:
Bisimulation is Two-Way Simulation.
Inf. Process. Lett. 52(6): 285-287 (1994) |
| 1993 |
|---|
| 7 | | Jan A. Bergstra,
Gheorghe Stefanescu:
Translations Between Flowchart Schemes and Process Graphs.
FCT 1993: 152-161 |
| 1992 |
|---|
| 6 | | Virgil Emil Cazanescu,
Gheorghe Stefanescu:
A General Result on Abstract Flowchart Schemes with Applications to the Study of Accessibility, Reduction and Minimization.
Theor. Comput. Sci. 99(1): 1-63 (1992) |
| 1991 |
|---|
| 5 | EE | Virgil Emil Cazanescu,
Gheorghe Stefanescu:
Classes of finite relations as initial abstract data types I.
Discrete Mathematics 90(3): 233-265 (1991) |
| 1990 |
|---|
| 4 | | Virgil Emil Cazanescu,
Gheorghe Stefanescu:
A note on axiomatizing flowchart schemes.
Acta Cybern. 9(4): 349-359 (1990) |
| 1987 |
|---|
| 3 | | Gheorghe Stefanescu:
On Flowchart Theories. I. The Deterministic Case.
J. Comput. Syst. Sci. 35(2): 163-191 (1987) |
| 2 | | Gheorghe Stefanescu:
On Flowchart Theories: Part II. The Nondeterministic Case.
Theor. Comput. Sci. 52: 307-340 (1987) |
| 1986 |
|---|
| 1 | | Gheorghe Stefanescu:
An Algebraic Theory of Flowchart Schemes.
CAAP 1986: 60-73 |
