English Version

Prof.dr. Rudeanu Sergiu

  

Born: 9 February 1935, Iasi.

Graduate: 1957, Facultatea de Matematica, Universitatea Bucuresti.

PhD: 1964, "Ecuatiile booleene si aplicatiile lor", Supervisor Gr.C.Moisil.

Fields of interest: Lattice theory, Algebraic logic, Universal algebra, Boolean Algebra, Pseudo-Boolean programming, Graph Theory.

Professional career:
- Research fellow, Institute of mathematics, 1958-1968.
- Associate professor, 1968-1990.
- Professor, 1990–2005.
- Consultant professor 2005–present.
- PhD supervisor, since 1970.


Courses: Logic and set theory, Switching theory, Algebraic foundations of informatics, Graph theory, Lattices and universal algebra, Sequential machines, Discrete modeling, and others.

Prizes:
- Academy prize "Gheorghe Titeica" 1968.

Member in the Editorial boards of :
- Discrete Mathematics (from the foundation until 2008)
- Multiple-Valued Logic and Soft Computing
- Annals of the University of Craiova, Mathematics and Computer Science Series

Reviewer of :
- Zentralblatt für Mathematik
- Mathemathical Reviews.

Other distinctions:
- Included in "Who's Who in the World", since 1980-1981.

email address and internet page: srudeanu@yahoo.com; http://funinf.math.unibuc.ro/~rud/

Note: Abbreviated texts published in various Proceedings, expository papers and didactic articles have not been included.

A. Monographs

  1. Axiomele laticilor si ale algebrelor booleene. Ed. Academiei, Bucuresti 1963.
  2. (with P.L.Hammer) Pseudo-Boolean Methods for Bivalent Programming. Lecture Notes in Mathematics, 23, Springer-Verlag, Berlin/Heidelberg/New-York 1966.
  3. (with P.L.Hammer) Boolean Methods in Operations Research and Related Areas. Springer-Verlag, Berlin/ Heidelberg/New-York 1968; Dunod, Paris 1970.
  4. Boolean Functions and Equations. North-Holland, Amsterdam/London 1974; Kogaku Tosho, Tokyo, 1984.
  5. (with V.Boicescu, A.Filipoiu, G.Georgescu) Lukasiewicz-Moisil Algebras. Annals of Discrete Mathematics, 49, North-Holland, Amsterdam/New-York/Oxford/London 1991.
  6. Lattice Functions and Equations. Springer-Verlag, London 2001.
  7. (with R. Padmanabhan) Axioms for Lattices and Boolean Algebras. World Scientific, Singapore 2008.

B. Handbooks

  1. Algebra liniara. A.S.E., Bucuresti, 1968.
  2. (with M.Becheanu, V.Cazanescu, C.Nastasescu) Logica matematica si teoria multimilor. Ed. Didactica si Pedagogica, Bucuresti 1972.
  3. Elemente de teoria multimilor. Univ. Bucuresti, 1973.
  4. Eléments d'algébre linéaire. Université d'Oran, 1973.
  5. Curs de bazele informaticii. Logica Matematica. Fascicula I-a. Elemente de algebra universala. Univ. Bucuresti, 1977.
  6. Curs de bazele informaticii. Logica Matematica. Fascicula a II-a. Calculul propozitiilor. Univ. Bucuresti, 1977.
  7. Curs de bazele informaticii. Latici si algebre booleene. Univ. Bucuresti, 1982.
  8. (with C.P.Popovici, H.Georgescu) Curs de bazele informaticii. Vol.II. Univ. Bucuresti, 1991.
  9. Lectii de calculul predicatelor si calculul propozitiilor. Ed. Univ.Bucuresti, 1997.
  10. Informatica teoretica (online). Univ. Bucuresti.

C. Research papers

  1. Intrebuintarea imaginarelor lui Galois in teoria mecanismelor automate. X. Clasificarea functiilor de doua variabile in GF(22). Stud. Cerc.Mat. 9 (1958), 217-287.
  2. Boolean equations and their applications to the study of bridge circuits. I. Bull. Math. Soc. Sci. Math. Phys. R.P. Roumaine 3 (51), 1959, 445-473.
  3. Independent systems of axioms in lattice theory. Bull. Soc. Sci. Math. Phys. R.P.Roumaine 3 (51), 1959, 475-488.
  4. Asupra simbolului lui Legendre. Com. Acad. R.P. Romane 10 (1960), 715-721.
  5. Asupra definirii algebrelor booleene prin operatii binare. Stud. Cerc. Mat. 11 (1960), 451-467; Rev. Math. Pures Appl. 6 (1960), 171-184 (in Russian).
  6. Ecuatiile booleene si aplicatiile lor la studiul schemelor in punte. II. Com. Acad. R.P. Romane 11(1961), 611-618.
  7. (with P.L.Hammer) Asupra rezolvarii problemei transporturilor prin metoda lui Egervary. Com. Acad. R.P. Romane 11(1961), 773-778.
  8. Functii booleene si functii Sheffer. Stud. Cerc. Mat. 12(1961), 553-566; Rev. Math. Pures Appl. 6(1961), 747-750 (in Russian).
  9. Asupra rezolvarii ecuatiilor booleene prin metoda lui Lowenheim. Stud. Cerc. Mat. 13(1962), 295-308.
  10. Determinarea circuitelor hamiltoniene ale unui graf prin metoda lui R. Fortet. Com. Acad. R.P. Romane 12(1962), 893-899.
  11. Asupra unor sisteme de postulate ale algebrelor booleene. Com. Acad. R.P. Romane 12(1962), 893-899.
  12. (with P.L.Hammer) Asupra rezolvarii problemei transporturilor prin metoda lui Egervary. II. Stud. Cerc. Mat. 14(1963), 395-364.
  13. (with P.L.Hammer, I.Rosenberg) Asupra determinarii minimelor functiilor pseudo-booleene. Stud. Cerc. Mat. 14(1963), 359-364.
  14. (with P.L.Hammer, I.Rosenberg) Applying discrete linear programming to the minimization of Boolean functions (in Russian). Rev. Math. Pures. Appl. 8(1963), 459-475.
  15. Logical dependence of certain chain conditions in lattice theory. Acta.Sci. Math. Szeged 25(1964), 209-218.
  16. Notes sur l'existence et l'unicité des noyaux d'un graphe. I. Rev.Francaise Rech. Opérationnelle 8(1964), 345-352.
  17. Remarks on Motinori Goto's papers on Boolean equations. Rev.Roumaine Math. Pures Appl. 10(1965), 311-317; Stud. Cerc. Mat. 17(1965), 359-365 (in Romanian).
  18. Solutions non redondantes des équations booléennes. Bull. Math.Soc. Sci. Math. Phys. R.P. Roumaine 7(55) (1963), 45-49.
  19. (with P.L.Hammer) Minimization of switching circuits in actual operation. IFAC Symposium on Hazard and Race Phenoma, Circular Letter No.14, Bucharest 1964. Rev. Roumaine Math. Pures Appl. 12(1967), 407-444.
  20. On solving Boolean equations in the theory of graphs. Rev. Roumaine Math. Pures Appl. 11(1966), 653-664.
  21. Axiomatization of certain problems of minimization. Studia Logica 20(1967), 37-61.
  22. Notes sur l'existence et l'unicité des noyaux d'un graphe. II. Application des équations booléennes. Rev. Francaise Rech. Opérationnelle 10(1966), 301-310.
  23. Sur les équations booléennes de S.Cetkovic. Publ. Inst. Math. Belgrade 6(20) (1966), 95-97.
  24. On Tohma's decomposition of logical functions. IEEE Trans. Electronic Computers EC-14 (1965), 929-931.
  25. Irredundant solutions of Boolean and pseudo-Boolean equations. Rev. Roumaine Math. Pures Appl. 11(1966), 183-188.
  26. (with P.L.Hammer) Programmation pseudo-booléenne. I. Le cas linéaire. C.R. Acad. Sci. Paris Sér. A-B 265(1966), 164-167.
  27. (with P.L.Hammer) Programmation pseudo-booléenne. II. Le cas non linéaire. C.R. Acad. Sci. Paris Sér. A-B 265(1966), 217-219.
  28. (with P.L.Hammer) Extensions of pseudo-Boolean Programming. Mat. Vesnik (Beograd) 4(19) (1967), 211-224.
  29. (with P.L.Hammer) A pseudo-Boolean approach to matching problems in graphs with applications to assignment and transportation problems. Actes Journées d'Etudes Théorie des Graphes ICC, Rome 1966, Dunod, Paris, Gordon and Breach, New York, 1967, 161-171.
  30. (with P.L.Hammer) A pseudo-Boolean viewpoint on systems of representatives. Applicationes Math. 10(1969), 135-142.
  31. (with P.L.Hammer) Pseudo-Boolean Programming. Operations Res. 17(1969), 233-261.
  32. On functions and equations in distributive lattices. Proc. Edinburgh Math. Soc.16 (series II) (1968), 49-54. Correct. ibid. 17 (series II) (1970), 105.
  33. (with Cs.Fabian, Gh.Weisz) Rezolvarea problemelor de programare pseudo-booleana liniara cu ajutorul unui calculator electronic. Stud. Cerc. Mat. 20(1968), 1447-1462.
  34. On elimination in Boolean algebra. Hitotsubashi J.Arts and Sci. 10(1969), 74-75.
  35. Irredundant optimization of pseudo-Boolean functions. J.Optimization Theory Appl. 4(1969), 253-259.
  36. An axiomatic approach to pseudo-Boolean programming. Mat. Vesnik (Beograd) 7(22) (1970), 403-414.
  37. Boolean equations for the chromatic decomposition of graphs. An.Univ. Bucuresti ser. Mat. 18(1969), 119-126.
  38. Programmation bivalente a plusieurs fonctions économiques. Rev. Francaise Informat. Rech. Opérationnelle 3(1969), No-V2, 13-30.
  39. On reproductive solutions of Boolean equations. Publ. Inst. Math. Belgrade 10(24) (1970), 71-78.
  40. Sur quelques applications des équations booléennes. Logique, Automatique, Informatique. Editura Academiei R.S.Romania, Bucuresti 1971, 177-193.
  41. On Boolean matrix equations. Rev. Roumaine Math. Pures Appl. 17(1972), 1075-1090.
  42. (with C.H.Cunkle) Rings in Boolean algebras. Discrete Math. 7(1974), 41-51.
  43. An algebraic approach to Boolean equations. IEEE Trans. Computers C-23(1974), 206-207.
  44. Testing Boolean identities. Centre de recherches mathématiques, Université de Montréal. CRM-308, July 1973.
  45. Local properties of Boolean functions. I. Injectivity. Discrete Math. 13(1975), 143-160.
  46. Local properties of Boolean functions. II. Isotony. Discrete Math. 13(1975), 161-183.
  47. Local properties of Boolean functions. III. Extremal solutions of Boolean equations. (in Russian). M.A.Gavrilov (editor), Teoria avtomatov, Iz-stvo Nauka, Moskva 1976, 25-33.
  48. Square roots and functional decomposition of Boolean functions. IEEE Trans. Computers C-25(1976), 528-532.
  49. On the range of a Boolean transformation. Publ. Inst. Math. Belgrade 19(33) (1975), 139-144.
  50. (with R.A.Melter) Geometry of 3-rings. Colloquia Math. Soc. Janos Bolyai, 14 (Lattice Theory), Szeged (Hungary) 1974, 249-269.
  51. Systems of linear Boolean equations. Publ. Inst. Math. Belgrade 22(36) (1977), 231-235.
  52. Injectivity domains of Boolean transformations. Rev. Roumaine Math. Pures Appl. 23(1978), 113-119.
  53. (with V.E.Cazanescu) Independent sets and kernels in graphs and hypergraphs. Ann. Fac. Sci. Univ. Kinshasa 4(1978), 37-66.
  54. On reproductive solutions of arbitrary equations. Publ. Inst. Math. Belgrade 24(38) (1978) 143-145.
  55. (with C.Ghilezan) Interpolation formulas over finite sets. Publ. Inst. Math. Belgrade 25(39) (1979), 45-49.
  56. (with F.M.Brown) Consequences, consistency and independence in Boolean algebras. Notre Dame J. Formal Logic 22(1981), 45-62.
  57. Fixpoints of lattice and Boolean transformations. An. Sti. Univ.Al.I. Cuza Iasi 26(1980), 147-153.
  58. (with R.A.Melter) Characterizations of Boolean functions. An. Sti.Univ. Al.I. Cuza Iasi 28(1982), 161-169.
  59. (with R.A.Melter) Generalized inverses of Boolean functions. Rev.Roumaine Math. Pures Appl. 25(1980), 891-898.
  60. (with R.A.Melter) A measure of central tendency for Boolean algebras. An. Sti. Univ. Al.I. Cuza Iasi 27(1981), 411-415.
  61. (with F.M.Brown) Recurrent covers and Boolean equations. Colloquia Math. Soc. Janos Bolyai 33 (Lattice Theory), Szeged (Hungary), 1980, 55-85 (1983).
  62. (with R.A.Melter) Functions characterized by functional Boolean equations. Colloquia Math. Soc. Janos Bolyai 33 (Lattice Theory), Szeged (Hungary), 1980, 637-650 (1983).
  63. Isotony detectors for Boolean functions. Rev. Roumaine Math. Pures Appl. 28(1983), 243-250.
  64. Linear Boolean equations and generalized minterms. Discrete Math. 43(1983), 241-248.
  65. (with R.A.Melter) Linear equations and interpolation in Boolean algebra. J. Linear Algebra and Appl. 57(1984), 31-40.
  66. (with R.A.Melter) Alternative definitions of Boolean functions and relations. Archiv Math. (Bassel) 43(1984), 16-20.
  67. On relatively pseudocomplemented posets and Hilbert algebras. An.Sti. Univ. Al.I. Cuza Iasi, 31(1985), supl, 74-77.
  68. (with F.M.Brown) Triangular reproductive solutions of Boolean equations. An. Univ. Craiova Ser. Mat.-Fiz.-Chim. 13(1985), 18-23.
  69. (with F.M.Brown) A functional approach to the theory of prime implicants. Publ. Inst. Math. Belgrade 40(54) (1986), 23-32.
  70. (with F.M.Brown) Prime implicants of dependecy functions. An. Univ. Craiova Ser. Mat.-Inf. 37(1988), No.2, 16-26.
  71. Behaviouristic automata. I. Minimal automata. An. Univ. Bucuresti Ser. Mat.-Inf. 38(1989), No.2, 64-71.
  72. Behaviouristic automata. II. The synthesis problem. An. Sti. Univ. Al.I. Cuza Iasi, Informatica, 35(1989), 303-312.
  73. On deduction theorems and functional Boolean equations. An. Univ. Timisoara 28(1990), 197-210.
  74. (with R.A.Melter) Voronoi diagrams for Boolean algebras. Stud. Cerc. Mat. 45(1993), 429-434.
  75. On Lukasiewicz-Moisil algebras of fuzzy sets. Studia Logica 52(1993), 95-111.
  76. Unique solutions of Boolean ring equations. Discrete Math. 122(1993), 381-383.
  77. (with M.Davio) Boolean design with autodual negative gates. Rev. Roumaine Sci. Techn. Sér. Electrotechn. et Energ. 39(1993), No.2, 241-251, No.4, 475-489.
  78. On quadratic Boolean equations. Fuzzy Sets and Systems, 75(1995), 209-213.
  79. On certain set equations. Stud. Cerc. Mat. 47(1995), 349-351.
  80. On the axiomatics of Lukasiewicz-Moisil algebras. An. St. Univ. Ovidius Constanta, Ser. Mat. 2(1994), 152-159.
  81. Gr.C.Moisil, a contributor to the early development of lattice theory. Mult.-Valued Log. 2(1997), 323-328.
  82. On Boolean modus ponens. Mathware & Soft Computing 5(1998), 115-119.
  83. On general and reproductive solutions of finite equations. Publ. Inst. Math. Belgrade 63(77) (1998), 26-30.
  84. On the behaviour of semiautomata. In: C.S. Calude, Gh. Paun (eds), Finite versus Infinite. DMTCS, Springer-Verlag, London 2000, 247-256.
  85. (with F.M.Brown) Uniquely solvable Boolean and simple Boolean equations. Mult.- Valued Log. 6(2001), 11-26.
  86. On identities and equations in Post algebras. Bul. Acad. Sti. Rep. Moldova 2(33) (2000), 3-14.
  87. On Boolean partial differential equations. Kragujevac J. Math. 23(2001), 5-9.
  88. On equations in bounded lattices. An. Sti. Univ. Ovidius, Constanta, Ser. Mat. 9(2001), 101-106.
  89. Algebraic methods versus map methods of solving Boolean equations. Intern. J. Computer Math. 80(2003), 815-817.
  90. Boolean-based ordered monoids. Romanian J. Inform. Sci. Techn. 6(2003), 217-226.
  91. A differential description of uniquely solvable Boolean equations. Ann. Univ. Craiova, Math. Comput. Sci. Ser. 30(2) (2003), 156-161.
  92. (with D.Vaida) Semirings in operations research and computer science: more algebra. Fund. Inform. 61(2004), 61-85.
  93. (with D.A.Simovici) A graph-theoretical approach to Boolean interpolation of non-Boolean functions. Proc. 34-th Intern. Symp. Multiple-Valued Logic, Toronto, May 2004, 245-250.
  94. On the decomposition of Boolean functions via Boolean equations. J. Universal Comput. Sci. 10(2004), 1294-1301.
  95. On complete and precomplete clones of truth functions. J. Mult.-Valued Log. Soft Comput. 11(2005), no.1-2, 19-49.
  96. (with C.S.Calude) Proving as a computable procedure. Fund. Inform. 64(2005), 45-52.
  97. On unary lattice functions and Boolean functions. Bull. Math. Soc. Sci. Math. Roumanie 49(97) (2006), 87-98.
  98. (with D.A.Simovici) On the ranges of algebraic functions on lattices. Studia Logica 84(2006), 475-482.
  99. (with G. Ciobanu) On the behaviour of automata. I. An. Univ. Bucuresti Ser. Mat.-Inf. 45(2006), 119-128.
  100. Boolean transformations with unique fixed points. Math. Slovaca 57(2007), 1-9.
  101. Rings in Post algebras. Acta Math. Univ. Comenianae 76, 2(2007), 263-272.
  102. Post algebras in 3-rings. An. Sti. Univ. Ovidius Constanta Ser. Mat. 15(2) (2007), 83-90.
  103. Gr.C. Moisil si teoria algebrica a mecanismelor automate. In: S. Marcus et al. (eds), Gr.C. Moisil and His Followers, Ed. Academiei Romane, Bucuresti, 2007, 121-132.
  104. (with G. Ciobanu) Equivalent transformations of automata by using behavioral automata. J. Univ. Comput. Sci. 13(2007), 1540-1549.
  105. On the Glivenko-Frink theorem for Hilbert algebras. An. Univ. Craiova, Math. Comput. Sci. Ser. 34(2007), 72-77.
  106. (with R. Padmanabhan) Equational spectrum of Hilbert varieties. Centr. Eur. J. Math. 7(1) (2009), 66-72. DOI 10.2478/s11533-008-0060-6
  107. What can be expected from a Boolean derivative? An. Sti. Univ. Ovidius Constanta 17(1) (2009), 177-186.
  108. (with G. Ciobanu) Final and sequential behaviours of M-automata. Acta Informatica 46(2009), 361-374. DOI 10.1007/s00236-009-0098-3
  109. Boolean sets and most general solutions of Boolean equations. Information Sci. 180(2010), 2440-2447. doi:10.1016/j.ins.2010.01.29
  110. Localizations and fractions in algebra of logic. J. Mult.-Valued Logic Soft Comput. 16(2010), No.3-5, 467-504.



Actualizat: 17 mai 2010



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