English Version



Sesiunea ianuarie 2019



Calendarul alegerilor pentru reprezentantii studentilor in Consiliul Facultatii, sesiunea ianuarie 2019, este urmatorul:

  • 7-11 ianuarie 2019 - Depunere candidaturi (prin e-mail la adresa secretariat@fmi.unibuc.ro in perioada prevazuta mai sus sau la dra secretar sef in aceeasi perioada, in intervalul de lucru al Secretariatului)
  • 12-14 ianuarie 2019 - Campanie electorala
  • 15 ianuarie 2019, intre orele 10:00-18:00 - Primul tur
  • 18 ianuarie 2019, intre orele 10:00-18:00 - Al doilea tur (daca nu se intruneste cvorumul la primul tur)
  • 21 ianuarie 2019 - Validarea alegerilor in Consiliul Facultatii (vot electronic)
  • 23 ianuarie 2019 - Validarea alegerilor in Senatul Universitatii din Bucuresti
Alegerile se desfasoara pentru 1 loc in Consiliul Facultatii, astfel:
  • 1 loc pentru anii I si II Calculatoare si Tehnologia Informatiei - Candidati: Nitu Cristina, anul II CTI si Radulescu Adrian-Radu, anul I CTI
Rezultate turul I:
Pentru locul de reprezentare in Consiliul Facultatii a studentilor de la anii I si II Calculatoare si Tehnologia Informatiei, procentul de prezenta la vot a fost de 44% (mai mare de 33%+1 din numarul studentilor reprezentati).
Studenti alesi in turul I:
  • In Consiliul Facultatii:
    • Nitu Cristina (anul II CTI), aleasa de 68% din alegatorii prezenti


Nota: Daca nu se inscrie niciun candidat, nu se organizeaza alegeri. Pot vota doar studentii din anii si domeniul carora le corespunde locul.
Nota: Regulamentul general de alegeri al Universitatii este disponibil aici.



Sesiunea octombrie 2018



Calendarul alegerilor pentru reprezentantii studentilor in Consiliul Facultatii si in Senatul Universitatii, sesiunea octombrie 2018, este urmatorul:

  • 12-16 octombrie 2018 - Depunere candidaturi, conform metodologiei
  • 17-22 octombrie 2018 - Campanie electorala
  • 23 octombrie 2018, intre orele 9:00-19:00 - Primul tur. Intre orele 10:00-18:00 se va organiza o sectie de vot la Magurele.
  • 25 octombrie 2018, intre orele 9:00-19:00 - Al doilea tur (pentru toate locurile de reprezentare neocupate in primul tur).
  • 29 octombrie 2018, intre orele 9:00-19:00 - Al treilea tur (pentru locul de reprezentare de la anul III Informatica).
  • 5 noiembrie 2018 - Validarea alegerilor in Consiliul Facultatii (vot electronic)
  • 14 noiembrie 2018 - Validarea alegerilor in Senatul Universitatii din Bucuresti (vot electronic)
Alegerile se desfasoara pentru 8 locuri in Consiliul Facultatii si 2 locuri in Senatul Universitatii, astfel:
  • 1 loc pentru anul I Matematica si Informatica - Candidat: Stoleru Vlad-Stefan, anul I Informatica
  • 1 loc pentru anul II Matematica - Candidat: Dumitru Nicoleta, anul II Matematici aplicate
  • 1 loc pentru anul II Informatica - Candidat: Anei Alexandra Gabriela, anul II Informatica
  • 1 loc pentru anii I si II Calculatoare si Tehnologia Informatiei - niciun candidat
  • 1 loc pentru anul III Matematica - Candidat: Gusatu Marian, anul III Matematica-Informatica
  • 1 loc pentru anul III Informatica - Candidat: Petrescu Ana Maria, anul III Informatica
  • 1 loc pentru anii III si IV Calculatoare si Tehnologia Informatiei - Candidat: Adam Iuliana Alexandra, anul IV Calculatoare si Tehnologia Informatiei
  • 1 loc pentru reprezentarea tuturor studentilor, indiferent de ciclu de studii, an, program sau forma de invatamant - Cristea Rares, anul I master Inginerie Software
  • 2 locuri in Senatul Universitatii - Candidati*: Cristea Rares, anul I master Inginerie Software; Istoc Ramona, anul II Informatica
*Lista de candidati afisata initial pentru locurile din Senatul Universitatii continea, din greseala, un candidat in plus.

Rezultate turul III:
Pentru locul de reprezentare in Consiliul Facultatii a studentilor de la anul III Informatica, procentul de prezenta la vot a fost mai mare de 15%+1 din numarul studentilor reprezentati.
Studenti alesi:
  • In Consiliul Facultatii:
    • Petrescu Ana Maria (anul III Informatica), aleasa de 95% din alegatorii prezenti
Rezultate turul II:
Pentru toate locurile de reprezentare in Consiliul Facultatii, cu exceptia celui de la anul III Informatica precum si pentru locurile de reprezentare in Senatul Universitatii, a fost intrunit cvorumul de participare si au fost declarati alesi studentii candidati. Pentru locul de reprezentare in Consiliul Facultatii de la anul III Informatica, alegerile se vor fi relua in turul III.
Studenti alesi in turul II:
  • In Consiliul Facultatii:
    • Stoleru Vlad-Stefan (anul I Informatica), ales de 97% din alegatorii prezenti
    • Gusatu Marian (anul III Matematica)), ales de 100% din alegatorii prezenti
    • Adam Iuliana Alexandra (anul III-IV CTI), ales de 100% din alegatorii prezenti
    • Cristea Rares (toti anii de studiu), ales de 95% din alegatorii prezenti
  • In Senatul Universitatii:
    • Cristea Rares, ales de 86% din alegatorii prezenti
    • Istoc Ramona, ales de 73% din alegatorii prezenti
Rezultate turul I:
Pentru locurile de reprezentare in Consiliul Facultatii a studentilor de la anul II Matematica si anul II Informatica, procentul de prezenta la vot a fost mai mare de 33%+1 din numarul studentilor reprezentati (42,15%, respectiv 38,93%). Pentru celelalte locuri de reprezentare in Consiliul Facultatii, precum si pentru locurile de reprezentare in Senatul Universitatii, alegerile se vor fi relua in turul II.
Studenti alesi in turul I:
  • In Consiliul Facultatii:
    • Dumitru Nicoleta (anul II Matematica), aleasa de 94% din alegatorii prezenti
    • Anei Alexandra Gabriela (anul II Informatica), aleasa de 97% din alegatorii prezenti


Nota: Pentru locurile pentru care nu se inscrie niciun candidat, nu se organizeaza alegeri. Pentru locurile in Consiliul Facultatii pentru care se inscriu candidati pot vota doar studentii din anul si domeniul carora le corespunde fiecare loc. Pentru locurile in Senatul Universitatii pot vota toti studentii, indiferent de ciclu de studii, an, specializare sau forma de invatamant.
Nota: Regulamentul de alegeri al Facultatii este disponibil aici.
Nota: Regulamentul general de alegeri al Universitatii este disponibil aici.



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