Abstract
The creative approach when designing new algorithms is probably the major rewarding task for many researchers. This love for solving algorithmic problems is cultivated by some very young and talented students at high school.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
International Olympiad in Informatics, http://ioinformatics.org
Skiena, S.S., Revilla, M.A.: Programming Challenges: The Programming Contest Training Manual. Springer, Heidelberg (2003)
Verhoeff, T., Horváth, G., Diks, K., Cormack, G.: A Proposal for an IOI Syllabus. Teaching: Matemathics and Computer Science (4/1), 193–216 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Grossi, R., Orlandi, A., Ottaviano, G. (2010). Fun with Olympiad in Algorithmics. In: Boldi, P., Gargano, L. (eds) Fun with Algorithms. FUN 2010. Lecture Notes in Computer Science, vol 6099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13122-6_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-13122-6_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13121-9
Online ISBN: 978-3-642-13122-6
eBook Packages: Computer ScienceComputer Science (R0)