Difference between revisions of "Hendrik Jan Hoogeboom"

From Chessprogramming wiki
Jump to: navigation, search
Line 5: Line 5:
 
'''Hendrik Jan Hoogeboom''',<br/>
 
'''Hendrik Jan Hoogeboom''',<br/>
 
a Dutch mathematician, computer scientist, and researcher and assistant professor at [[Leiden University#LIACS|Leiden Institute of Advanced Computer Science]], [[Leiden University]].  
 
a Dutch mathematician, computer scientist, and researcher and assistant professor at [[Leiden University#LIACS|Leiden Institute of Advanced Computer Science]], [[Leiden University]].  
His research interests in [https://en.wikipedia.org/wiki/Theoretical_computer_science theoretical computer science] include [https://en.wikipedia.org/wiki/Formal_language formal models] of [https://en.wikipedia.org/wiki/Natural_computing natural computation], [https://en.wikipedia.org/wiki/Infinitary_logic infinitary languages], logic and [https://en.wikipedia.org/wiki/Automata_theory automata], [https://en.wikipedia.org/wiki/Singulation#Tree_walking tree-walking] automata, and [https://en.wikipedia.org/wiki/Pattern_matching patterns in strings] <ref>[http://liacs.leidenuniv.nl/~hoogeboomhj/ H.J. Hoogeboom - homepage] </ref>. Along with [[Walter Kosters]] et al., Hendrik Hoogeboom works on the [https://en.wikipedia.org/wiki/Computational_complexity_theory computational complexity] of  [https://en.wikipedia.org/wiki/Tetris Tetris] <ref>https://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]] ('''2002'''). ''Tetris is Hard, Even to Approximate''. [https://arxiv.org/abs/cs/0210020 arXiv:cs/0210020]</ref>, and maintains the ''How to Construct Tetris Configurations'' site <ref>[https://liacs.leidenuniv.nl/~kosterswa/tetris/ How to Construct Tetris Configurations]</ref>.  
+
His research interests in [https://en.wikipedia.org/wiki/Theoretical_computer_science theoretical computer science] include [https://en.wikipedia.org/wiki/Formal_language formal models] of [https://en.wikipedia.org/wiki/Natural_computing natural computation], [https://en.wikipedia.org/wiki/Infinitary_logic infinitary languages], logic and [https://en.wikipedia.org/wiki/Automata_theory automata], [https://en.wikipedia.org/wiki/Singulation#Tree_walking tree-walking] automata, and [https://en.wikipedia.org/wiki/Pattern_matching patterns in strings] <ref>[http://liacs.leidenuniv.nl/~hoogeboomhj/ H.J. Hoogeboom - homepage] </ref>. Along with [[Walter Kosters]] et al., Hendrik Hoogeboom works on the [https://en.wikipedia.org/wiki/Computational_complexity_theory computational complexity] of  [https://en.wikipedia.org/wiki/Tetris Tetris] <ref>[https://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]] ('''2002'''). ''Tetris is Hard, Even to Approximate''. [https://arxiv.org/abs/cs/0210020 arXiv:cs/0210020]</ref>, and maintains the ''How to Construct Tetris Configurations'' site <ref>[https://liacs.leidenuniv.nl/~kosterswa/tetris/ How to Construct Tetris Configurations]</ref>.  
  
 
=Selected Publications=
 
=Selected Publications=

Revision as of 17:50, 6 October 2020

Home * People * Hendrik Jan Hoogeboom

Hendrik Hoogeboom [1]

Hendrik Jan Hoogeboom,
a Dutch mathematician, computer scientist, and researcher and assistant professor at Leiden Institute of Advanced Computer Science, Leiden University. His research interests in theoretical computer science include formal models of natural computation, infinitary languages, logic and automata, tree-walking automata, and patterns in strings [2]. Along with Walter Kosters et al., Hendrik Hoogeboom works on the computational complexity of Tetris [3], and maintains the How to Construct Tetris Configurations site [4].

Selected Publications

[5]

2004 ...

2010 ...

External Links

References

Up one level