![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Michal Forisek
Person information
Refine list
![note](https://dblp.uni-trier.de./img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j3]Michal Anderle, Michal Forisek, Monika Steinová:
Teaching Recursion and Dynamic Programming Before College. Bull. EATCS 129 (2019) - 2015
- [c9]Michal Forisek, Jakub Jancina:
Fast Primality Testing for Integers That Fit into a Machine Word. SOFSEM (Student Research Forum Papers / Posters) 2015: 20-30 - 2014
- [c8]Kfir Barhum, Hans-Joachim Böckenhauer, Michal Forisek, Heidi Gebauer, Juraj Hromkovic, Sacha Krug, Jasmin Smula, Björn Steffen:
On the Power of Advice and Randomization for the Disjoint Path Allocation Problem. SOFSEM 2014: 89-101 - 2013
- [b1]Michal Forisek, Monika Steinová:
Explaining Algorithms Using Metaphors. Springer Briefs in Computer Science, Springer 2013, ISBN 978-1-4471-5018-3, pp. i-x, 1-94 - 2012
- [c7]Michal Forisek, Lucia Keller, Monika Steinová:
Advice Complexity of Online Coloring for Paths. LATA 2012: 228-239 - [c6]Michal Forisek, Monika Steinová:
Metaphors and analogies for teaching algorithms. SIGCSE 2012: 15-20 - 2010
- [j2]Hans-Joachim Böckenhauer
, Michal Forisek, Ján Oravec, Björn Steffen, Kathleen Steinhöfel
, Monika Steinová:
The Uniform Minimum-Ones 2SAT Problem and its Application to Haplotype Classification. RAIRO Theor. Informatics Appl. 44(3): 363-377 (2010) - [c5]Michal Forisek:
Computational Complexity of Two-Dimensional Platform Games. FUN 2010: 214-227 - [c4]Michal Forisek:
The Difficulty of Programming Contests Increases. ISSEP 2010: 72-85 - [c3]Michal Forisek, Monika Steinová:
Didactic Games for Teaching Information Theory. ISSEP 2010: 86-99
2000 – 2009
- 2007
- [c2]Michal Forisek, Branislav Katreniak, Jana Katreniaková, Rastislav Kralovic
, Richard Královic, Vladimír Koutný, Dana Pardubská, Tomas Plachetka, Branislav Rovan:
Online Bandwidth Allocation. ESA 2007: 546-557 - [c1]Michal Forisek:
Approximating Rational Numbers by Fractions. FUN 2007: 156-165 - [i1]Michal Forisek, Branislav Katreniak, Jana Katreniaková, Rastislav Kralovic, Richard Královic, Vladimír Koutný, Dana Pardubská, Tomas Plachetka, Branislav Rovan:
Online Bandwidth Allocation. CoRR abs/cs/0701153 (2007) - 2006
- [j1]Michal Forisek:
On the Suitability of Programming Tasks for Automated Evaluation. Informatics Educ. 5(1): 63-76 (2006)
Coauthor Index
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint