English Version


Data si locul nasterii: 4 august 1975, Curtea-de-Arges, Arges.

Educatia: Absolvent al Facultatii de Matematica, Universitatea Bucuresti, 1998. Master's of Science, Informatica, University of Western Ontario, Canada, 1999.
Teza de doctorat: "Unconventional models of computation: DNA and membrane computing", University of Western Ontario, Canada, 2003. Cond. stiintific: Dr. Sheng YU.
Pozitii academice: Conferentiar Universitar, Cercetator Stiintific gradul I (INCDSB), Conducator de doctorat in SUA din 2004 (3 doctoranzi supervizati ca unic conducator).
Cursuri predate: Limbaje formale, Retele de calculatoare, Analiza algoritmilor, Programare orientata pe obiecte, Programare in asamblare pentru microprocesoarele Intel, Introducere in Bioinformatica, Elemente de Biocomputing, Programare Procedurala etc.
Domenii de interes stiintific: Limbaje formale si automate, modele de calcul inspirat din biologie, Systems Biology si bioinformatica, simulare de fenomene intra-celulare in special cascadele de reactii legate de apoptoza.
Pagina personala: http://funinf.cs.unibuc.ro/~apaun/.

Premii si distinctii

Lucrarea: "The Power of Communication: P Systems with Symport/Antiport" a fost selectata de catre Thomson ISI Essential Science Indicators ca lucrare foarte influenta/citata si este estimata ca fiind intre cele mai bune 1% lucrari din domeniu. Fraza exacta de pe certificatul de la ISI este: "This means that the number of citations your article received places it in the top 1% within its field according to Essential Science Indicators. Your work is highly influential, and is making a significant impact among your colleagues in your field of study."

Membru in comisii, asociatii, colective de redactie

  • Membru in PC la conferinte academice internationale:
    • Program Committee member for Sixteenth International Meeting on DNA Computing (DNA 16), Hong Kong, China, June 14-17, 2010
    • Program Committee member for Fifteenth International Conference on Implementation and Application of Automata (CIAA2010) (Winnipeg, Manitoba, Canada, August 12-15, 2010)
    • Program Committee member for the 6th International Symposium on Bioinformatics Research and Applications (ISBRA'10), to be held on May 23-26, 2010 at the University of Connecticut in Storrs, CT.\
    • Program Committee member for Fifteenth International Meeting on DNA Computing (DNA 15), Fayetteville, Arkansas, USA, 2009
    • Program Committee member for Thirteenth International Conference on Implementation and Application of Automata (CIAA2008) (Santa Barbara, 2008)
    • Publicity Committee Co-Chair for Thirteenth International Conference on Implementation and Application of Automata (CIAA2008) (Santa Barbara, 2008)
    • Program Committee member for Third International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA 2008) Adelaide, Australia, 2008.
    • Program Committee member for First International Conference on Contemporary Computing (NOIDA, (outskirts of New Delhi), India 2008)
    • Program Committee member for Language Theory in Biocomputing 07 (Kingston, Canada 2007)
    • Program Committee member for Thirteenth International Meeting on DNA Computing (DNA13) (Memphis, USA, 2007)
    • Program Committee member for Eleventh International Conference on Implementation and Application of Automata (CIAA06) (Taipei, Taiwan 2006).
    • Student committee chair and organizer of UWORCS2002: U.W.O. Research in Computer Science, (London, Canada, 2002).
    • Organizing committee member for Fifth International Conference on Implementation and Application of Automata (CIAA 2000) and Half Century of Automata Theory Celebration and Inspiration (HCAT), London, Ontario, Canada, 2000.

Lucrari publicate in reviste internationale

  1. *O.H. Ibarra, A. Paun, A. Rodriguez-Paton, Sequential SNP systems based on min/max spike number, Theoretical Computer Science, vol. 410, iss. 30-32 (2009), 2982-2991 (Factor de impact ISI: 0,843).
  2. *A. Paun, M. Paun, A. Rodriguez-Paton, On the Hopcroft's minimization technique for DFA and DFCA, Theoretical Computer Science, vol. 410, iss. 24-25 (2009), 2424-2430 (Factor de impact ISI: 0,843).
  3. * J. Jack, A. Paun, A. Rodriguez-Paton, Discrete nondeterministic modeling of the FAS pathway, International Journal of Foundations of Computer Science, vol. 19 (October 2008), no. 5, pp. 1147-1162. (Factor de impact ISI:0,500)
  4. H. Chen, M. Ionescu, T.O. Ishdorj, A. Paun, Gh.Paun, M. Perez-Jimenez, Spiking neural P systems with extended rules: universality and languages. Nat. Comput. 7 (2008), no. 2, pp. 147-166. (revista ISI).
  5. O.H. Ibarra, A. Paun, Computing with Cells: Membrane Systems - Some Complexity Issues, International Journal of Parallel, Emergent and Distributed Systems, 23:5, 2008, pp. 347 -365
  6. O.H. Ibarra, S. Woodworth, F. Yu, A. Paun, On spiking neural P systems and partially blind counter machines. Nat. Comput. 7 (2008), no. 1, pp. 3–19. (revista ISI).
  7. A. Paun, Gh. Paun, Small universal spiking neural P systems, BioSystems, 90 (1), 2007, pp. 48-60. (Factor de impacto ISI:1,080)
  8. O. H. Ibarra, A. Paun, Gh. Paun, A. Rodriguez-Paton, P. Sosik, S. Woodworth; Normal forms for spiking neural P systems. Theoretical Computer Science 372(2-3), 2007, 196-217. (Factor de impact ISI: 0,843).
  9. *S. Cheruku, A. Paun, F.J. Romero-Campero, M.J. Perez-Jimenez, O.H. Ibarra; Simulating FAS-induced apoptosis by using P systems. Progress in Natural Science, 17(4), 2007, pp. 424-431. (Factor de impact ISI:0,531).
  10. *A. Paun, B. Popa; P Systems with Proteins on Membranes. Fundamenta Informaticae, 72, 4, 2006, 467-483. (Factor de impact ISI:0,586).
  11. *C. Campeanu, A. Paun, J.R. Smith, Incremental construction of minimal deterministic finite cover automata. Theoretical Computer Science, 363(2), 2006, 135-148 (Factor de impact ISI: 0,843).
  12. R. Freund, M. Oswald, A. Paun, Optimal Results for the Computational Completeness of Gemmating (Tissue) P Systems, International Journal of Foundations of Computer Science, 16(5), (2005), pp. 929-942. (Factor de impact ISI:0,500)
  13. *C. Campeanu, L. Kari, A. Paun, Results on Transforming NFA into DFCA, Fundamenta Informaticae, Vol 64 (2005), pp. 53-63. (Factor de impact ISI:0,586).
  14. R. Freund, A. Paun, P systems with active membranes and without polarizations, Journal of Universal Computer Science and Soft Computing, 9 (9), (2005), pp.657-663. (Factor de impact ISI:0,516)
  15. *S.N. Krishna, A. Paun, Results on Catalytic and Evolution-Communication P Systems, New Generation Computing, 22, 4 (2004), pp. 377-394. (Factor de impact ISI:0,694)
  16. *C. Campeanu, A. Paun, Counting the Number of Minimal DFCA Obtained by Merging States, International Journal of Foundations of Computer Science, Vol. 14, No. 6 (2003), pp. 995-1006. (Factor de impact ISI:0,500)
  17. R. Belu, A. Paun, A. Belu, Neural Networks in Instrumentation, Measurement and Control, Romanian Journal of Information Science and Technology, Vol. 6, No. 1-2, (2003), pp. 61-85. (ISI journal).
  18. M. Ionescu, C. Martin-Vide, A. Paun, Gh. Paun, Unexpected universality results for three classes of P systems with symport/antiport, Natural Computing, Vol. 2, issue 4, (2003), pp. 337-348. (revista ISI).
  19. A. Paun, Gh. Paun, G. Rozenberg, Computing by Communication in Networks of Membranes, International Journal of Foundations of Computer Science, Vol. 13, No. 6 (2002), pp. 779-798. (Factor de impact ISI:0,500)
  20. *C. Martin-Vide, A. Paun, G. Rozenberg, Membrane Systems with Coupled Transport: Universality and Normal Forms, Fundamenta Informaticae, 49, 1-3 (2002), pp. 1-15. (Factor de impact ISI:0,586).
  21. *A. Paun, Gh. Paun, The Power of Communication: P Systems with Symport /Antiport, New Generation Computing, 20, 3 (2002), pp. 295-305. (Factor de impact ISI:0,694)
  22. *A. Paun, P Systems with Global Rules, Theory Comput. Systems, 35, (2002), pp. 471-481. (Factor de impact ISI:0,769).
  23. *C. Campeanu, A. Paun, S. Yu, An Efficient Algorithm for Constructing Minimal Cover Automata for Finite Languages, International Journal of Foundations of Computer Science, 13, 1 (2002), pp. 83-97. (Factor de impact ISI:0,500)
  24. *A. Paun, On P Systems with Partial Parallel Rewriting, Romanian Journal of Information Science and Technology, 4, 1-2 (2001), pp. 203-210. (revista ISI).
  25. L. Kari, A. Paun, String Operations Suggested by DNA Biochemistry: the Balanced Cut Operation, Words, Semigroups & Transductions (M. Ito, et. al., eds.), World Scientific, Singapore, 2001, pp. 275-287.
  26. *A. Paun, On the Diameter of Various Classes of H Systems, J. Automata, Languages and Combinatorics, 5, 3 (2000), pp. 315-324.
  27. A. Paun, On Time-Varying H systems, Bulletin of the EATCS, 67 (1999), pp. 157-164.
  28. *A. Paun, Controlled H Systems of a Small Radius, Fundamenta Informaticae, 31, 2 (1997), pp. 185-193. (Factor de impact ISI:0,586).

Lucrari la conferinte (toate referite de comitete internationale)

  1. O.H. Ibarra, A. Paun, A. Rodriguez-Paton, Sequentiality Induced by Spike Number in SNP Systems, Pre-proceedings of Fourteenth meeting on DNA Computing (DNA14), June 2-6, 2008, Prague, Czech Republic, pp. 36-47.
  2. J. Jack, A. Paun, A. Rodriguez-Paton, Effects of HIV-1 Proteins on the Fas-Mediated Apoptotic Signaling Cascade: A Computational Study of Latent CD4+ T Cell Activation, accepted at Ninth Workshop on Molecular Computation, WMC9, Edinburgh (UK) July 28-31, 2008, 20pp.
  3. A. Paun, M. Paun, A. Rodriguez-Paton, Hopcroft's minimization technique: queues or stacks?, CIAA 13, July 21-24, 2008, San Francisco, USA, Lecture Notes in Computer Science, Berlin, vol. 5148, 2008, pp. 78-91.
  4. A. Paun, B. Popa, P Systems with Proteins on Membranes and Membrane Division, Proc of. Tenth International Conference Developments in Language Theory (DLT 2006), June 26-29, 2006, Santa Barbara, CA, USA, Lecture Notes in Computer Science, Berlin, vol. 4036, 2006 pp. 292-303
  5. H. Nagda, A. Paun, A. Rodriguez-Paton, P Systems with Symport/Antiport and Time, Proc. of Workshop on Membrane Computing (at the crossroads of Cell Biology and Computing), WMC07, 17-21 July 2006, Lecture Notes in Computer Science, Berlin, vol. 4361, 2006, pp. 429-442.
  6. C. Campeanu, A. Paun, J. R. Smith, Tight Bounds for the State Complexity of Deterministic Cover Automata, Proc. of Descriptional Complexity of Formal Systems, 8th Workshop, June 21-23, 2006, Las Cruces, New Mexico, USA (9 pages).
  7. M. Ionescu, A. Paun, Gh. Paun, M.J. Perez-Jimenez, Computing with Spiking Neural P Systems: Traces and Small Universal Systems, Proc. of 12th Intern. Meeting on DNA Based Computers (DNA 2006), June 5-9, Seoul, Korea, Lecture Notes in Computer Science, Berlin, vol. 4287, 2006, pp. 1-16.
  8. O.H. Ibarra, S. Woodworth, F. Yu, A. Paun, On Spiking Neural P Systems and Partially Blind Counter Machines. Proc. Of 5th International Conference on Unconventional Computation (UC 2006), 4th-8th September 2006, York, UK, Lecture Notes in Computer Science, Berlin, vol. 4135, 2006, pp. 113-129.
  9. C. Campeanu, A. Paun, J. R. Smith, An Incremental Algorithm for Minimal Deterministic Finite Cover Automata, Proc. of Tenth International Conference on Implementation and Application of Automata (CIAA05), June 27–29, 2005, Sophia Antipolis, France, pp. 90-103; (the conference had approximately 30% acceptance rate) also in Lecture Notes in Computer Science, Berlin, vol. 3845, 2006, pp. 90-103.
  10. O.H. Ibarra, A. Paun, Counting Time in Computing with Cells, Proc. of 11th Intern. Meeting on DNA Based Computers (DNA11), June 6-9, 2005, London Ontario, Canada, pp. 112-128, also in Lecture Notes in Computer Science, Berlin, vol. 3892, 2006, pp. 112-128.
  11. C. Campeanu, A. Paun, NFA to DFCA Transformations For Binary Alphabets, Proc. of Ninth International Conference on Implementation and Application of Automata (CIAA 2004), Kingston, Canada (2004).
  12. C. Campeanu, A. Paun, Lower Bounds for NFA to DFCA Transformations, Proc. of Descriptional Complexity of Formal Systems, 6th Workshop, London, Ontario, Canada (2004) (10 pages).
  13. R. Freund, M. Oswald, A. Paun, Extended Gemmating P Systems are Computationally Complete with Four Membranes, Proc. of Descriptional Complexity of Formal Systems, 6th Workshop, London, Ontario, Canada (2004) (10 pages).
  14. R. Freund, M. Oswald, A. Paun, P systems generating trees, Proc. of Workshop on Membrane Computing 2004 (WMC5), Milano, Italy, 2004, pp. 221-232 also in Lecture Notes in Computer Science, 3365, Berlin, (2004), pp. 309-319.
  15. C. Campeanu, A. Paun, Computing Beyond the Turing Limit Using the H Systems, Proc. of the Tenth International Meeting on DNA Computing (DNA10), Milan, (2004), pp. 314-323 also in Lecture Notes in Computer Science, 3384, Berlin, (2005), pp. 24-34.
  16. F. Bernardini, A. Paun, Universality of Minimal Symport/Antiport: Five Membranes Suffice, Lecture Notes in Computer Science, 2933, Berlin, (2004), pp. 43-54.
  17. R. Freund, A. Paun, Membrane Systems with Symport/Antiport: Universality Results, Lecture Notes in Computer Science, 2597, Berlin, (2003), pp. 270-287.
  18. C. Campeanu, A. Paun, The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata, Proc. of 7th International Conference on Implementation and Application of Automata (CIAA 2002), Tours, France, 2002, pp. 71-80.
  19. M. Ionescu, C. Martin-Vide, A. Paun, Gh. Paun, Membrane Systems with Symport/Antiport: (Unexpected) Universality Results, Proc. of 8th Intern. Meeting on DNA Based Computers (DNA8) (M. Hagiya, A. Obuchi, eds.), Hokkaido University, Sapporo, Japan, 2002, pp. 151-160.
  20. A. Paun, P Systems with string-objects: Universality results, Proc. of Workshop on Membrane Computing (WMC-CdeA 2001), Curtea-de-Arges, Romania, 2001, pp. 229-242.
  21. A. Paun, On P Systems with Global Rules. Proc. of 7th Intern. Meeting on DNA Based Computers (DNA7) (N. Jonoska, N.C. Seeman, eds.), Tampa, Florida, USA, 2001, pp. 43-52.
  22. A. Paun, On P Systems with Active Membranes, Proc. of UMC2K, in Discrete Mathematics and Theoretical Computer Science, Springer (I. Antoniou, C.S. Calude, M.J. Dinneen, eds.), Brussels, Belgium, 2000, pp. 187-201.
  23. A. Paun, N. Santean, S. Yu, An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages, Proc. of Fifth International Conference on Implementation and Application of Automata (CIAA 2000) (M. Daley, M. Eramian, S. Yu, eds.), London, Ontario, 2000, pp. 233-241.
  24. A. Paun, On the Diameter of Various Classes of H Systems, Proc. of Intern. Workshop on Descriptional Complexity of Automata, Grammars and Related Structures (DCAGRS '99) (J. Dassow, D. Wotschke, eds.), Magdeburg, Germany, 1999, pp. 165-174.
  25. A. Paun, M. Paun, State and Transition Complexity of Watson-Crick Finite Automata, Proc. of Fundamentals of Computation Theory Conf. (FCT'99) Iasi, 1999, Lecture Notes in Computer Science, 1684, Springer-Verlag, Berlin, 1999, pp. 409-420.
  26. A. Paun, M. Paun, Controlled and Distributed H Systems of a Small Radius, Computing with Bio-Molecules; Theory and Experiments, Springer, Singapore, 1998, pp. 239-254.

Rapoarte tehnice

  1. R. Freund, A. Paun, P Systems with Active Membranes and without Polarizations, Dept. of Computer Sciences and Artificial Intelligence, Univ. of Sevilla Tech. Rep 01/2004, Second Brainstorming Week on Membrane Computing, Sevilla, Spain, Feb 2-7, 2004, pp. 193-205.
  2. S.N. Krishna, A. Paun, Some Universality Results on Evolution-Communication P Systems, Rovira i Virgili Univ., Tech. Rep. No. 26, Brainstorming Week on Membrane Computing; Tarragona, 2003, pp. 207-215.
  3. S.N. Krishna, A. Paun, Three Universality Results on P Systems, Rovira i Virgili Univ., Tech. Rep. No. 26, Brainstorming Week on Membrane Computing; Tarragona, 2003, pp. 198-206.
  4. A. Paun, A. Rodriguez-Paton, Further Remarks on P Systems with Symport Rules, An. Stiint. Univ. Al. I. Cuza Iasi Inform. 10 (2001), pp. 3-18.
  5. A. Paun, M. Paun, On the Membrane Computing Based on Splicing, Where Mathematics, Computer Science, Linguistics and Biology Meet (C. Martin-Vide, V. Mitrana, eds.), Kluwer, Dordrecht, 2001, pp. 409-422.

Capitole de carte

  1. O.H. Ibarra, A. Paun, Membrane Systems: A "Natural" Way of Computing with Cells, book chapter (chapter 3, 26 pages), in S. Rajasekaran, J.Reif, eds., Handbook of Parallel Computing: Models, Algorithms and Applications (Chapman & Hall/Crc Computer & Information Science Series), 2007, ISBN: 978-1584886235.
  2. A. Paun, I. Stanciu, A. Bancila, B. Popa, Calculabilitatea pe baza de membrane si proteine, book chapter in Bioinformatica vol II, Editura Tehnica, 131 pagini, 2008, ISBN: 978-973-31-2342-2.
  3. R. Freund, O. Ibarra, A. Paun, P. Sosik, H-C. Yen, Catalytic P systems, book chapter in Membrane Computing Handbook, to appear.
  4. O.H Ibarra, A. Leporati, A. Paun, S. Woodworth, Spiking Neural P Systems: Characterizations and Complexity, book chapter in Membrane Computing Handbook, to appear.

Carti

  1. A. Paun, Computability of the DNA and Cells: Splicing and Membrane Computing, SBEB Publishing, 378 pages, 2008, ISBN: 978-0-9802368-4-2.
  2. S. Yu, A. Paun, eds., Implementation and Application of Automata, Lecture Notes in Computer Science 2088, Springer-Verlag, Berlin, 2001. ISBN: 978-3540424918.
  3. A. Paun, M. Paun, Analiza Statistica Folosind Limbajul R, Editura Matrix, Bucuresti, 2009



Prof.dr. Stefanescu Gheorghe - Director de departament

  


Data si locul nasterii: 5 octombrie 1955, Valea Mare Pravat (Arges).

Educatia: Absolvent al Facultatii de Matematica, Universitatea din Bucuresti, 1979. Master, idem, 1980.
Teza de doctorat: Ph. D. "Determinism si nedeterminism in teoria schemelor de programe; aspecte algebrice'', 1991, Facultatea de Matematica, Universitatea din Bucuresti. Conducator stiintific: Prof.Dr. Sergiu Rudeanu.
Pozitii academice: Matematician: 1980; Cercetator stiintific: 1983; Cercetator principal III: 1990; Conferentiar: 1995; Profesor: 2000.
Domenii de interes stiintific: Calcul paralel si distribuit; Algebra proceselor si retelelor; Semantica limbajelor de programare; Programarea orientata pe obiecte; Logica algebrica si categoriala; Aplicatii ale teoriei categoriilor in logica si informatica.
Cursuri predate: Bazele informaticii, Modele de calcul paralel, Metode formale in dezvoltarea de Soft, Modele de calcul paralel si concurenta, Fundamentele algebrice ale informaticii, Scheme de programe, Programarea orientata pe obiecte.

Membru al unor organizatii profesionale: AMS (American Mathematical Society); EATCS (European Association for Theoretical Computer Science); EACSL (European Association for Computer Science Logics).
Recenzor la Matematical Reviews.

Carti si manuale

  1. Network Algebra, Gh.Stefanescu. Springer-Verlag, Berlin Heidelberg New York London Paris Tokyo Hong Kong Barcelona Budapest, 2000, 424pp. ISBN: 1-85233-195-X
  2. Algebra of flownomials, Gh. Stefanescu, Institute for Informatics, Technical University Munich, 1994, 158pp.
  3. Automata, Logic, and Computability, C.S. Calude, Gh. Stefanescu (eds.). Special issue dedicated to Professor Sergiu Rudeanu Festschrift, Journal of Universal Computer Science, Volume 6(1), January, 2000.
  4. Proceedings of FCT'99 Workshop on Distributed Systems, Gh. Stefanescu (ed.), Electronic Notes in Theoretical Computer Science, Volume 28, Elsevier Science, 2000.

Articole stiintifice

  1. Flow algebras. A. Baranga, V.E. Cazanescu si Gh. Stefanescu. Analele Universitatii Bucuresti, Matematica-Informatica, 41, (2)(1992), 21-34.
  2. Bisimulation is two-way simulation. J.A. Bergstra si Gh. Stefanescu. Information Processing Letters, 52(1994), 285-287.
  3. Processes with multiple entries and exits modulo isomorphism and modulo bisimulation. J.A. Bergstra si Gh. Stefanescu. Fundamenta Informaticae, 27(1996), 37-56.
  4. Network algebra with demonic relation operators. J.A. Bergstra si Gh. Stefanescu. Revues Roumaine de Mathematiques Pures et Applique, 43(5-6)(1998), 503-520.
  5. Network algebra for synchronous and asynchronous dataflow. J.A. Bergstra, C.A. Middelburg si Gh. Stefanescu. International Journal of Computer Mathematics, 65(1-2)(1997), 57-88 [ISI-319]
  6. Notes on equational theories of relations. S.L. Bloom, Z. Esik si Gh. Stefanescu. Algebra Universalis, 33(1995), 98-126.
  7. The algebra of stream processing functions. M. Broy and Gh. Stefanescu. Theoretical Computer Science, 251(2000).
  8. On the category of ordered algebras. V.E. Cazanescu and Gh. Stefanescu. Studii si Cercetari Matematice (Mathematical Reports), 34(1982), 235-252. (in Romanian).
  9. Some properties of pointed algebraic theories. V.E. Cazanescu si Gh. Stefanescu. Studii si Cercetari Matematice (Mathematical Reports), 39(1987), 107-115. (in Romanian)
  10. A formal representation of flowchart schemes. V.E. Cazanescu si Gh. Stefanescu. Analele Universitatii Bucuresti, Matematica-Informatica, 37(2)(1988), 33-51.
  11. A formal representation of flowchart schemes - II. V.E. Cazanescu si Gh. Stefanescu. Studii si Cercetari Matematice (Mathematical Reports), 41(1989), 151-167.
  12. Towards a new algebraic foundation of flowchart scheme theory. V.E. Cazanescu si Gh. Stefanescu. Fundamenta Informaticae, 13(1990), 171-210.
  13. A note on axiomatizing flowchart schemes. V.E. Cazanescu si Gh. Stefanescu. Acta Cybernetica, 9(1990), 349-359.
  14. Classes of finite relations as initial abstract data types - I. V.E. Cazanescu si Gh. Stefanescu. Discrete Mathematics, 90(1991), 233-265.
  15. A general result on abstract flowchart schemes with applications to the study of accessibility, reduction and minimization. V.E. Cazanescu si Gh. Stefanescu. Theoretical Computer Science, 99(1992), 1-63. (Fundamental Study)
  16. Classes of finite relations as initial abstract data types - II. V.E. Cazanescu si Gh. Stefanescu. Discrete Mathematics, 126(1994), 47-65.
  17. Mixed relations as enriched semiringal categories, R. Grosu, D. Lucanu si Gh. Stefanescu. Journal of Universal Computer Science, 6(1)(2000), 112-129.
  18. Characterisation of effective universal monomorphisms in the categories of universal algebras and algebraic systems. Gh. Stefanescu. Studii si Cercetari Matematice (Mathematical Reports), 34(1982), 490-497. (in Romanian)
  19. On flowchart theories. Part I. The deterministic case. Gh. Stefanescu. Journal of Computer and Systems Sciences, 35(1987), 163-191.
  20. On flowchart theories. Part II. The nondeterministic case. Gh. Stefanescu. Theoretical Computer Science, 52(1987), 307-340.
  21. Feedback theories (a calculus for isomorphism classes of flowchart schemes). Gh. Stefanescu. Revues Roumaine de Mathematiques Pures et Applique, 35(1990), 73-79.
  22. Reaction and control I. Mixing additive and multiplicative network algebras. Gh. Stefanescu. Journal of Interest Group in Pure and Applied Logic, 6(2)(1998), 349-368. (Logic Journal of the IGPL, Oxford University Press).
  23. Some examples of semiringal categories. Gh. Stefanescu. Annals of the Bucharest University, Mathematics-Informatics Series, 47(1998), 103-108.
  24. Process algebra with feedback. J.C.M. Baeten, J.A. Bergstra si Gh. Stefanescu. In: Modal Logic and Process Algebra, Proceedings of the Workshop "Three Days of Bisimulation" held at Amsterdam, The Netherlands, 1994. Eds., A. Ponse, M. de Rijke, and Y. Venema. CSLI Lecture Notes No. 53, Stanford, 1995, 13-37.
  25. Translations between flowchart schemes and process graphs. J.A. Bergstra si Gh. Stefanescu. In: Proceedings of the 9th International Conference on Fundamentals of Computation Theory held at Szeged, Hungary, 1993, Ed. Z. Esik. Lecture Notes in Computer Science, 710, Springer-Verlag, Berlin, 1993, pp. 152-161.
  26. Processes with multiple entries and exits. J.A. Bergstra si Gh. Stefanescu. In: Proceedings of the 10th International Conference on Fundamentals of Computation Theory FCT'95 held at Dresden, Germany, 1995. Ed. Reichel, H., Lecture Notes in Computer Science, 965, Springer-Verlag, Berlin, 1995, 136-145.
  27. Equational theories of relations and regular sets. L. Barnatsky, S.L. Bloom, Z. Esik, si Gh. Stefanescu. In: Proceedings of the 2nd Conference on "Words, Languages and Combinatorics" held at Kyoto, Japan, 1992, Eds. M. Ito and H. Jürgensen. World Scientific, 1994, 40-48.
  28. A calculus for flowchart schemes. V.E. Cazanescu si Gh. Stefanescu. In: Abstracts of the 8th International Cogress of Logic, Methodology and Philosophy of Science held at Moskow, USSR, 1987, Volume 1. Nauka, Moskow, 1987, 124-127.
  29. Finite relations as initial abtract data types. V.E. Cazanescu si Gh. Stefanescu. In: Proceedings of the 6th Colloquium on Computer Science held at Iasi, Romania, 1987. Al.I. Cuza University Press, Iasi, 1987, 153-163. (in Romanian)
  30. Towards a new algebraic foundation of flowchart scheme theory. V.E. Cazanescu si Gh. Stefanescu. In: Proceedings of the 6th Colloquium on Computer Science held at Iasi, Romania, 1987. Al.I. Cuza University Press, Iasi, 1987, 164-174. (in Romanian)
  31. A calculus for program schemes. V.E. Cazanescu si Gh. Stefanescu. In: Proceedings of the Scientific Symposium on the Celebration of 25 Anniversary of Computer Center held at Bucharest, Romania, 1987. Bucharest Univ. Press, Bucharest, 1987, 36-41. (in Romanian)
  32. On some symmetric strict monoidal categories. V.E. Cazanescu si Gh. Stefanescu (1988). In: Summaries of the 3th East European Category Seminar held at Predeal, Bulgaria, 1988. Heigher Institute for Electrical Engineering Press, Sofia, 1988, pp. 11-12.
  33. Feedback, iteration and repetition. V.E. Cazanescu si Gh. Stefanescu. In: Proceedings of the 7th Colloquium on Computer Science held at Iasi, Romania, 1989. Al.I. Cuza University Press, Iasi, 1989, pp. 60-69.
  34. An axiom system for biflow using summation, (extended) feedbackation and identities. V.E. Cazanescu si Gh. Stefanescu. In: Proceedings of the 7th Colloquium on Computer Science held at Iasi, Romania, 1989. Al.I. Cuza University Press, Iasi, 1989, pp. 70-79.
  35. Towards a new algebraic foundation of program scheme theory. V.E. Cazanescu si Gh. Stefanescu. In: Actual problems of mathematical research I. Bucharest Univ. Press, Bucharest, 1990, pp. 203-224. (in Romanian)
  36. Coping with the complexity of program schemes by algebraic tools. V.E. Cazanescu si Gh. Stefanescu (1993). In: How to cope with complexity, Ed. C. Calude. Publishing House of the Romanian Academy, Bucharest, 1993, 52--132. (in Romanian).
  37. Feedback, iteration and repetition. V.E. Cazanescu si Gh. Stefanescu. In: Mathematical aspects of natural and formal languages, Ed. Gh. Paun. World Scientific, 1995, 43-62.
  38. Towards a calculus for UML-RT specifications. R. Grosu, M. Broy, B. Selic si Gh. Stefanescu. In: Proc. OOSLA'98, Kluwer Academic Publishers, 1999.
  39. Visual formalism revised. R. Grosu, Gh. Stefanescu si M. Broy. In: Proceedings, International Conference on Application of Concurrency to System Design (CSD' 98), March 23-26, 1998, Aizu-Wakamatsu, Japan. IEEE Computer Society Press, 1998, pp. 41-51.
  40. Hierarchical recognition. Gh. Stefanescu. In: Proceedings of the 3th Colloquium on Computer Science held at Iasi, Romania, 1981. Al. I. Cuza University Press, Iasi, 1981, 240-250. (in Romanian)
  41. The theory of rational S-trees. Gh. Stefanescu. In: Proceedings of the 5th Colloquium on Computer Science held at Iasi, Romania, 1985. Al.I. Cuza University Press, Iasi, 1985. (in Romanian)
  42. An algebraic theory of flowchart schemes. Gh. Stefanescu. In: Proceedings 11th Colloquium on Trees in Algebra and Programming held at Nice, France, 1986. Ed. P. Franchi-Zannettacci, Lecture Notes in Computer Science 214. Springer-Verlag, Berlin, 1986, 60-73.
  43. Flowgraphs, flownomials, behaviours. Gh. Stefanescu. In: Proceedings of the 9th Romanian Symposium on Computer Science held at Iasi, Romania, November 12-13, 1993, Eds. V.Felea and G.Ciobanu. Al.I.Cuza University Press, Iasi, 1993, pp. 477-489.
  44. Axiomatizing mixed relations. Gh. Stefanescu. In: Proc. 3rd Relational Methods in Computer Science Seminar, Hamammet, 1997. University of Science, Technology, and Medicine of Tunis, 1997, pp. 177-187.
  45. A short tour on FEST. Gh. Stefanescu. In: Proc. Current Trends in Cybernetics and Philosophy of Science, Oradea, 1996. Europa Nova, Bucharest, 1997, pp. 327-332.
  46. On space-time duality in computing; imperative programming versus wave computation, Gh. Stefanescu. In: Abstracts, 4th Relational Methods in Computer Science Seminar, Stefan Banach Mathematical Centre, Warsaw, 1998, pp. 197-202.
  47. Remarks on mixalgebras. Gh. Stefanescu. In: Proc. 4th International Symposium on Economic Informatics, Bucharest, May 1999, 1045--1053. INFOREC Printing House, Bucharest, 1999.
  48. Distributive categories and mixed network algebras. Gh. Stefanescu and Y. Kawahara. In: Proc. Joint Conference on Discrete Mathematics and Applied Mathematics, Seta, Japan, 18-20 December, 1997, pp. 29-34.
  49. Process algebra with feedback. J.C.M. Baeten, J.A. Bergstra si Gh. Stefanescu. Technical Report PRG-9419, Programming Research Group, University of Amsterdam, 1994. Also: Report 94/30, Computing Science Section, Eindhoven University of Technology, 1994.
  50. Network algebra for synchronous and asynchronous dataflow. J.A. Bergstra, C.A. Middelburg si Gh. Stefanescu. Technical Report PRG-9508, Programming Research Group, University of Amsterdam, 1995. Revised version of: Logic Group Preprint Series 122, Department of Philosophy, Utrecht University.
  51. Translations between flowchart schemes and process graphs. J.A. Bergstra si Gh. Stefanescu. Preprint No. 9/1993, Institute of Mathematics of the Romanian Academy, Bucharest, 1993.
  52. Bisimulation is two-way simulation. J.A. Bergstra si Gh. Stefanescu. Technical Report PRG-9402, Programming Research Group, University of Amsterdam, 1994.
  53. Processes with multiple entries and exits modulo isomorphism and modulo bisimulation. J.A. Bergstra si Gh. Stefanescu. Technical Report PRG-9403, Programming Research Group, University of Amsterdam, 1994.
  54. Network algebra for synchronous and asynchronous dataflow. J.A. Bergstra si Gh. Stefanescu. Logic Group Preprint Series 122, Department of Philosophy, Utrecht University, 1994. Also: Preprint 38/1994, Institute of Mathematics of the Romanian Academy, Bucharest.
  55. Processes with multiple entries and exits. J.A. Bergstra si Gh. Stefanescu. Preprint 16/1995, Institute of Mathematics of the Romanian Academy, Bucharest, 1995.
  56. Network algebra with demonic relation operators. J.A. Bergstra si Gh. Stefanescu. Technical Report PRG-9509, Programming Research Group, University of Amsterdam, 1995.
  57. Notes on equational theories of relations. Bloom, S.L., Esik, Z. and Gh. Stefanescu. Technical Report #9113, Stevens Institute of Technology, Hoboken NJ, 1991. Also: Preprint No. 1/1992, Institute of Mathematics of the Romanian Academy, Bucharest, 1992.
  58. The algebra of stream processing functions. M. Broy si Gh. Stefanescu. Technical Report TUM-I9620, Institute for Informatics, Technical University Munich, May 1996.
  59. A general result on abstract flowchart schemes with applications to the study of accessibility, reduction and minimization. V.E. Cazanescu si Gh. Stefanescu. Preprint Series in Mathematics 7/1990, The National Institute for Scientific and Technical Creations, Bucharest, 1990.
  60. Tree models for reduced and minimal schemes. V.E. Cazanescu si Gh. Stefanescu. Preprint Series in Mathematics 8/1990, The National Institute for Scientific and Technical Creations, Bucharest, 1990.
  61. A formal representation of flowchart schemes. V.E. Cazanescu si Gh. Stefanescu. Preprint Series in Mathematics 22/1987, The National Institute for Scientific and Technical Creations, Bucharest, 1987.
  62. Towards a new algebraic foundation of flowchart scheme theory. V.E. Cazanescu si Gh. Stefanescu. Preprint Series in Mathematics 43/1987, The National Institute for Scientific and Technical Creations, Bucharest, 1987.
  63. Feedback, iteration and repetition. V.E. Cazanescu si Gh. Stefanescu. Preprint Series in Mathematics 42/1988. The National Institute for Scientific and Technical Creations, Bucharest, 1988.
  64. A formal representation of flowchart schemes II. V.E. Cazanescu si Gh. Stefanescu. Preprint Series in Mathematics 60/1988, The National Institute for Scientific and Technical Creations, Bucharest, 1988.
  65. Classes of finite relations as initial abstract data types. V.E. Cazanescu si Gh. Stefanescu. Preprint Series in Mathematics 3/1989, The National Institute for Scientific and Technical Creations, Bucharest, 1989.
  66. An axiom system for biflow using summation, (extended) feedbackation and identities. V.E. Cazanescu si Gh. Stefanescu. Preprint Series in Mathematics 19/89, The National Institute, for Scientific and Technical Creations, Bucharest, 1989.
  67. Classes of finite relations as initial abstract data types I. V.E. Cazanescu si Gh. Stefanescu. Preprint Series in Mathematics 34/1989, The National Institute for Scientific and Technical Creations, Bucharest, 1989.
  68. Classes of finite relations as initial abstract data types II. V.E. Cazanescu si Gh. Stefanescu. Preprint Series in Mathematics 47/1989, The National Institute for Scientific and Technical Creations, Bucharest, 1989.
  69. Feedback theories (a calculus for isomorphism classes of flowchart schemes). Gh. Stefanescu. Preprint Series in Mathematics 24/1986, The National Institute for Scientific and Technical Creations, Bucharest, 1986.
  70. The entropy as the minimal cost of a tree. Gh. Stefanescu. Preprint Series in Mathematics 11/1982, The National Institute for Scientific and Technical Creations, Bucharest, 1982.
  71. On flowchart theories I. Gh. Stefanescu. Preprint Series in Mathematics 39/1984, The National Institute for Scientific and Technical Creations, Bucharest, 1984.
  72. A completion of "On flowchart theories (I)". Gh. Stefanescu. Preprint Series in Mathematics 7/1985, The National Institute for Scientific and Technical Creations, Bucharest, 1985.
  73. On flowchart theories II. Gh. Stefanescu. Preprint Series in Mathematics 32/1985, The National Institute for Scientific and Technical Creations, Bucharest, 1985.
  74. On flowchart theories I (revised version). Gh. Stefanescu. Preprint Series in Mathematics 52/1986, The National Institute for Scientific and Technical Creations, Bucharest, 1986.
  75. Reaction and control I. Mixing additive and multiplicative network algebras. Gh. Stefanescu. Preprint No. 33/1996, Institute of Mathematics of the Romanian Academy, Bucharest, 1996.
  76. Axiomatising mixed relations (preliminary results). Gh. Stefanescu. Preprint No. 37/1996, Institute of Mathematics of the Romanian Academy, Bucharest, 1996.
  77. A short tour on FEST. Gh. Stefanescu. Preprint No. 38/1996, Institute of Mathematics of the Romanian Academy, Bucharest, 1996.

Lucrari diverse

  1. Determinism and nondeterminism in program scheme theory: algebraic aspects. Gh. Stefanescu. Bulletin of the EATCS, 46(1992), 376--379.
  2. Flownomials: regular expressions for distributed computation. Gh. Stefanescu. In: Relational Methods in Computer Science, Eds. C. Brink and G. Schmidt. Dagstuhl-Seminar Report 80, Saarbrucken, 1994.

2002 - 2015 -- Facultatea de Matematica si Informatica, Universitatea din Bucuresti
Str. Academiei nr. 14, sector 1, C.P. 010014, Bucuresti, Romania
Tel: (4-021) 314 2863, Fax: (4-021) 315 6990, secretariat fmi.unibuc.ro