Lista de lucrări în domeniul de studii universitare de licenţă: informatica

Numele şi prenumele Kása Zoltán A. Teza de doctorat: Metode de alocarea dinamică a calculatoarelor numerice, 1985 B. Cărti publicate B1. Cărţi (manuale, monografii, tratate, îndrumare etc.) publicate în străinătate 1999 Bege, A., Kása, Z., Tóth L., Relációk és alkalmazásaik (Relaţii şi aplicaţiile sale), Budapesti Műszaki Egyetem, 1999. (pentru doctoranzi) B2. Cărţi (manuale, monografii, tratate, îndrumare etc.) publicate în ţară, la edituri recunoscute CNCSIS 2015 Gaskó Noémi, Kása Zoltán: Gráfalgoritmusok, Ed. Presa Universitară Clujeană/Kolozsvári Egyetemi Kiadó, 2015. pp. 203. ISBN 978-973-595-735-3 2007 Csörnyei Zoltán, Kása Zoltán, Formális nyelvek és fordítóprogramok, (Limbaje formale şi compilatoare) Ed. Presa Universitară Clujeană, 2007, 197 pg. ISBN 978-973-610-505-0 2006 Bege, A., Kása, Z., Algoritmikus kombinatorika és számelmélet (Combinatorica algoritmica si teoria numerelor – in. magh.), Presa Universitară Clujeană, 2006. pp. 215. ISBN (13): 978-973-610-446-6

2003 Kása, Z. Combinatorică cu aplicaţii, Editura Presa Universitară Clujeană, Cluj-Napoca, 2003, 188 pag. ISBN 973-610-152-5 1998 Kása, Z., Pop, H. F., Comunicare in Internet, Editura Albastră, Cluj-Napoca, 1998, 130 pp. ISBN 973-9215-61-0. 1996 Vásárhelyi, J., Kása, Z., Mit si adevăr despre virusii PC, Ed. Albastra, Cluj-Napoca, 1996, pp. 231, ISBN 973-9215-23-8 Kása, Z., Robu, J., Varga, I., Barátkozzunk a számítógéppel (Introducere în lumea calculatoarelor, in magh.), Ed. Studium, Cluj, 1996, 148 pp., ISBN 973-97484-8-1 1994 Kása, Z., Algoritmusok tervezése (Proiectarea algoritmilor, in magh.), Editura Studium,

2

Cluj, 1994. 120 pag. ISBN 973-96342-2-2. B3. Cărţi (manuale, monografii, tratate, îndrumare etc.) publicate la alte edituri sau pe plan local 2004 Kása, Z., Formális nyelvek és automaták (în lba. magh.), Farkas Gyula Egyesület a Matematikáért és Informatikáért, Kolozsvár, 2004. pp.146.. 1995 Boian, F., Cioban, V., Frenţiu, M., Groze, Iacob, E., Iurian, S., Kása, Z., Motogna, S., Pârv, B., Pop, H., Prejmerean, V., Robu, J., Toadere, Programare PASCAL. Probleme ilustrative si probleme propuse pentru elevi si studenti, Editura Promedia Plus Computers, Cluj-Napoca, 1995, 228 pag. ISBN 973-96862-1-4.

1993 Boian, F., Chiorean, I., Coman, Gh., Frenţiu, M., Groze, S., Kása, Z., Toadere, T., Ţâmbulea, L., Informatica pentru elevi, Editura MicroInformatica, Cluj, 1992 (ed. I and II), 1993 (ed. III), 210 pag. ISBN 973-96096-2-7

1983 Kása, Z., Ismerkedés az informatikával (Introducere in informatică, lb.magh.), Editura Dacia, 1983., 166 pag. B4. Cărţi (manuale, monografii, tratate, îndrumare etc.) publicate pe web Numai cele care au nr. ISBN.

B5. Capitole de cărţi publicate în străinătate 2013 Algorithms of Informatics, III. Selected topics (ed. A. Iványi), mondAt Kiadó, Budapest,2013. (Chapter 25. Kása Z., M.–C. Anisiu: Complexity of words, pp.1237–1289. ISBN 978-963-87596-7-2. Informatikai algoritmusok III. (ed. A. Iványi), mondAt Kiadó, Budapest,2013. (Chapter 34. Kása Z., M.–C. Anisiu: Szavak bonyolultsága, pp.1697–1739. ISBN 978-963-87596-8-9. 2007 Algorithms of Informatics, I. (ed. A. Iványi), mondAt Kiadó, Budapest, 2007 (Chapter 1. Kása Z: Automata and formal languages, pp.13-79), ISBN 978-963-87595-1-0. Algorithms of Informatics, I. (ed. A. Iványi), mondAt Kiadó, Budapest, 2007 (Chapter 11: Kása Z: Recurrences, pp.478-501), ISBN 978-963-87595-1-0. 2005 Informatikai algoritmusok II. (Algoritmi în informatică II. – in magh.) (ed. A. Iványi), ELTE-Eötvös Kiadó, Budapest, 2005. (capitol 19: Kása Z., Automaták és formális nyelvek – Automate si limbaje formale, pp. 893–959), ISBN 963-463-775-2

3

2004 Informatikai algoritmusok I. (Algoritmi în informatică I. – in magh.) (ed. A. Iványi), ELTE-Eötvös Kiadó, Budapest, 2004. (capitol 1: Kása Z., Rekurzív egyenletek – Ecuaţii recursive, pp. 14–37) ISBN 963-463-664-0 B6. Capitole de cărţi publicate în ţară C. Lucrări ştiinţifice publicate C1. Lucrări ştiinţifice publicate în reviste cotate ISI 2010 Anisiu, M-C., Anisiu, V., Kása, Z., Total palindrome complexity of finite words, Discrete Mathematics, 310 (2010) 109–114. Impact factor: 0.502 (2008) 5-Year Impact Factor: 0.663 (2008) [Zentralblatt] 1999 Ferenczi, S., Kása, Z., Complexity for finite factors of infinite sequences, Theoretical Computer Science, 218 (1999) 177–195. Impact factor:0.843 (2006) 5-Year Impact Factor: 0.995 (2008) [MathSciNet, Zentralblatt] C2. Lucrări ştiinţifice publicate în reviste indexate în baze de date internaţionale (indicaţi şi baza de date) 2013 A. Iványi, Z. Kása: Prism complexity of matrices, Annales Univ. Sci. Budapest., Sect. Comp. 39 (2013) 181–202. 2012 Z. Kása, Z. Kátai, Scattered subwords and composition of naturals, Acta Univ. Sapientiae, Informatica, 4, 2 (2012) 225−236. [Zentralblatt] 2011 Z. Kása, On scattered subword complexity, Acta Univ. Sapientiae, Informatica, 3, 1 (2011) 127−136. [Zentralblatt] Kátai, Z., Kovács, L.I., Kása, Z., Márton, Gy., Fogarasi, K., Fogarasi, F., Cultivating algorithmic thinking: an important issue for both technical and human sciences, Teaching Mathematics and Computer Science (Debrecen), 9, 1 (2011) 107–116. [MathEduc] 2009 Kása Zoltán, Generating and ranking of Dyck words, Acta Universitatis Sapientiae, Informatica, 1, 1 (2009) 109-118 [Zentralblatt] Kása Zoltán, A note on a problem of Ţâmbulea, Studia Universitatis Babes-Bolyai, Informatica, 54, 2 (2009) 139–141 [Zentralblatt] 2006 M-C. Anisiu, V. Anisiu, Z. Kása, Properties of palindromes in finite words, Pure

4

Math. Appl. 17, 3–4 (2006) pp.183–195. http://www.bke.hu/puma/17_3-4.htm [MathSciNet] 2002 Anisiu, M-C., Blázsik, Z., Kása, Z., Maximal Complexity of Finite Words, Pure Math. Appl., 13, 1–2 (2002) pp. 39–48 [MathSciNet, Zentralblatt für Mathematik, RePeC– http://ideas.repec.org/a/cmt/pumath/puma2002v013pp0039-0048.html] Kása, Z., Blázsik, Z., Dominating Sets in De Bruijn Graphs, Pure Math. Appl., 13, 1–2 (2002) pp. 79–85 [MathSciNet, RePeC- http://ideas.repec.org/a/cmt/pumath/puma2002v013pp0079-0085.html] 2001 Bege, A., Kása, Z., Coding objects related to Catalan numbers, Studia Universitatis Babes-Bolyai, Informatica, 46, 1 (2001), pp. 31–40. [MathSciNet, Zentralblatt für Mathematik]

1998 Kása, Z., On the d-complexity of strings, Pure Math. Appl., 9, 1–2 (1998) pp. 119–128. [MathSciNet, Zentralblatt für Mathematik, RePeC – http://ideas.repec.org/a/cmt/pumath/puma1998v009pp0119-0128.html] 1992 Stan, I., Gheorghiu, C. I. , Kása, Z., Effects of surfactants on an undeformable drop intially at rest, Studia Univ. Babes-Bolyai, Math. 38, 2 (1992), 113–126 [Zentralblatt für Mathematik] 1990 Kása, Z., Computing the d-complexity of words by Fibonacci-like sequences, Studia Univ. Babes-Bolyai, Math. 35, 3 (1990), 49–53 [MathSciNet, Zentralblatt für Mathematik] 1989 Boian, F.M., Frentiu, M., Kása, Z., Parallel executable sequences in serial programs, Studia Univ. Babes-Bolyai, Mathematica, 33, 3 (1989), 47–57. [MathSciNet, Zentralblatt für Mathematik] 1987 Kása, Z., Cellular automata in graphs, Studia Univ. Babes-Bolyai, Mathematica, 32, 3 (1987) 17–23 [MathSciNet, Zentralblatt für Mathematik] 1986 Kása, Z., Internal fragmentation of memory in paging systems, Mathematica, 28 (51), 1 (1986) 43–46 [MathSciNet, Zentralblatt für Mathematik] Kása, Z., Ţâmbulea, L., Binary trees and number of states in buddy systems, Annales Univ. Sci. Budapestinensis de R. Eötvös Nominatae, Sectio Computatorica, 7 (1987) 3–10 [MathSciNet, Zentralblatt für Mathematik]

1981

5

Kása, Z., Asupra implementării algoritmului de analiză sintactică a lui Dömölki, Studia Univ. Babes-Bolyai, Mathematica, 26, 1 (1981) 15–23 [MathSciNet, Zentralblatt für Mathematik] Kása, Z., Locating the buddies in the general buddy systems, Studia Universitatis Babes-Bolyai, Mathematica, 26, 4 (1981) 46–50 [MathSciNet, Zentralblatt für Mathematik] 1975 Kása, Z., On k-thin sets and their relation to generalized Ramsey number, Studia Universitatis Babes-Bolyai, Mathematica, 20 (1975) 54–59. [MathSciNet, Zentralblatt für Mathematik] C3. Lucrări ştiinţifice publicate în reviste din străinătate (altele decât cele menţionate anterior) 2014 Iványi Antal, Kása Zoltán: Foksorozatok párhuzamos leszámlálása, Alkalmazott Matematikai Lapok 31 (2014) 41–98.

1995 Kása, Z., Computer-Aided Teaching of Geometry, Mathematics and Informatics Quarterly, 5, 4 (1995), pp. 177–182.

C4. Lucrări ştiinţifice publicate în reviste din ţară, recunoscute CNCSIS (altele decât cele din baze de date internaţionale) 2008 Kása Zoltán, De Bruijn-gráfok mint hálózati modellek (De Bruijn Graphs as Network Model), Műszaki Szemle/Technical Review, 43 (2008) 3–6. http://www.emt.ro/?pg=archivum&id=msz_archiv 1996 Kása, Z., Varga, V., A Graph Model of Distributed Database Systems, Studia Universitatis Babes-Bolyai, Informatica, 41, 2 (1996), pp. 1–6 C5. Lucrări ştiinţifice publicate în reviste, altele decât cele menţionate anterior C6. Lucrări ştiinţifice publicate în volumele conferintelor cotate ISI 1995 Ile Kohr, M, Stan, I, Kása, Z., Numerical analysis for tension gradient flow on the fluid obstacle, Annual Meeting of the Gesellschaft für AngewandteMathematik und Mechanik (Gamm 94), Apr 04-08, 1994, Zeitschrift für Angewandte Mathematik und Mechanik – Applied Mathematics and Mechanics, Vol 75, Supplement 1, 1995–GAMM 94 Annual Meeting Pages: S337-S338 , Published: 1995. [Zentralblatt für Mathematik]

Stan, I, Chifu, E, Kása, Z., Convective diffusion of a soluble surfactant from a free drop, Annual Meeting of the Gesellschaft für-Angewandte Mathematik und Mechanik (Gamm

6

94), Apr 04-08, 1994. Zeitschrift fur Angewandte Mathematik und Mechanik – Applied Mathematics And Mechanics, Vol 75, Supplement 1, 1995–GAMM 94 Annual Meeting Pages: S369-S370, Published: 1995 [Zentralblatt für Mathematik]

C7. Lucrări ştiinţifice publicate în volumele manifestărilor ştiinţifice 2011 Z. Kása, Super-d-complexity of finite words, 8th Joint Conf. on Math. and Computer Science, MACS 2010, July 14–17, 2010., Komárno, Selected Papers, pp. 257–266. Novadat, 2011. 2009 Kása Zoltán, Kátai Zoltán, Legrövidebb utak alkalmazásai hálózatokban (Application of shortest path algorithms in networks), 2nd International Economic Conference, 2-3 April 2009, Kaposvár, Hungary. 2001 Kása, Z., Boian, F. M., Ferdean, C. Improving Distance Education in Computer Science at the Babeş-Bolyai University, Romania Internet Learning Workshop, Internet as a Vehicle for Teaching, Miercurea-Ciuc, August 11–20, 2001., pp. 125–128.

1998 Kása, Z., New Trends in Computer Science Education at the Babes-Bolyai University, Second Turkye International Symposium on Distance Education, Ankara, Turkye, 4-9 May 1998. pp.100–104.

1997 Kása, Z., Behave yourself on Internet, RILW (Romanian Internet Learning Workshop), Ilieni, Romania, 9–14 June 1997. pp. 43–46.

1985 Kása, Z., Cyclic cellular automata, Simpozion "Informatica si aplicatiile sale", Univ. Babeş-Bolyai Cluj-Napoca, 1985, pp. 71–73. 1983 Kása, Z., Fragmentarea internă a memoriei in alocarea dinamică, INFO IASI '83, Lucrările celui de al IV-lea Colocviu de informatică, 27-29 Oct. 1983, Univ. Iasi, 1983 , pp. 138–146.

D. Traduceri de cărţi, capitole de cărţi, alte lucrări ştiinţifice 2008 D. E. Knuth, A számítógép-programozás művészete, 4. kötet 2. rész: Permutációk és n-esek előállítása (The Art of Computer Programming, vol. 4. Fasc. 2. Generating all tuples and permutations), (1 capitol 64. pag) AnTonCom Budapest, 2008 (din engleză in maghiară) ISBN 978-963-8s7947-1-0. 2003

7

Cormen-Leiserson-Rivest-Stein: Új algoritmusok (Introduction to Algorithms – Second edition) (2 capitole), Scolar Könyvkiadó, Budapest, 2003 (din engleză in maghiară), ISBN 963-9293-90-9 2002 Nancy Ann Lynch: Osztott algoritmusok (Distributed Algorithms), (1 capitol), Kiskapu kiadó, Budapest, 2002 (din engleză in maghiară), ISBN 963-9301-03-5 2000 Cormen-Leiserson-Rivest: Introducere in algoritmi (3 capitole), Editura Computer Libris Agora, Cluj, 2000 (din engleză in română), ISBN 973-97534-3-4 1997 Cormen-Leiserson-Rivest: Algoritmusok (Introduction to Algorithms) (2 capitole), Műszaki Könyvkiadó, Budapest, ed. I. 1997, ed. II. 1999, ed. III. 2001 (din engleză în maghiară), ISBN 963-16-3029-3 E. Editare, coordonare de volume 2006 Kassay Gábor, Kása Zoltán, Kolumbán Iosif (eds.), Proceedings of the International Conference In Memoriam Gyula Farkas, Presa Universitara Clujeana, CLUJ-NAPOCA, 2006, P. 155 ISBN 978-973-610-459-6 2003 Szenkovits Ferenc, Andrica Dorin, Blaga Aurel Paul, Kása Zoltán (eds.), Proceedengs of “BOLYAI 200” International Conference on Geometry and Topology, Cluj University Press, CLUJ-NAPOCA, 2003, P. 193 ISBN 973-610-205-X 2002 Kása Zoltán (ed.), 200 éve született Bolyai János/200 de ani de la nasterea lui János Bolyai/200 years since the birth of János Bolyai, PRESA UNIVERSITARA CLUJEANA , CLUJ-NAPOCA, 2002, P. 187 ISBN 973-610-151-7 F. Invenţii G. Contracte de cercetare (menţionaţi calitatea de director sau membru) 2006 Matematica discreta. Grafuri De Bruijn si retele, Grant Academia Română 17, 2006, director 2001–2002.

8

Matematica discreta. Combinatorica cuvintelor. Grant CNCSIS, TEMA NR. 125, COD CNCSIS 64, 2001–2002 director 1975–1989 15 contracte cu MEI in perioada 1975–1989, membru H. Creaţia artistică H1 Participări la manifestaţii artistice internaţionale H2. Participări la manifestaţii artistice naţionale H3. Expoziţii, filme, spectacole, concerte, discuri de autor, opere internaţionale H4. Expoziţii, filme, spectacole, concerte, discuri de autor, opere naţionale H5. Produse cu drept de proprietate intelectuală în domeniul artistic I. Premii, distincţii 2006 Medalia John von Neumann, iunie 2006, acordată de Societatea de Informatică John von Neumann (Budapest) pentru aportul adus dezvoltării informaticii. (http://www.njszt.hu).

J. Citări Menţionaţi citările lucrărilor proprii în reviste de specialitate şi cărţi de specialitate (fără autocitări).

91 citări (lista anexată). K. Participări la conferinţe naţionale şi internaţionale Menţionaţi cele la care aţi prezentat comunicări

2012 9th Joint Conference on Mathematics and Conmputer Science, 9–12 February 2012, Siófok, Hungary 2010 8th Joint Conference on Mathematics and Conmputer Science, 14–17 July 2010, Komárno, Slovakia 2009 2nd International Economic Conference, 2-3 April 2009, Kaposvár, Hungary. 2008 7th Joint Conference on Mathematics and Conmputer Science, Cluj 2006 6th Joint Conference on Mathematics and Conmputer Science, Pécs, Hungary 2005 Conferinta “Informatika a felsőoktatásban '2005” Debrecen, 2005, Hungary . 2004

9

5th Joint Conference on Mathematics and Conmputer Science, Debrecen, Hungary CSCS (Conference for PhD Students in Computer Science) Szeged (Ungaria) 1–4 iulie 2004, invited talk: Complexity of finite and infinite words 2001 4th Joint Conference on Mathematics and Conmputer Science, Baile Felic–Oradea 1999 3th Joint Conference on Mathematics and Conmputer Science, Visegrád, Hungary 1998 Conferinţa internaţională de educaţie la distantă, Ankara (Turcia), 1998. 1997 2th Joint Conference on Mathematics and Conmputer Science, Ilieni –Sf. Gheorghe 1996 Conferinta “Informatika a felsőoktatásban '1996” Debrecen, 1996. 1995 1th Joint Conference on Mathematics and Conmputer Science, Ilieni –Sf. Gheorghe 1993 Conferinţa Internaţională de Combinatorică, Keszthely (Ungaria), 1993. 1981 Conferinţa Internaţională de Combinatorică, Eger (Ungaria), 1981. L. Alte realizări semnificative Participari la programe finantate din surse internationale:

Programul/Proiectul Funcţia Perioada:de la... până

la... Acord intre Academia Roamână şi Ungară

membru 2012, 2011, 2010, 2009, 2008, 2007, 2006, 2005,

2004 Acord intre Academia Roamână şi CNSR Franţa

coordonator local 2004–2006, 1997–2000

CEEPUS H-0066 coordonator local, UBB Cluj

1998–2001

CEEPUS H-0081 (acum CII-H0019) coordonator local, UBB Cluj

1998–2007

FKFP 0389-1997 (Univ. Tehnică Budapesta)

coordonator local, UBB Cluj

1997–1999

Tempus S_JEP 11168/96 persoana de 1997–1999

10

contact, UBB Cluj

Membru in comitetele de organizare ale conferintelor internationale: KEPT 2009: The Second International Conference on Knowledge Engineering: Principles and Techniques, Cluj-Napoca, Romania, 2–4 July 2009. The Sixth Conference of PhD Students in Computer Science, 2–5 July, 2008, Szeged (Ungaria), http://www.inf.u-szeged.hu/~cscs/ (member in Scientific Committee) Joint International Conference in Mathematics and Computer Science, Ilieni (Romania) 1995, 1997, Visegrád (Hungary) 1999, Oradea-Felix (Romania) 2001, Debrecen (Hungary) 2004, Pécs (Hungary) 2006, Cluj-Napoca 2008, Komárno, 2010. SPLST 10th Symposium on Programming Languages and Software Tools, Dobogókö, Hungary, 14–16 June 2007 KEPT 2007: The First International Conference on Knowledge Engineering: Principles and Techniques, Cluj-Napoca, Romania, 2007 International Conference In Memoriam Gyula Farkas, Cluj-Napoca, 23–26 August 2005 CSCS - Conference of PhD Students in Computer Science, Szeged, Hungary, June 29–July 2, 2010. (member in Scientific Committee) http://www.inf.u-szeged.hu/~cscs Referate ştiinţifice articole: Á. Balogh and Z. Csörnyei: Subject-oriented operating system development based on system predicate classes, Conferinta SPLST 2007, Ungaria Kátai Zoltán, Nyakóné Juhász Katalin, Zsakó László: Mivel foglalkozik az informatika szakmódszertan? (Cu ce se ocupa didactica informaticii - in magh.) Krassimir D. Tarkalanov: Prefix-free languages, simple grammars representing a group element, languages of partial order in a group, Studia Universitatis babes-Bolyai, Informatica, 51,1 (2006) 59-68. Kilián Imre: Modellvezérelt szofterek készítése és a módszer alkalmazása a természetvédelemben (Creare software dirijat de modele si aplicatii) pentru Alkalmazott Matematikai Lapok (Ungaria) cărţi: Csörnyei Zoltán: Fordítóprogramok (Compilatoare - magh.), Typotex, Budapest, 2006. ISBN 963-9548-83-9 Evaluare granturi naţionale CNCSIS 2002-2003, CNMP–PNCDI2 2008 internaţionale

11

JAP (Jedlik Ányos Program), NKTH (Nemzeti Kutatási és Technológiai Hivatal), Budapest, Ungaria 2006, 2007 Teze de doctorat conduse şi susţinute Bodó Zalán (2009) Minier Zsolt (2009) Pătcaș Csaba (2011) Jánosi-Rancz Tünde Katalin (2014) Comisii de doctorat Univ. Iasi, Univ. Bucuresti (Silviu Dumitrescu, cond. Solomon Marcus), Univ.Cluj (Gaskó Noémi, cond. D. Dumitrescu; Mihoc T., cond. D. Dumitrescu; Gog Anca, cond. D. Dumitrescu) 10 sept. 2015

12

Citări Kása Zoltán Nr. citãri: 91

Ferenczi, S., Kása, Z., Complexity for finite factors of infinite sequences, Theoretical Computer Science, 218 (1999) 177–195.

1) Anisiu, M-C., Global Complexities for Infinite Sequences, Analysis, Functional Equations, Approximation and Convexity, Ed. L. Lupsa, M. Ivan, Carpatica, Cluj-Napoca, 1999, pp. 7–11.

2) A. de Luca, On the combinatorics of finite words, Theoretical Computer Science, 218 (1999), 13–39.

3) J-P. Allouche, M. Baake, J. Cassaigne, D. Damanik, Palindrom complexity, Theoretical Computer Science, 292 (2003), 9–31.

4) D. Lenz, Hierarchical structures in Sturmian dynamical systems, Theoretical Computer Science, 303 (2003), 453–490.

5) V. Berthé, Systemes dynamiques symboliques sturmiens et substitutifs, Ecole Jeunes chercheurs en algorithmique et calcul formal, Lille, 25–29 mars 2002.

6) S. Fraenkel, New games related to old and new sequences, INTEGERS: Electronic Journal of Combinatorial Number Theory, 4 (2004) #G06. pp.18

7) J.-P.Allouche, Algebraic and Analytic Randomness in Physics and Astronomy, Lecture Notes in Physics, vol. 550/2000 pp. 345-356, Springer.

8) J.-P.Allouche, Nouveaux résultats de transcendance de réels à développement non aléatoire, Gazette des Mathématiciens 84 (2000), 19-34.

9) A. Aberkane, Utilisation des graphes de Rauzy dans la caractérisation de certaines familles de suites de faible complexité, Thèse de Doctorat, Univ. d'Aix Marseille II, 2002.

10) Barcucci E, Belanger L, Brlek S: On Tribonacci sequences, Fibonacci Quarterly 42 (4): 314-319, 2004

11) Iványi Antal, Párhuzamos algoritmusok, ELTE Eötvös Kiadó, Budapest, 2003.

12) M.-C. Anisiu, A. Iványi: Two-dimensional arrays with maximal complexity, Pure Math. Appl, 17,3-4 (2006) 197–204.

13) M-C. Anisiu, V. Anisiu: Two-dimensional total palindrome complexity, Annals of the Tiberiu Popoviciu Seminar of Functional Equations, Approximation and Convexity, 6 (2008) 3–12 ISSN 1584-4536

14) C Elzinga, S Rahmann, H Wang , Algorithms for subsequence combinatorics, Theoretical Computer Science, 409, 3 (2008) 394–404 15) A. Glen, On Sturmian and episturmian words, and related topics, PhD Thesis, Adelaide Unniversity, 2006. 16) J.L. Davison, Quasi-periodic continued fractions, J. of. Number Theory, 127, 2 (2007) 272–282. 17) Y. Moshe, On the subword complexity of Thue–Morse polynomial extractions, Theor. Comput. Science, 389, 1–2 (2007) 318–329 18) I. Goldstein , Asymptotic subword complexity of fixed points of group substitutions, Theor. Comput. Science, 410, 21–23 (2009) 2084–2098. 19) C. H. Elzinga, Complexity of categorical time series, Sociological Methods & Research, 38, 3 (2010), 463-481. http://home.fsw.vu.nl/ch.elzinga/Complexity%20Preliminary.pdf 20) Recenzia: MathSciNet (http://www.ams.org) MR2521934: P. Arnoux, Complexité de suites à valeurs dans un ensemble fini: quelques exemples. (French) Aspects des systèmes dynamiques, 53--67, Ed. Éc. Polytech., Palaiseau, 2009.

13

21) A. Iványi, B. Novák, Testing of sequences by simulations, Acta Univ. Sapientiae, Informatica, 2, 2 (2010) 135–153. 22) A. Iványi, I. Kátai, Testing of random matrices, Acta Univ. Sapientiae, Informatica, 3, 1 (2011) 99−126 23) I. Goldstein, Subword complexity of uniform D0L words over finite groups, Theoretical Computer Science, 412, 41 (2011) 5728–5743 doi:10.1016/j.tcs.2011.06.019 24) C. S. Mørch, A. Bjerre, M. P. Gøttrup, S. C. Sorenson, J. Schramm: Ammonia/hydrogen mixtures in an SI-engine: Engine performance and analysis of a proposed fuel system, Fuel, 90, 1 (2011) 854−864.

Kása, Z., On the d-complexity of strings, Pure Math. Appl., 9, 1–2 (1998) pp. 119–128.

1) F. Levé, P. Séébold, Proof of a conjecture on word complexity, Bull. Belg. Math. Soc. Simon Stevin, 8, 2 (2001) pp. 277–291

2) S. Janson, S. Lonardi, W. Szpankowski, On average sequence complexity, Theoretical Computer Science, 326, 1-3 (2004) pp. 213–227.

3) Janson S, Lonardi S, Szpankowski W, On the average sequence complexity, Lecture Notes in Computer Science 3109: 74-88, 2004

4) A. Flaxman, A. W. Harrow, G. B. Sorkin, Comment on EJC, volume 11, article r8 (January 5, 2004) ''Strings with maximally many distinct subsequences ans substrings'', The Elect. J. Comb., http://www.combinatorics.org/Volume_11/Comments/v11i1r8comments2.html

5) M.-C. Anisiu, A. Iványi: Two-dimensional arrays with maximal complexity, Pure Math. Appl, 17, 3-4 (2006) 197–204. 6) M-C. Anisiu, V. Anisiu: Two-dimensional total palindrome complexity, Annals of the Tiberiu Popoviciu Seminar of Functional Equations, Approximation and Convexity, 6 (2008) 3–12 ISSN 1584-4536 7) C Elzinga, S Rahmann, H Wang , Algorithms for subsequence combinatorics, Theoretical Computer Science, 409, 3 (2008) 394–404. 8) C. H. Elzinga, Complexity of categorical time series, Sociological Methods & Research, 38, 3 (2010), 463-481. http://home.fsw.vu.nl/ch.elzinga/Complexity%20Preliminary.pdf 9) A. Iványi, B. Novák, Testing of sequences by simulations, Acta Univ. Sapientiae, Informatica, 2, 2 (2010) 135–153 10) A. Iványi, I. Kátai, Testing of random matrices, Acta Univ. Sapientiae, Informatica, 3, 1 (2011) 99−126 11) Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld and Adam Smith, Sublinear Algorithms for Approximating String Compressibility, Approximation, Randomization, and Combinatorial Optimization Algorithms and Techniques Lecture Notes in Computer Science, 2007, Volume 4627/2007, pp. 609-623, DOI: 10.1007/978-3-540-74208-1_44 http://www.eng.tau.ac.il/~danar/Public-pdf/comp.pdf Raskhodnikova, Sofya; Ron, Dana; Rubinfeld, Ronitt; Smith, Adam Sublinear algorithms for approximating string compressibility. Algorithmica 65. 3 (2013) 685–709. 12) B Kozarzewski, Similarity of symbolic sequences, arXiv:1108.1979, 2011 - arxiv.org 13) Fabio Cunial: Analysis of the subsequence composition of biosequences, PhD Thesis, School of Computational Science and Engineering Georgia Institute of Technology August 2012, http://www.cc.gatech.edu/grads/f/fcunial3/thesis.pdf 14) B Kozarzewski, A Method for Nucleotide Sequence Analysis, COMPUTATIONAL METHODS IN SCIENCE

14

AND TECHNOLOGY 18(1)(2012)

Kása, Z. Combinatoricã cu aplicaţii, Editura Presa Universitarã Clujeanã, Cluj-Napoca, 2003, 188 Pag. ISBN 973-610-152-5

1) D, VĂCĂREŢU, UNIMODALITATE ŞI ALGEBRE LIE, TEZĂ DE DOCTORAT, UBB, 2007.

2) Bege Antal, Rekurzív sorozatokkal kapcsolatos feladatok, Presa Universitară Clujeană, 2007, ISBN 978-973-610-560-9

3) Bege Antal, Skatulyaelvvel kapcsolatos feladatok, Presa Universitară Clujeană, 2007, ISBN 978-973-610-562-3

4) Iványi, A. Density of safe matrices, Acta Univ. Sapientiae, Math., 1, 2 (2009) 121–142.

5) Mircea D. Farcas, Aproximarea functiilor de una sau mai multe variabile prin siruri de operatori liniari, Teza de doctorat. 2008 http://vberinde.ubm.ro/multimedia/doctorate/doctoranzi/teze/rezumat_farcas_ro.pdf 6) Vasile Mircea Popa, Aspecte de combinatorică cu aplicaţii în electrotehnică, Editura Universităţii "Lucian Blaga" din Sibiu, Sibiu, 2009. 7) Grigor Moldovan, Limbaje formale şi teoria automatelor, Editura EduSoft, Bacău, 2005.

Bege, A., Kása, Z., Coding objects related to Catalan numbers, Studia Universitatis Babes-Bolyai, Informatica, 46, 1 (2001), pp. 31–40.

1) Wüst, J., Prediction of Yield-line Geometries for Arbitrary Simply Supported Slabs, PAMM – Proc. Appl. Math. Mech. 4 (2004) 384–385.

2) Wüst, J., Formfinndung der Fließliniengeometrie für polygonale Platten im Traglastzustand, DOKTOR–INGENIEURS DISSERTATION, Karlsruhe 2006

3) Wüst, J., Wagner, W, Ein Algorithmus zur Bestimmung und Optimierung von Fließlinienfiguren für beliebige Polygonplatten, BAUTECHNIK, 85,3 (2008) 161–174.

