Homepage for Karel Klouda
Address
Department of Applied Mathematics,
FIT,
CTU in Prague
Thákurova 9 (map)
160 00 Praha 6
Room: A1431
Email: karel.klouda@fit.cvut.cz
Telephone: (+420) 2 2435 9888
Mobile phone: (+420) 774 552 735
Twitter: @KarelKlouda
Research
I am an Assistant Professor and the chair of the Department of Appplied mathematics at the Faculty of Information Technology of the Czech Technical University in Prague.
I did my Ph.D. at Czech Technical University in Prague and
University Denis Diderot  Paris VII
participating in the cotutelle programme supported by the French Government.
My advisors were Edita Pelantová and Christiane Frougny, the thesis
Nonstandard numeration systems and combinatorics on words was defended on 11/19/2010 in Paris.
Research Interests
 combinatorics on words
 nonstandard numeration systems
 robust statistics
Publications in refereed journals

[9] Karel Klouda, Kateřina Medková: Synchronizing delay for binary uniform morphisms, Theoretical Computer Science (in press, online from December 8, 2015), (2016), 1222, [doi:10.1016/j.tcs.2015.11.043]. preprint: [arXiv:1507.05223]

[8] Karel Klouda, Štěpán Starosta: An Algorithm Enumerating All Infinite Repetitions in a D0L System, Journal of Discrete Algorithms, 33, (2015), 130–138, [doi:10.1016/j.jda.2015.03.006], available at www.ScienceDirect.com, preprint: [arXiv:1307.6408]

[7] Karel Klouda, An exact polynomial time algorithm for computing the least trimmed squares estimate, Computational Statistics & Data Analysis, 84 (2015), 27–40, ISSN 01679473, [doi:10.1016/j.csda.2014.11.001], available at www.ScienceDirect.com, preprint: [arXiv:1001.1297]

[6] Christiane Frougny, Karel Klouda: Factor and palindromic complexity of ThueMorse's avatars, Acta Polytechnica, 53(6) (2013), 868871; [doi:10.14311/AP.2013.53.0868]

[5] Karel Klouda: Bispecial factors in circular nonpushy D0L languages, Theoretical Computer Science, 445 (2012), 6374; [doi:10.1016/j.tcs.2012.05.007] [arXiv:1201.1186v1]

[4] Christiane Frougny, Karel Klouda: Rational base number systems for padic numbers, RAIRO  Theoretical Informatics and Applications, 46 (2012), 87106; [doi:10.1051/ita/2011114]

[3] Ľubomira Balková, Karel Klouda, Edita Pelantová: Critical exponent of infinite words coding betaintegers associated with nonsimple Parry numbers,
Integers  Electronic Journal of Combinatorial Number Theory 11B (2011), 125 (available on pages of the journal)

[2] Ľubomira Balková, Karel Klouda, Edita Pelantová: Repetitions in betaintegers,
Letters in Mathematical Physics 87 (2009), 181195 [arXiv:0812.4006v1]

[1] Karel Klouda, Edita Pelantová: Factor complexity of infinite words associated with nonsimple Parry numbers,
Integers  Electronic Journal of Combinatorial Number Theory 9 (2009), 281310
(available on pages of the journal)
Preprints
 [1] Karel Klouda, Štěpán Starosta: Characterization of circular D0L systems [arXiv:1401.0038]
Talks

[7] An Algorithm Enumerating All Infinite Repetitions in a D0L System, WORDS 2013, Turku, September 2013.
(slides, PDF, 570 kB)

[6] Bispecial factors in D0L languages, Československá MELA, Telč, September 2013 (local conference).
(slides, PDF, 900 kB)

[5] Rational base number systems for padic numbers. 13th Mons Theoretical Computer Science Days, Amiens, September 2010.
(slides, PDF, 630 kB)

[4] Rational base number systems for padic 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 betaexpansions. Mons Theoretical Computer Science Days, Mons, August 2008.
(slides, PDF, 604 kB)

[1] Factor complexity of infinite words associated with betaexpansions. Journées Numération, Prague, May 2008
(slides, PDF, 670 kB)
Conferences
Work experience
 9/10 – today, Assistant Professor and the chair of the Department of Appplied mathematics

FIT,
CTU in Prague
 6/06 – 1/07, technical QA engineer (fulltime)

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