Zoltán Kása

Cited by

	All	Since 2018
Citations	179	34
h-index	7	3
i10-index	6	0

19992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220231 2 1 3 9 1 10 5 12 11 18 18 8 14 7 11 4 4 2 5 7 5 12 3

Co-authors

Mira-Cristiana Anisiu OR Mira-Cristian...T Popoviciu Institute of Numerical Analysis Cluj-NapocaVerified email at ictp.acad.ro
Valeriu AnisiuBabeș-Bolyai UniversityVerified email at math.ubbcluj.ro
Zoltan KataiAssociate professor of Computer Science, Sapientia Hungarian University of TransylvaniaVerified email at ms.sapientia.ro
Leon TambuleaBabes Bolyai UniversityVerified email at cs.ubbcluj.ro
Calin-Ioan GheorghiuTiberiu Popoviciu Institute of Numerical Analysis, Romanian AcademyVerified email at ictp.acad.ro
Viorica Vargaassoc.professor of Computer Science, Babeș-Bolyai UniversityVerified email at ubbcluj.ro
Kinga FogarasiSapientia UniversityVerified email at ms.sapientia.ro
Gaskó NoémiBabeș-Bolyai UniversityVerified email at ubbcluj.ro
Ferenc SzenkovitsBabeș-Bolyai University, Cluj-NapocaVerified email at ubbcluj.ro
Dorin AndricaBabeș-Bolyai University, Cluj-Napoca, RomaniaVerified email at math.ubbcluj.ro
Ildiko Ilona MezeiBabes-Bolyai University of Cluj-NapocaVerified email at ubbcluj.ro
Antal BEGEMathematician
Kovács Lehel Istvánlecturer, Sapientia - Hungarian University of Transylvania
Mirela KohrProfessor of Mathematics, Babeș-Bolyai University, Cluj-NapocaVerified email at ubbcluj.ro

Zoltán Kása

Retired Professor of Computer Science, Sapientia Hungarian University of Transylvania, Cluj

Verified email at ms.sapientia.ro - Homepage

Combinatorics Discrete Mathematics


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Complexity for finite factors of infinite sequences S Ferenczi, Z Kása Theoretical computer science 218 (1), 177-195, 1999	29	1999
Total palindrome complexity of finite words MC Anisiu, V Anisiu, Z Kása Discrete Mathematics 310 (1), 109-114, 2010	23	2010
On the d-complexity of strings Z Kása arXiv preprint arXiv:1002.2721, 2010	21	2010
Coding objects related to Catalan numbers A Bege, Z Kása arXiv preprint arXiv:1003.1385, 2010	17	2010
Generating and ranking of Dyck words Z Kása arXiv preprint arXiv:1002.2625, 2010	14	2010
Maximal complexity of finite words MC Anisiu, Z Blázsik, Z Kása arXiv preprint arXiv:1002.2724, 2010	12	2010
On scattered subword complexity Z Kása arXiv preprint arXiv:1104.4425, 2011	7	2011
Effects of surfactants on an undewformable drop initially at rest I Stan, CI Gheorghiu, Z Kasa Studia Univ. Babes-Bolyai, Mathematica 38 (2), 113-126, 1993	6	1993
Cultivating algorithmic thinking: an important issue for both technical and HUMAN sciences Z Kátai, LI Kovács, Z Kása, G Márton, K Fogarasi, F Fogarasi Teaching Mathematics and Computer Science 9 (1), 1-10, 2011	5	2011
On arc-disjoint hamiltonian cycles in de Bruijn graphs Z Kása arXiv preprint arXiv:1003.1520, 2010	5	2010
Algoritmikus kombinatorika és számelmélet B Antal, K Zoltán Presa Universitară Clujeană, 2006	5	2006
Dominating sets in de Bruijn graphs Z Blázsik, Z Kása Pure mathematics and applications 13 (1-2), 79-85, 2002	5	2002
Super-d-complexity of finite words Z Kása arXiv preprint arXiv:1104.4424, 2011	4	2011
Properties of palindromes in finite words MC Anisiu, V Anisiu, Z Kása arXiv preprint arXiv:1002.2723, 2010	4	2010
Computing the d-complexity of words by Fibonacci-like sequences, Studia Univ Z Kása Babes-Bolyai, Math 35 (3), 49-53, 1990	4	1990
Complexity of finite and infinite words S Ferenczi, Z Kása Theor. Comp. Sci 218, 177-195, 1999	3	1999
Formális nyelvek és fordítóprogramok Z Csörnyei, Z Kása Presa Universitară Clujeană, 2007	2	2007
Algoritmusok tervezése Z Kása Stúdium, 1994	2	1994
A Graph Model of Distributed Database Systems Z KÁSA, V VARGA Studia Universitatis Babes-Bolyai, Informatica 41 (2), 1-6, 1986	2*	1986
Culegere de algoritmi P Blaga, Z Kása, L Ţâmbulea Universitatea" Babeş-Bolyai, 1976	2	1976

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors