Folgen
Zoltán Kása
Zoltán Kása
Retired Professor of Computer Science, Sapientia Hungarian University of Transylvania, Cluj
Bestätigte E-Mail-Adresse bei ms.sapientia.ro - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Complexity for finite factors of infinite sequences
S Ferenczi, Z Kása
Theoretical computer science 218 (1), 177-195, 1999
281999
Total palindrome complexity of finite words
MC Anisiu, V Anisiu, Z Kása
Discrete Mathematics 310 (1), 109-114, 2010
252010
On the -complexity of strings
Z Kása
Pure Mathematics and Applications 9 (1-2), 119-128, 1998
221998
Coding objects related to Catalan numbers
A Bege, Z Kása
arXiv preprint arXiv:1003.1385, 2010
182010
Generating and ranking of Dyck words
Z Kása
arXiv preprint arXiv:1002.2625, 2010
142010
Maximal complexity of finite words
M Anisiu, Z Blázsik, Z Kása
Pure Mathematics and Applications 13 (1-2), 39-48, 2002
122002
On scattered subword complexity
Z Kása
arXiv preprint arXiv:1104.4425, 2011
82011
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
62011
On arc-disjoint hamiltonian cycles in de Bruijn graphs
Z Kása
arXiv preprint arXiv:1003.1520, 2010
62010
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
61993
Algorithms of Informatics
M Khan, MC Anisiu, L Domoszali, A Iványi, Z Kasa, S Pirzada, L Szécsi, ...
Mondat Kft. Budapest, 2013
52013
Algoritmikus kombinatorika és számelmélet
B Antal, K Zoltán
Presa Universitară Clujeană, 2006
52006
Dominating sets in de Bruijn graphs
Z Blázsik, Z Kása
Pure mathematics and applications 13 (1-2), 79-85, 2002
52002
Super-d-complexity of finite words
Z Kása
arXiv preprint arXiv:1104.4424, 2011
42011
Properties of palindromes in finite words
MC Anisiu, V Anisiu, Z Kása
arXiv preprint arXiv:1002.2723, 2010
42010
Computing the d-complexity of words by Fibonacci-like sequences, Studia Univ
Z Kása
Babes-Bolyai, Math 35 (3), 49-53, 1990
41990
Complexity of finite and infinite words
S Ferenczi, Z Kása
Theoretical Computer Science 218, 177-195, 1999
31999
Complexity of words
Z Kása, MC Anisiu
Algorithms of Informatics 3, 1259-1334, 1995
31995
Warshall's algorithm--survey and applications
Z Kása
arXiv preprint arXiv:1905.00276, 2019
22019
Binary trees and number of states in buddy systems
Z Kása, L Tâmbulea
arXiv preprint arXiv:1101.2964, 2011
22011
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20