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.
CoRR, 2019

2011
On scattered subword complexity
CoRR, 2011

Super-d-complexity of finite words
CoRR, 2011

Binary trees and number of states in buddy systems
CoRR, 2011

2010
Total palindrome complexity of finite words.
Discret. Math., 2010

On arc-disjoint Hamiltonian cycles in De Bruijn graphs
CoRR, 2010

Coding objects related to Catalan numbers
CoRR, 2010

Maximal Complexity of Finite Words
CoRR, 2010

Properties of palindromes in finite words
CoRR, 2010

On the d-complexity of strings
CoRR, 2010

Generating and ranking of Dyck words
CoRR, 2010

1999
Complexity for Finite Factors of Infinite Sequences.
Theor. Comput. Sci., 1999


  Loading...