misof-english.bib
@article{Forisek2004ioi,
author = {Michal Fori{\v s}ek},
title = {{On suitability of tasks for the IOI competition}},
year = {2004},
note = {Personal communication to the IOI General Assembly.},
url = {http://ksp.sk/~misof/publications/2004ioitasks.html}
}
@article{Forisek05reals,
author = {Michal Fori{\v s}ek},
title = {{Representation of Integers and Reals}},
year = {2005},
note = {Published by TopCoder, Inc. \url{ http://www.topcoder.com/tc?module=Static&d1=tutorials&d2=integersReals}}
}
@article{Forisek05compl,
author = {Michal Fori{\v s}ek},
title = {{Computational Complexity}},
year = {2005},
note = {Published by TopCoder, Inc. \url{ http://www.topcoder.com/tc?module=Static&d1=tutorials&d2=complexity1}}
}
@article{Forisek06eval,
author = {Michal {Fori\v sek}},
title = {{On the Suitability of Programming Tasks for Automated Evaluation}},
pages = {63-76},
volume = {5},
year = {2006},
journal = {Informatics in Education},
issn = {0868-4952},
publisher = {Institute of Mathematics and Informatics, Lithuania},
pdf = {http://ksp.sk/~misof/publications/2006testing.pdf},
abstract = {For many programming tasks we would be glad to have some kind of automatic
evaluation process. As an example, most of the programming contests use
an automatic evaluation of the contestants' submissions.
While this approach is clearly highly efficient, it also has some drawbacks.
Often it is the case that the test inputs are not able to discover all flawed submissions.
In this article we show that the situation is not pleasant at all -- for some
programming tasks it is impossible to design good test inputs.
Moreover, we discuss some ways how to recognize such tasks,
and discuss other possibilities for doing the evaluation.
The discussion is focused on programming contests, but the results can
be applied for any programming tasks, e.g., assignments in school.}
}
@inproceedings{Forisek06sec,
author = {Michal Fori{\v s}ek},
title = {{Security of Programming Contest Systems}},
booktitle = {{Information Technologies at School}},
editor = {Valentina Dagiene and Roland Mittermeir},
year = {2006},
pages = {553-563},
pdf = {http://ksp.sk/~misof/publications/2006attacks.pdf},
abstract = {In this paper we examine currently used programming contest systems.
We discuss possible reasons why we do not expect any of the currently
existing contest systems to be adopted by a major group of
different programming contests.
We suggest to approach the design of a contest system as a
design of a secure IT system, using known methods from the area
of computer security.
The main contribution of this paper lies in a detailed analysis
of new, specific threats that arise in the context of
programming contests. A secure contest system should be able
to handle all the threats mentioned in this article.}
}
@inproceedings{Forisek06scaf,
author = {Michal Fori{\v s}ek and Michal Winczer},
title = {{Non-formal Activities as Scaffolding to Informatics Achievement}},
booktitle = {{Information Technologies at School}},
editor = {Valentina Dagiene and Roland Mittermeir},
year = {2006},
pages = {529-534},
pdf = {http://ksp.sk/~misof/publications/2006scaffold.pdf}
}
@inproceedings{Foriseketal07,
author = {Michal Fori{\v s}ek and
Branislav Katreniak and
Jana Katreniakov{\'a} and
Rastislav Kralovi{\v c} and
Richard Kr{\'a}lovi{\v c} and
Vladim\'{\i}r Koutn{\'y} and
Dana Pardubsk{\'a} and
Tom{\'a}{\v s} Plachetka and
Branislav Rovan},
title = {Online Bandwidth Allocation},
booktitle = {Algorithms -- ESA 2007},
pages = {546-557},
editor = {Lars Arge and
Michael Hoffmann and
Emo Welzl},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {4698},
year = {2007},
isbn = {978-3-540-75519-7}
}
@comment{{ee = http://dx.doi.org/10.1007/978-3-540-75520-3_49,
crossref = DBLP:conf/esa/2007,
bibsource = DBLP, http://dblp.uni-trier.de
}}
@inproceedings{Forisek07,
author = {Michal Fori{\v s}ek},
title = {{Slovak IOI 2007 Team Selection and Preparation}},
editor = {Valentina Dagiene},
issn = {1822-7732},
volume = {1},
year = {2007},
booktitle = {{Olympiads in Informatics}},
pdf = {http://ksp.sk/~misof/publications/2007selection.pdf}
}
@inproceedings{Forisek07fun,
author = {Michal Fori{\v s}ek},
title = {{Approximating Rational Numbers by Fractions}},
issn = {0302-9743},
isbn = {978-3-540-72913-6},
year = {2007},
booktitle = {{Fun with Algorithms}},
pages = {156-165},
note = {The original publication is available at www.springerlink.com},
pdf = {http://ksp.sk/~misof/publications/2007approx.pdf}
}
@misc{Forisek08,
author = {Michal Fori{\v s}ek},
title = {{Rating Algorithms For Programming Contests}},
year = {2008},
note = {Rigorous Thesis, Comenius University Bratislava},
school = {Comenius University Bratislava}
}
@inproceedings{Forisek09ioi,
title = {{Using Item Response Theory To Rate (Not Only) Programmers}},
author = {Michal Fori{\v s}ek},
editor = {Valentina Dagiene},
issn = {1822-7732},
volume = {3},
year = {2009},
booktitle = {{Olympiads in Informatics}},
pages = {3-16},
pdf = {http://ksp.sk/~misof/publications/2009ratings.pdf}
}
@phdthesis{Forisek09thesis,
title = {{Theoretical and Practical Aspects of Programming Contest Ratings}},
author = {Michal Fori{\v s}ek},
school = {Comenius University Bratislava},
year = {2009},
pdf = {http://ksp.sk/~misof/publications/2009thesis.pdf}
}
@inproceedings{Forisek10diff,
title = {{The difficulty of programming contests increases}},
author = {Michal Fori{\v s}ek},
editor = {Richard Kralovic},
year = {2010},
booktitle = {{Teaching Fundamentals Concepts of Informatics (Proceedings of ISSEP 2010)}},
note = {The original publication is available at www.springerlink.com},
pdf = {http://ksp.sk/~misof/publications/2010difficulty.pdf}
}
@inproceedings{ForisekSteinova10,
title = {{Didactic Games For Teaching Information Theory}},
author = {Michal Fori{\v s}ek and Monika Steinov{\'a}},
editor = {Richard Kralovic},
year = {2010},
booktitle = {{Teaching Fundamentals Concepts of Informatics (Proceedings of ISSEP 2010)}},
note = {The original publication is available at www.springerlink.com},
pdf = {http://ksp.sk/~misof/publications/2010hry.pdf}
}
@inproceedings{Forisek10fun,
title = {{Computational complexity of two-dimensional platform games}},
author = {Michal Fori{\v s}ek},
year = {2010},
booktitle = {{Proceedings of Fun with Algorithms 2010}},
note = {The original publication is available at www.springerlink.com},
pdf = {http://ksp.sk/~misof/publications/2010fun.pdf}
}
@article{Forisek10minones,
title = {{The Uniform Minimum-Ones 2SAT Problem and its Application to Haplotype Classification}},
author = {Hans-Joachim Böckenhauer and Michal Forišek and Ján Oravec and Björn Steffen and Kathleen Steinhöfel and Monika Steinová},
year = {2010},
journal = {RAIRO Theoretical Informatics and Applications},
volume = {44},
issue = {3},
doi = {10.1051/ita/2010018}
}
@inproceedings{ForisekKS12,
author = {Michal Forišek and Lucia Keller and Monika Steinová},
title = {{Advice Complexity of Online Coloring for Paths}},
booktitle = {Language and Automata Theory and Applications (LATA 2012)},
year = {2012},
pages = {228-239},
ee = {http://dx.doi.org/10.1007/978-3-642-28332-1_20},
isbn = {978-3-642-28331-4},
note = {The original publication is available at www.springerlink.com},
pdf = {http://ksp.sk/~misof/publications/2012lata.pdf}
}
@inproceedings{ForisekSteinova12,
title = {Metaphors and Analogies for Teaching Algorithms},
author = {Michal Forišek and Monika Steinová},
booktitle = {SIGCSE '12: Proceedings of the 43rd ACM technical symposium on Computer Science Education},
pages = {15-20},
year = {2012},
isbn = {978-1-4503-1098-7},
location = {Raleigh, North Carolina, USA},
publisher = {ACM},
address = {New York, NY, USA},
pdf = {http://ksp.sk/~misof/publications/2012metaphors.pdf}
}
@article{ForisekBoza12,
title = {{FCL-STL, a generics-based template library for FreePascal}},
author = {Vladimír Boža and Michal Forišek},
editor = {Valentina Dagiene},
issn = {1822-7732},
volume = {6},
year = {2012},
journal = {Olympiads in Informatics},
pages = {21-30},
pdf = {http://ksp.sk/~misof/publications/2012stl.pdf}
}
@inproceedings{Forisek13ioi,
title = {{Pushing the Boundary of Programming Contests}},
author = {Michal Fori{\v s}ek},
editor = {Valentina Dagiene},
issn = {1822-7732},
volume = {7},
year = {2013},
booktitle = {{Olympiads in Informatics}},
pages = {23-35},
pdf = {http://ksp.sk/~misof/publications/2013boundary.pdf}
}
@book{ForisekSteinova13,
title = {{Explaining Algorithms Using Metaphors}},
author = {Michal Forišek and Monika Steinová},
series = {Springer Briefs in Computer Science},
publisher = {Springer},
year = {2013}
}
@inproceedings{BarnumForisek14,
title = {{On the Power of Advice and Randomization for the Disjoint Path Allocation Problem}},
author = {Kfir Barhum and Hans-Joachim Boeckenhauer and Michal Fori{\v s}ek and Heidi Gebauer and Juraj Hromkovi{\v c} and Sacha Krug and Jasmin Smula and Björn Steffen},
booktitle = {Proceedings of SOFSEM 2014: Theory and Practice of Computer Science},
editor = {V. Geffert and B. Preneel and B. Rovan and J. {\v S}tuller and A. M. Tjoa},
pages = {89-101},
year = {2014},
isbn = {978-3-319-04297-8}
}
@inproceedings{Forisek15ioi,
title = {{Towards a Better Way to Teach Dynamic Programming}},
author = {Michal Fori{\v s}ek},
editor = {Valentina Dagiene},
issn = {1822-7732},
volume = {9},
year = {2015},
booktitle = {{Olympiads in Informatics}},
pdf = {http://ksp.sk/~misof/publications/2015dp.pdf}
}
@comment{{vim: tw=0:nowrap
}}