Abbreviations:
MR -- Mathematical Reviews
Zbl. -- Zentralblatt für Mathemathik
RZ -- Referativnij 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 ]    PDF   
  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 ]    PDF   
  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)    pdf
  20. Complexity for Finite Factors of Infinite Sequences (with S. Ferenczi) Theoret. Comput. Sci. 218, 1 (1999) pp. 177-195 pdf
  21. Coding Objects Related to Catalan Numbers (with A. Bege), Studia Univ. Babes-Bolyai, Informatica 46, 1 (2001), 31-40.    pdf
  22. Dominating Sets in de Bruijn Graphs (with Z, Blázsik) Pu. M.A, 13, 1-2 (2002) pp.79-85   pdf
  23. Maximal Complexity of Finite Words (with M-C. Anisiu, Z, Blázsik) Pu. M.A, 13, 1-2 (2002), 39-48   PDF
  24. Properties of palindromes in finite words (with A-C. Anisiu, V. Anisiu) Pure Math. Appl. 17, 3-4 (2006) 183-195. http://www.bke.hu/puma/17_3-4.htm
  25. Generating and ranking of Dyck words, Acta Universitatis Sapientiae, Informatica, 1, 1 (2009) 109-118 PDF
  26. Total palindrome complexity of finite words (with A-C. Anisiu, V. Anisiu) Discrete Mathematics, 310, 1 (2010) 109-114 PDF
  27. Super-d-complexity of finite words, 8th Joint Conf. on Math. and Comput. Sci., Selected Papers, 14-17 July 2010, Komarno (Slovakia), 2011, pp. 251-261   PDF
  28. On scattered subword complexity, Acta Univ. Sapientiae, Informatica, 3, 1 (2011) 127-136   PDF

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, (Communications in Internet) Ed. Albastra, Cluj, 1998 (with H. F. Pop) 108 pp. (in Romanian)
  9. Relációk és alkalmazásaik (Relations and Applications) BME -BBTE, Budapest, 1999, 71. pp. (with A. Bege, L. Tóth), (in Hungarian)
  10. Matematica discreta (Discrete Mathematics) UBB Cluj, 2001 (with A. Bege) 102 pp. (in Romanian)
  11. Combinatorica cu aplicatii (Combinatorics with Applications), Ed. Presa Universitara Clujeana, 2003. Cluj, 188 pp. (in Romanian)
  12. Informatikai algoritmusok 1 (Algorithms in informatics 1), Ed. A. Iványi, Eötvös ELTE Kiadó, Budapest, 2004, Chapter 1. Recurrence equation (in Hungarian)
  13. Formális nyelvek és automaták - Egyetemi jegyzet (Formal Languages and Automata), Farkas Gyula Egyesület a Matematikáért és Informatikáért, Kolozsvár, 2004. Cluj, 146 pp. (in Hungarian)
  14. Informatikai algoritmusok 2   (Algorithms in informatics 2), Ed. A. Iványi, Eötvös ELTE Kiadó, Budapest, 2005, Chapter 19. Automata and  formal languages  (in Hungarian)
  15. Bege A., Kása Z.: Algoritmikus kombinatorika és számelmélet, Kolozsvári Egyetemi Kiadó, 2006.
  16. Csörnyei Z., Kása Z.: Formális nyelvek és fordítóprogramok, Kolozsvári Egyetemi Kiadó, 2007.
  17. Algorithms of Informatics I, Foundations (ed. A. Iványi), mondAt Kiadó, Budapest, 2007. (Chapter 1: Kása Z., Automata and Formal Languages, pp. 13–79, Chapter 11: Kása Z., Recurrences, pp. 478–501) ISBN: 978-963-87596-1-0.

 

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. Az informatika oktatásának múltja és jelene a kolozsvári egyetemen (The past and the present of teaching informatics at the university in Cluj) Informatika a felsôoktatásban '96 és Networkshop '96 Közös rendezvény, Debrecen, 1996. augusztus 27-30.
  7. New Trends in CS Education at the Babes-Bolyai University, The Turkiye Second International Symposium on Distance Education , Ankara, May 4-8, 1998
  8. Complexity measures for finite and infinite sequences, Third Joint Conference on Mathematics and Computer Science , Visegrád, Hungary, June 6-12, 1999.
  9. Improving Distance Education in Computer Science at the Babes-Bolyai University, RILW 2001, Miercurea Ciuc (Romania) (in cooperation)
  10. Fájlok, szájtok, hómpédzsek és egyéb linkek, SzámOkt, Kolozsvár, 2001. okt. 27-29 EMT szervezése
  11. Hogyan viselkedjünk az Interneten, SzámOkt, Kolozsvár, 2004. március 26-28 EMT szervezése
  12. Application of shortest path algorithms in networks (with . z. Kátai) 2nd International Economic Conference Kaposvár on the topic of Economical competitiveness – quality of life – sustainability Kaposvár, April 2-3, 2009.

Presentations

  1. Complexity of words, University of Klagenfurt, May, 7, 2004    pdf
  2. Szókombinatorikai alkalmazások, MPV, Budapest, 2004. május 15. 2004    pdf