25,161
edits
Changes
no edit summary
'''[[Main Page|Home]] * [[People]] * Walter Kosters'''
[[FILE:walterkosters.jpg|border|right|thumb|link=http://wwwliacs.liacsleidenuniv.nl/~kosterskosterswa/|Walter Kosters <ref>[http://wwwliacs.liacsleidenuniv.nl/~kosterskosterswa/ Walter Kosters]</ref> ]]
'''Walter A. Kosters''',<br/>
a Dutch computer scientist and mathematician, and associate professor of CS at LIACS, the Leiden Institute of Advanced Computer Science at [[Leiden University]]. His research interests include [[Neural Networks|neural networks]], [[Genetic Programming#GeneticAlgorithm|genetic algorithms]], [https://en.wikipedia.org/wiki/Analysis_of_algorithms analysis of algorithms], [https://en.wikipedia.org/wiki/Concrete_Mathematics concrete mathematics], [https://en.wikipedia.org/wiki/NP-complete NP-completeness], [https://en.wikipedia.org/wiki/Bioinformatics bioinformatics], [https://en.wikipedia.org/wiki/Data_mining data mining] and [[Artificial Intelligence|artificial intelligence]]. Along with [[Hendrik Jan Hoogeboom]] et al., Walter Kosters works on the [https://en.wikipedia.org/wiki/Computational_complexity_theory computational complexity] of [https://en.wikipedia.org/wiki/Tetris Tetris] <ref>[http://www.cs.jhu.edu/~susan/600.363/tetris.pdf Tetris is Hard: An Introduction to P vs NP] (pdf) slides based on [[Erik D. Demaine]], [[Mathematician#SHohenberger|Susan Hohenberger]], [[Mathematician#DLibenNowell|David Liben-Nowell]] ('''2003'''). ''Tetris is Hard, Even to Approximate''. [http://www.informatik.uni-trier.de/~ley/db/conf/cocoon/cocoon2003.html COCOON 2003]</ref>, and maintains the ''How to Construct Tetris Configurations'' site <ref>[http://wwwliacs.liacsleidenuniv.nl/~kosterskosterswa/tetris/ How to Construct Tetris Configurations]</ref>.
=Nonograms=
* [[Hendrik Jan Hoogeboom]], [[Walter Kosters]] ('''2004'''). ''[http://www.liacs.nl/~kosters/tetris/ How to Construct Tetris Configurations]''. International Journal of Intelligent Games & Simulation, Vol. 3
* [[Hendrik Jan Hoogeboom]], [[Walter Kosters]] ('''2005'''). ''[http://www.ibrarian.net/navon/page.jsp?paperid=3095440&searchTerm=3+3v The Theory of Tetris]''. Nieuwsbrief van de Nederlandse Vereniging voor Theoretische Informatica, Vol. 9
* [[Joost Batenburg]], [[Walter Kosters]] ('''2005'''). ''[https://www.researchgate.net/publication/220799946_Neural_Networks_for_Discrete_Tomography Neural Networks for Discrete Tomography]''. [https://dblp.uni-trier.de/db/conf/bnaic/bnaic2005.html#BatenburgK05 BNCAI 2005]
* [[Joost Batenburg]], [[Walter Kosters]] ('''2006'''). ''[https://link.springer.com/chapter/10.1007/11774938_31 A Neural Network Approach to Real-Time Discrete Tomography]''. [https://dblp.uni-trier.de/db/conf/iwcia/iwcia2006.html#BatenburgK06 IWCIA 2006]
* [[Joost Batenburg]], [[Walter Kosters]] ('''2009'''). ''Solving Nonograms by combining relaxations''. [http://www.journals.elsevier.com/pattern-recognition/ Pattern Recognition], Vol. 42, No. 8
==2010 ...==
=External Links=
* [http://www.liacs.nl/~kosters/ Walter Kosters]
* [httphttps://www.liacsmathgenealogy.nl/~kosters/nono/sjoerd/indexeng.html Nonogram — Turn your picture into a puzzle]* [http://genealogy.math.ndsu.nodak.eduorg/id.php?id=52453 The Mathematics Genealogy Project - Walter Kosters]* [http://www.liacs.nl/~kosters/tetris/ How to Construct Tetris Configurations] by [[Hendrik Jan Hoogeboom]] and [[Walter Kosters]]
=References=
