Hendrik Jan Hoogeboom
Revision as of 18:47, 6 October 2020 by GerdIsenberg (talk | contribs)
Home * People * Hendrik Jan Hoogeboom
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
2004 ...
- Ron Breukelaar, Erik D. Demaine, Susan Hohenberger, Hendrik Jan Hoogeboom, Walter Kosters, David Liben-Nowell (2004). Tetris is hard, even to approximate. International Journal of Computational Geometry & Applications, Vol. 14
- Hendrik Jan Hoogeboom, Walter Kosters (2004). Tetris and Decidability. Information Processing Letters, Vol. 9
- Hendrik Jan Hoogeboom, Walter Kosters (2004). How to Construct Tetris Configurations. International Journal of Intelligent Games & Simulation, Vol. 3
- Hendrik Jan Hoogeboom, Walter Kosters (2005). The Theory of Tetris. Nieuwsbrief van de Nederlandse Vereniging voor Theoretische Informatica, Vol. 9, pdf
- Robert Brijder, Hendrik Jan Hoogeboom, Grzegorz Rozenberg (2006). Reducibility of Gene Patterns in Ciliates using the Breakpoint Graph. arXiv:cs/0601122 [6]
- Robert Brijder, Hendrik Jan Hoogeboom (2007). The Fibers and Range of Reduction Graphs in Ciliates. arXiv:cs/0702041
- Robert Brijder, Hendrik Jan Hoogeboom, Grzegorz Rozenberg (2007). How Overlap Determines the Macronuclear Genes in Ciliates. arXiv:cs/0702171
- Robert Brijder, Hendrik Jan Hoogeboom, Grzegorz Rozenberg (2009). Reduction Graphs from Overlap Graphs for Gene Assembly in Ciliates. International Journal of Foundations of Computer Science, Vol. 20
- Hendrik Jan Hoogeboom (2009). Automata walking over trees and graphs. NCMA 2009
2010 ...
- Robert Brijder, Hendrik Jan Hoogeboom (2010, 2014) Interlace polynomials for multimatroids and delta-matroids. arXiv:1010.4678 [7]
- Hendrik Jan Hoogeboom, Walter Kosters, Jan van Rijn, Jonathan K. Vis (2014, 2016). Acyclic Constraint Logic and Games. ICGA Journal, Vol 37, No. 1, arXiv:1604.05487
- Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samwel (2018). XML Navigation and Transformation by Tree-Walking Automata and Transducers with Visible and Invisible Pebbles. arXiv:1809.05730
External Links
- H.J. Hoogeboom - homepage
- Hendrik Jan Hoogeboom - Leiden University
- The Mathematics Genealogy Project - Hendrik Hoogeboom
References
- ↑ H.J. Hoogeboom - homepage
- ↑ H.J. Hoogeboom - homepage
- ↑ 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, Susan Hohenberger, David Liben-Nowell (2002). Tetris is Hard, Even to Approximate. arXiv:cs/0210020
- ↑ How to Construct Tetris Configurations
- ↑ dblp: Hendrik Jan Hoogeboom
- ↑ Ciliate from Wikipedia
- ↑ Matroid from Wikipedia