Zoltán Kása

According to our database1, Zoltán Kása authored at least 12 papers between 1999 and 2019.

Collaborative distances:
  • Dijkstra number2 of six.
  • Erdős number3 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Warshall's algorithm - survey and applications.
[BibTeX]
[DOI]
Zoltán Kása
CoRR, 2019

2011
On scattered subword complexity
[BibTeX]
[DOI]
Zoltán Kása
CoRR, 2011

Super-d-complexity of finite words
[BibTeX]
[DOI]
Zoltán Kása
CoRR, 2011

Binary trees and number of states in buddy systems
[BibTeX]
[DOI]
Zoltán Kása
,
Leoan Tâmbulea
CoRR, 2011

2010
Total palindrome complexity of finite words.
[BibTeX]
[DOI]
Mira-Cristiana Anisiu
,
Valeriu Anisiu
,
Zoltán Kása
Discret. Math., 2010

On arc-disjoint Hamiltonian cycles in De Bruijn graphs
[BibTeX]
[DOI]
Zoltán Kása
CoRR, 2010

Coding objects related to Catalan numbers
[BibTeX]
[DOI]
Antal Bege
,
Zoltán Kása
CoRR, 2010

Maximal Complexity of Finite Words
[BibTeX]
[DOI]
Mira-Cristiana Anisiu
,
Zoltán Blázsik
,
Zoltán Kása
CoRR, 2010

Properties of palindromes in finite words
[BibTeX]
[DOI]
Mira-Cristiana Anisiu
,
Valeriu Anisiu
,
Zoltán Kása
CoRR, 2010

On the d-complexity of strings
[BibTeX]
[DOI]
Zoltán Kása
CoRR, 2010

Generating and ranking of Dyck words
[BibTeX]
[DOI]
Zoltán Kása
CoRR, 2010

1999
Complexity for Finite Factors of Infinite Sequences.
[BibTeX]
[DOI]
Sébastien Ferenczi
,
Zoltán Kása
Theor. Comput. Sci., 1999


  Loading...