 |
|
|
|
|
|
| BBTE |
|
| Matematika és Informatika Kar |
|
Cím:
M. Kogălniceanu utca, 1 szám,
Kolozsvár 3400,
Románia
Tel: 40-264-594315 |
|
|
|
|
|
| Születési hely: |
Szilágyborzás |
|
|
| Születési idő: |
1948. május 12. |
|
|
| Foglalkozás: |
egytemi oktató |
|
|
| Beosztás: |
Egyetemi tanár (professzor) |
|
|
| Otthoni cím: |
Kolozsvár |
|
|
| Kutatási téma: |
kombinatorika, programozás, algoritmusok komplexitása |
|
|
| Tudományterület: |
- |
|
|
| Tudományág: |
- |
|
|
| Tudományos cím: |
A matematikai tudományok doktora |
|
|
|
|
| Publikációk: |
|
|
|
Abbreviations:
MR -- Mathematical Review
Zbl. -- Zentralblatt für Mathemathik
RZ -- Referatnij Zurnal
Selection from my Scientific Papers
1. On k-thin sets and their relation to generalized Ramsey number, Studia Universitatis Babes-Bolyai, Mathematica, 20 (1975) 54-59. [ MR#53, 2810 ]
2. Locating the buddies in the general buddy systems, Studia Universitatis Babes-Bolyai, Mathematica, 26, 4(1981)46-50 [ MR 84a:68017, Zbl. 475.68007 ]
3. Overallocation in buddy systems, Babes-Bolyai University, Cluj-Napoca, Research Seminars, Preprint No. 4, 1984, pp. 57-74. [ RZ 4 G 348/1987 ]
4. Abstract dynamic allocation algorithm, Babes-Bolyai University, Cluj-Napoca, Research Seminars, Preprint No. 5, 1984, pp. 56-69.
5. Cyclic cellular automata, Simpozion "Informatica si aplicatiile sale", Univ. Cluj-Napoca, 1985, pp. 71-73.
6. Internal fragmentation of memory in paging systems, Mathematica, 28 (51), 1 (1986) 43-46. [ RZ 2 V 608/1987 ]
7. Cellular automata in graphs, Studia Univ. Babes-Bolyai, Mathematica, 32, 3 (1987) 17-23. [ MR 89d:68065, RZ 2 G 406/1989, Zbl. 646.68069/1989 ]
8. A system for program writing and debugging, (with F.M.Boian, M.Frentiu), Babes-Bolyai Univ. Cluj-Napoca, Research Seminars, Preprint No. 5, 1987, pp. 1-20.
9. Binary trees and number of states in buddy systems (with L. Tâmbulea) Annales Univ. Sci. Budapestinensis de R. Eötvös Nominatae, Sectio Computatorica, 7 (1987) 3-10 [ MR 89i:05020, Zbl. Math. 676.05037/1990 ]
10. Parallel execution in Loop-Exit schemes (with F.M. Boian, M. Frentiu) Babes-Bolyai Univ. Cluj-Napoca, Research Seminars, Preprint No. 9, 1988, pp. 1-16. [ Zbl. 668.68023.1989 ]
11. Parallel executable sequences in serial programs (with F.M. Boian, M. Frenctiu), Studia Univ. Babes-Bolyai, Mathematica, 33, 3 (1989) 47-57. [ Zbl. 660.68023/1989 ]
12. Computer aided geometry teaching (with F.M. Boian, M. Frentiu), Univ. Cluj-Napoca, Research Seminars, Preprint No. 9, 1989, pp. 11-20.
13. Computing the d-complexity of words, Univ. Cluj-Napoca, Research Seminars, Preprint No. 10, 1989,pp. 64-69. [MR 93c:68082]
14. Efficiency in parallel evaluation of arithmetic expressions, (with F.M. Boian, M. Frentiu), Univ. Cluj-Napoca, Fac. of Math., Research Seminars, Preprint No.10, 1989, pp.1-14. [MR.92m:65009]
15. Computing the d-complexity of words by Fibonacci-like sequences, Studia Univ. Babes-Bolyai, Math. 35, 3 (1990),49-53. [ MR 94c:68151]
16. d-complexity of words and generating functions, Univ. Babes-Bolyai of Cluj-Napoca, Fac. of Math. and Comp. Sc., Research Seminars, Preprint No. 5, 1994, pp. 65-72.
17. Computer-Aided Teaching of Geometry, Mathematics and Informatics Quarterly, 5, 4 (1995), pp. 177-182.
18. A Practical Approach to Security in Databases, Babes-Bolyai Univ., Fac. of Math. and Informatics, Seminar on Computer Science, Preprint No.2. 1995. pp. 15-18. (with V. Varga)
19. On the d-complexity of strings, PU. M. A, Vol. 9 (1998) No. 1-2, pp. 119-128. (PU. M. A = Pure Mathematics and Applications - Hungary) dvi format pdf format
20. Complexity for finite factors of infinite sequences (with S. Ferenczi) , Theoret. Comput. Sci. 218, 1 (1999) pp. 177-195
Books:
1. Ismerkedés az informatikával (Introduction to Computer Science), Ed. Dacia, 1983. Cluj, 166 pp. (in Hungarian)
2. Informatica pentru elevi (Computer Science in School), Ed. MicroInformatica, Cluj, 1992, 1993 (with F. Boian, ...), 210 pp. (in Romanian)
3. Algoritmusok tervezése (The Design of Algorithms). Ed. Stúdium, Cluj, 1994. 120 pp. (in Hungarian)
4. Programare PASCAL. Probleme ilustrative si probleme propuse pentru elevi si studenti (Problems and Programs in Pascal), Ed. Promedia Plus Computers, Cluj-Napoca, 1995. (with F. Boian , ...), 228 pp. (in Romanian)
5. Manualul incepatorului in programare Pascal (Pascal for Beginners), Ed. Albastra, Cluj-Napoca, 1995 (with F. Boian, ...), 252 pp. (in Romanian)
6. Mit si adevar despre virusii PC (Myth and truth about PC-viruses), Ed. Albastra, Cluj-Napoca, 1996 (with J. Vásárhelyi) pp. 250 (in Romanian)
7. Barátkozzunk a számítógéppel, (Introduction to Computer Using) Ed. Stúdium, Cluj, 1996 (with J. Robu and I. Varga) 148 pp. (in Hungarian)
8. Comunicare in Internet, Ed. Albastra, Cluj, 1998 (with H. F. Pop) 108 pp. (in Romanian)
International Participation
1. Aproximation algorithms to find superstrings (with A. Iványi, - Hungary), International Conference on Combinatorics, Keszthely, Hungary, July 18-24, 1993.
2. Convective diffusion of a soluble surfactant from a free drop, (with A. Stan, I. Stan), GAMM Annual Scientific Conference at the Technical University of Braunschweig, April 4-8, 1994.
3. On the complexity of words, First Joint Conference on Modern Applied Mathematics, Ilieni/Illyefalva, Romania, June 12-17, 1995.
4. Two conjectures on word complexity, Second Joint Conference on Modern Applied Mathematics, Ilieni/Illyefalva, Romania, June 2-8, 1997
5. Behave yourself on Internet!, Romanian Internet Learning Workshop, Ilieni, Romania, June 9-14, 1997
6. New Trends in CS Education at the Babes-Bolyai University, The Turkiye Second International Symposium on Distance Education , Ankara, May 4-8, 1998
7. Complexity measures for finite and infinite sequences, Third Joint Conference on Mathematics and Computer Science , Visegrád, Hungary, June 6-12, 1999.
|
|
|
|
|
|
|
|
|
|
|
