The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Gheorghe Stefanescu: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Gheorghe Stefanescu
    Interactive Systems: From Folklore to Mathematics. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 2001, pp:197-211 [Conf]
  2. Gheorghe Stefanescu
    Axiomatizing Mixed Relations. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 1997, pp:177-186 [Conf]
  3. Gheorghe Stefanescu
    On space-time duality in computing: Imperative programming versus wave computation. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 1998, pp:197-201 [Conf]
  4. Radu Grosu, Gheorghe Stefanescu, Manfred Broy
    Visual Formalisms Revisited. [Citation Graph (0, 0)][DBLP]
    ACSD, 1998, pp:41-51 [Conf]
  5. Gheorghe Stefanescu
    An Algebraic Theory of Flowchart Schemes. [Citation Graph (0, 0)][DBLP]
    CAAP, 1986, pp:60-73 [Conf]
  6. Jan A. Bergstra, Gheorghe Stefanescu
    Translations Between Flowchart Schemes and Process Graphs. [Citation Graph (0, 0)][DBLP]
    FCT, 1993, pp:152-161 [Conf]
  7. Jan A. Bergstra, Gheorghe Stefanescu
    Processes with Multiple Entries and Exits. [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:136-145 [Conf]
  8. Virgil Emil Cazanescu, Gheorghe Stefanescu
    A note on axiomatizing flowchart schemes. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1990, v:9, n:4, pp:349-359 [Journal]
  9. Gheorghe Stefanescu
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1999, v:28, n:, pp:- [Journal]
  10. Jan A. Bergstra, Gheorghe Stefanescu
    Processes with Multiple Entries and Exits Modulo Isomorphism and Modulo Bisimulation. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1996, v:27, n:1, pp:37-56 [Journal]
  11. Gheorghe Stefanescu
    Interactive Systems with Registers and Voices. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:73, n:1-2, pp:285-305 [Journal]
  12. Gheorghe Stefanescu
    Reaction and Control I. Mixing Additive and Multiplicative Network Algebras. [Citation Graph (0, 0)][DBLP]
    Logic Journal of the IGPL, 1998, v:6, n:2, pp:348-369 [Journal]
  13. Jan A. Bergstra, Gheorghe Stefanescu
    Bisimulation is Two-Way Simulation. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:52, n:6, pp:285-287 [Journal]
  14. Gheorghe Stefanescu
    On Flowchart Theories. I. The Deterministic Case. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1987, v:35, n:2, pp:163-191 [Journal]
  15. Cristian Calude, Gheorghe Stefanescu
    Automata, Logic, and Computability: J.UCS Special Issue Dedicated to Professor Sergiu Rudeanu Festschrift. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2000, v:6, n:1, pp:1-2 [Journal]
  16. Radu Grosu, Dorel Lucanu, Gheorghe Stefanescu
    Mixed Relations as Enriched Semiringal Categories. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2000, v:6, n:1, pp:112-129 [Journal]
  17. Manfred Broy, Gheorghe Stefanescu
    The algebra of stream processing functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:258, n:1-2, pp:99-129 [Journal]
  18. Virgil Emil Cazanescu, Gheorghe Stefanescu
    A General Result on Abstract Flowchart Schemes with Applications to the Study of Accessibility, Reduction and Minimization. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:99, n:1, pp:1-63 [Journal]
  19. Gheorghe Stefanescu
    On Flowchart Theories: Part II. The Nondeterministic Case. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:52, n:, pp:307-340 [Journal]
  20. Virgil Emil Cazanescu, Gheorghe Stefanescu
    Classes of finite relations as initial abstract data types I. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:90, n:3, pp:233-265 [Journal]
  21. Virgil Emil Cazanescu, Gheorghe Stefanescu
    Classes of finite relations as initial abstract data types - II. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:126, n:1-3, pp:47-65 [Journal]

  22. Defining and Executing P Systems with Structured Data in K. [Citation Graph (, )][DBLP]


  23. On Compiling Structured Interactive Programs with Registers and Voices. [Citation Graph (, )][DBLP]


  24. Undecidability Results for Finite Interactive Systems. [Citation Graph (, )][DBLP]


  25. A sound spatio-temporal Hoare logic for the verification of structured interactive programs with registers and voices [Citation Graph (, )][DBLP]


  26. New parallel programming language design: a bridge between brain models and multi-core/many-core computers? [Citation Graph (, )][DBLP]


  27. Undecidability Results for Finite Interactive Systems [Citation Graph (, )][DBLP]


  28. AGAPIA v0.1: A Programming Language for Interactive Systems and Its Typing System. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.303secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002