4) Wüst, J., Wagner, W, Systematic prediction of yield-line configurations for arbitrary polygonal plates, Engineering Structure, Volume 30, Issue 7, July 2008, Pages 2081–2093/

5) Iványi, A. Density of safe matrices, Acta Univ. Sapientiae, Math., 1, 2 (2009) 121–142.

Kása, Z., Algoritmusok tervezése (Proiectarea algoritmilor, în magh.), Editura Studium, Cluj, 1994. 120 Pag. Isbn 973-96342-2-2.

1) IVÁNYI ANTAL, PÁRHUZAMOS ALGORITMUSOK, ELTE EÖTVÖS KIADÓ, BUDAPEST, 2003.

2) Oláh-Gál Róbert: Az informatika alapjai közgazdász és mérnök hallgatóknak,. Ed. Scientia, Cluj, 2007

3) Ionescu Klára: Bevezetés az algoritmikába, Presa Universitara Clujeana, 2007. ISBN 978-973-610-604-0

Anisiu, M-C., Blázsik, Z., Kása, Z., Maximal complexity of finite words, Pure Math. Appl., 3, 1–2 (2002) pp. 39–48.

1) A. Flaxman, A. W. Harrow, G. B. Sorkin, Comment on EJC, volume 11, article r8 (January 5, 2004) ''Strings with maximally many distinct subsequences ans substrings'', The Elect. J. Comb., http://www.combinatorics.org/volume_11/comments/v11i1r8comments2.html

15

2) C Elzinga, S Rahmann, H Wang , Algorithms for subsequence combinatorics, Theoretical Computer Science, 409, 3 (2008) 394–404. 3) A. Iványi, I. Kátai, Testing of random matrices, Acta Univ. Sapientiae, Informatica, 3, 1 (2011) 99−126 4) H Vogel: On the shape of subword complexity sequences of finite words, arXiv:1309.3441, 2013

Kása Z., On arc-disjoint Hamiltonian cycles in De Bruijn graphs, arXiv 103.1520 http://www.arxiv.org 1) A. Iványi, I. Kátai, Testing of random matrices, Acta Univ. Sapientiae, Informatica 3, 1 (2011) 99−126 2) Yaw-Ling Lin, Charles Ward, Bharat Jain and Steven Skiena, Constructing Orthogonal de Bruijn Sequences, in Algorithms and Data Structures, Lecture Notes in Computer Science, 2011, Volume 6844/2011, pp. 595-606. 3) J. Baker, De Bruijn Graphs And Their Applications To Fault Tolerant Networks, http://www.math.oregonstate.edu/~swisherh/JoelBaker.pdf Scholar Archiv at Oregon State University http://ir.library.oregonstate.edu/xmlui/handle/1957/26215

Kása, Z., Varga, V., A Graph Model of Distributed Database Systems, Studia Universitatis Babes-Bolyai, Informatica, 1, 2 (1996), pp. 1–6 1) H. A. Grebla, Game theory in data allocation for distributed databases, Acta Universitatis Apulensis, 11 (2006) 325–331 2) H Grebla, G Moldovan, S.A Darabant, A, Câmpan, Data Allocation In Distributed Database Systems Performed By Mobile Intelligent Agents, Proceedings of the International Conference on Theory and Applications of Mathematics and Informatics– ICTAMI 2004, Thessaloniki, Greece, 184–173

Anisiu, M-C., Anisiu, V., Kása, Z., Total palindrome complexity of finite words, Discrete Mathematics, 310 (2010) 109–114. 1) T. I, S. Inenaga, H. Bannai, M. Takeda. Counting and verifying maximal palindromes. In: E.Chavez, S. Lonardo (Eds.), Proceeding of 17th Internatioonal Symposium on String Processing and Information Retrieval (Los Cabos, Mexico, October 11–79, 2010), LNCS 6393, pp. 135–146 Springer-Verlag.

2) Tomohiro I, S. Inenaga, M. Takeda, Palindrome pattern matching, Proceeding CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching, LNCS 6661, 2011, Springer-Verlag Berlin, Heidelberg, pp. 232-245. also in: Theor. Comput. Science 2012, volume 483, issue , year 2013, pp. 162–170.

3) Luciano P. Silva, Elibio L. Rech, Unravelling the biodiversity of nanoscale signatures of spider silk fibres, Nature Communications 4/2013, Article number: 3014 doi:10.1038/ncomms4014

4) Hwee Kim, Yo-Sub Han: Online Multiple Palindrome Pattern Matching, String Processing and Information Retrieval, Lecture Notes in Computer Science Volume 8799, 2014, pp. 173-178 5) Gupta, Shivika ; Prasad, Rajesh ; Yadav, Sunita : Searching Gapped Palindromes Using Inverted Suffix Array, Proceedings 2015 IEEE International Conference on Computational Intelligence and Communication Technology, CICT 2015, pp. 186–191 6) Toussaint, Godfried T. ; Onea, Noris S.; Vuong, Quan H.: Measuring the complexity of two-dimensional binary patterns — Sub-symmetries versus Papentin complexity, 14th IAPR International Conference on Machine Vision Applications (MVA) May 18-22, 2015. Miraikan, Tokyo, Japan, pp. 480-483 7. Paweł Gawrychowski, Tomasz Kociumaka, Wojciech Rytter and Tomasz Waleń: Tight Bound

16

for the Number of Distinct Palindromes in a Tree, to appear in SPIRE 2015

