english | česky

Homepage for Karel Klouda

Address

Department of Theoretical Computer Science, FIT, CTU in Prague
Kolejní 550/2 (map)
160 00 Praha 6

Room: 228
Email: karel.klouda@fit.cvut.cz
Mobile phone: (+420) 774 552 735
Skype: vydri_puch

I am a teaching fellow at the Faculty of Information Technology of the Czech Technical University in Prague.

I am a Ph.D. student at Czech Technical University in Prague and at University Denis Diderot - Paris VII participating in the co-tutelle programme supported by the French Government.
My advisors are Edita Pelantová and Christiane Frougny.

[3] Christiane Frougny, Karel Klouda: Rational base number systems for p-adic numbers, in Proc. 13th Mons Theoretical Computer Science Days (2010), 12 pp. (text, PDF, 726 kB)
[2] Ľubomira Balková, Karel Klouda, Edita Pelantová: Repetitions in beta-integers, Letters in Mathematical Physics 87 (2009), 181-195 [arXiv:0812.4006v1]
[1] Karel Klouda, Edita Pelantová: Factor complexity of infinite words associated with non-simple Parry numbers, Integers - Electronic Journal of Combinatorial Number Theory 9 (2009), 281-310 (available on pages of the journal)

[3] Ľubomira Balková, Karel Klouda, Edita Pelantová: Critical exponent of infinite words associated with non-simple Parry numbers [arXiv:1007.2724v1]
[2] Karel Klouda: Bispecial factors in fixed points of circular substitutions [arXiv:coming soon]
[1] Karel Klouda: BSA - exact algorithm computing LTS estimate [arXiv:1001.1297v1]

[5] Rational base number systems for p-adic numbers. 13th Mons Theoretical Computer Science Days, Amiens, September 2010. (slides, PDF, 630 kB)
[4] Rational base number systems for p-adic numbers. Digital expansions, dynamics and tilings, Aussois, March 2010. (slides, PDF, 726 kB)
[3] Repetitions in Words Associated with Parry Numbers. Canadian Discrete and Algorithmic Mathematics Conference, Montréal, May 2009. (slides, PDF, 264 kB)
[2] Factor complexity of infinite words associated with beta-expansions. Mons Theoretical Computer Science Days, Mons, August 2008. (slides, PDF, 604 kB)
[1] Factor complexity of infinite words associated with beta-expansions. Journées Numération, Prague, May 2008 (slides, PDF, 670 kB)

6/06 – 1/07, technical QA engineer (full-time): Trema / Wall Street Systems (Prague)
maintained and optimized bug tracking and releasing process – made reports based on various statistics to show current status of process
cooperated with international team on automation of testing campaign, created automated tests using diverse tools
11/05 – 1/06, R&D testing trainee (part-time): Trema (Prague)
manually tested various accounting functionalities within testing team