Informatikai algoritmusok I. (Algoritmi în informaticã I. – in magh.) (ed. A. Iványi), ELTE-Eötvös Kiadó, Budapest, 2004. (capitol 1: Kása Z., Rekurzív egyenletek – Ecuaþii recursive, pp. 14–37) ISBN 963-463-664-0

1) BEGE ANTAL, REKURZÍV SOROZATOKKAL KAPCSOLATOS FELADATOK, PRESA UNIVERSITARĂ CLUJEANĂ, 2007, ISBN 978-973-610-560-9

2) Iványi, A. Density of safe matrices, Acta Univ. Sapientiae, Math., 1, 2 (2009) 121–142.

Bege, A., Kása, Z., Algoritmikus kombinatorika és számelmélet, Ed. Presa Universitara Clujeana, 2006. 1) Iványi, A., Reconstruction of complete interval tournaments. II. Acta Universitatis Sapientiae, Mathema-tica, 2, 1 (2010) 47−71 2) Csató L., Egri E., A logikai és funkcionális programozás alapjai, Presa Universitara Clujeana, 2010

Kása Z., Computing the d-complexity of words by Fibonacci-like sequences, Studia Univ. Babes-Bolyai, Math., 35, 3 (1990) 49–53 1) A. Iványi, B. Novák, Testing of sequences by simulations, Acta Univ. Sapientiae, Informatica, 2, 2 (2010) 135–153. 2) A. Iványi, I. Kátai, Testing of random matrices, Acta Univ. Sapientiae, Informatica, 3, 1 (2011) 99−126

Kása, Z., On k-thin sets and their relation to generalized Ramsey number, Studia Universitatis Babes-Bolyai, Mathematica, 20 (1975) 54–59.

1) A. Seress, k-sum-free decompositions, Mat. Lapok (Ungaria), 31 (1983) pp. 191–194.

Bege, A., Kása, Z., Tóth L., Relációk és alkalmazásaik (Relatii si splicatiile sale), Budapesti Mûszaki Egyetem, 1999. (For Phd Students)

1) Detrekői Ákos, Szabó György, Térinformatika, Nemzeti Tankönyvkiadó, Budapest, 2002. (pag. 282)

Kása, Z., Two conjectures on complexity of words, Second Joint Conference on Modern Applied Mathematics, Ilieni/Illyefalva, Romania, 2-8 June 1997.

1) F. Levé, P. Séébold, Proof of a conjecture on word complexity, Bull. Belg. Math. Soc. Simon Stevin, 8, 2 (2001) pp. 277–291.

M-C. Anisiu, V. Anisiu, Z. Kása, Properties of palindromes in finite words, Pure Math. Appl. 17, 3–4 (2006) pp.183–195. http://www.bke.hu/puma/17_3-4.htm [MathSciNet] 1) M-C. Anisiu, V. Anisiu: Two-dimensional total palindrome complexity, Annals of the Tiberiu Popoviciu Seminar of Functional Equations, Approximation and Convexity, 6 (2008) 3–12 ISSN 1584-4536 2) 4) C Morfonios, P Schmelcher, PA Kalozoumis, F.K. Diakonos, Local symmetry dynamics in one-dimensional aperiodic lattices: a numerical study, Nonlinear Dynamics, 78 (2014) 71–91.

17

Kása, Z., Bege, A., Matematică discretă, CFCID, Univ. Babeş-Bolyai, Cluj-Napoca, 2002, pp. 102, 2003, pp. 102. 1) Mircea CHINDRIS, Bogdan TOMOIAGA, Algorithme Pour La Détermination Des Équipements Critiques D’un Réseau Électrique, Univ. of Oradea, Fac. of Energy Engineering, Annual Conference of Energy Engineering, 2004. http://www.energy-cie.ro/content/view/21/45/

Blaga P., Kása, Z., Tâmbulea L., Culegere de algoritmi, Litografia Univ. Babes-Bolyai, Cluj-Napoca, 1977. 1) Dan Tãtaru, Tehnica simulãrii. Aplicaþii în biologie (disertaþie), Univ. Bacãu, 88 p. 2003. http://www.tesionline.it/default/tesi.asp?idt=16212

Kása Z., Generating and ranking of Dyck words, Acta Universitatis Sapientiae, Informatica, 1, 1 (2009) 109-118 [Zentralblatt]

1) Iványi, A. Density of safe matrices, Acta Univ. Sapientiae, Math., 1, 2 (2009) 121–142.

Kása Z., Super-d-complexity of finite words, Proc. 8th Joint Conf. on Math. and Comput. Sci., Komárno, Slovakia, July 14–17, 2010. 1) A. Iványi, B. Novák, Testing of sequences by simulations, Acta Univ. Sapientiae, Informatica, 2, 2 (2010) 135–153.

Kása Z., On scattered subword complexity, Acta Univ. Sapientiae, Informatica, 3, 1 (2011) 127−136 1) A. Iványi, I. Kátai, Testing of random matrices, Acta Univ. Sapientiae, Informatica 3, 1 (2011) 99−126 2) C. H. Elzinga. H. Wang: Kernels for acyclic digraphs, Pattern Recognition Letters, 33,16 (2012) 2239-2244 3) C. H. Elzingam . H. Wang: Versatile string kernels, THEORETICAL COMPUTER SCIENCE Volume: 495 Pages: 50-65

Kása Z., Hamiltonian Cycles in De Bruijn Graphs, 7th Joint Conference in Mathematics and Computer Science, Cluj-Napoca, 2008. 1) Krisztian Antal Buza, Fusion methods for time-series classification models, PhD Thesis, Univ. Hildeshime, 2011, http://www.ismll.uni-hildesheim.de/pub/pdfs/Buza_thesis.pdf

18 septembrie 2015