Hendrik Jan Hoogeboom

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]

1983 …#

• Grzegorz Rozenberg, Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom (1983). Real Time Coordinated Pair Systems. University of Colorado at Boulder, Technical Report, CU-CS-259-83
• Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg (1985). On coordinated rewriting. FCT 1985
• Hendrik Jan Hoogeboom, Grzegorz Rozenberg (1986). Infinitary Languages: Basic Theory an Applications to Concurrent Systems. Current Trends in Concurrency, 1986
• Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg (1986). On the Active and Full Use of Memory in Right-Boundary Grammars and Push-Down Automata. Theoretical Computer Science, Vol. 48, No. 3
• Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg (1986). Coordinated Pair Systems; Part I: Dyck Works and Classical Pumping. Theoretical Informatics and Applications, Vol. 20, No. 4
• Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg (1986). Coordinated Pair Systems; Part II: Sparse Structure of Dyck Words and Ogden’s Lemma. Theoretical Informatics and Applications, Vol. 20, No. 4
• Hendrik Jan Hoogeboom (1987). Coordinated Pair Systems. Ph.D. thesis, Leiden University, advisor Grzegorz Rozenberg
• Joost Engelfriet, Hendrik Jan Hoogeboom (1989). Automata with Storage on Infinite Words. ICALP 1989

1990 …#

• Hendrik Jan Hoogeboom, Grzegorz Rozenberg (1991). Diamond properties of elementary net systems. Fundamenta Informaticae, Vol. 14, No. 3
• Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg (1994). Combinatorial Properties of Dependence Graphs. Information and Computation, Vol. 114, No. 2
• Hendrik Jan Hoogeboom, Grzegorz Rozenberg (1995). Dependence Graphs. The Book of Traces, 1995
• Joost Engelfriet, Hendrik Jan Hoogeboom (1999). MSO definable string transductions and two-way finite state transducers. arXiv:cs/9906007 [6]
• Joost Engelfriet, Hendrik Jan Hoogeboom (1999). Tree-Walking Pebble Automata. Jewels are Forever
• Andrzej Ehrenfeucht, Hendrik Jan Hoogeboom, Grzegorz Rozenberg, Nikè van Vugt (1999). Forbidding and enforcing. DNA Based Computers, pdf

2000 …#

• Hendrik Jan Hoogeboom, Nikè van Vugt (2000). Fair sticker languages. Acta Informatica, Vol. 37, No. 3
• 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 [7]
• 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). Pivot and Loop Complementation on Graphs and Set Systems. TAMC 2010
• Robert Brijder, Hendrik Jan Hoogeboom (2010, 2014). Interlace polynomials for multimatroids and delta-matroids. arXiv:1010.4678 [8]
• Robert Brijder, Hendrik Jan Hoogeboom (2012). Binary Symmetric Matrix Inversion Through Local Complementation. Fundamenta Informaticae, Vol. 116 [9]
• 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

2020 …#

• Robert Brijder, Hendrik Jan Hoogeboom (2020). Counterexamples to a conjecture of Las Vergnas. European Journal of Combinatorics, Vol. 89, arXiv:1809.00813 » Michel Las Vergnas

External Links#

• H.J. Hoogeboom - homepage
• Hendrik Jan Hoogeboom - Leiden University
• The Mathematics Genealogy Project - Hendrik Hoogeboom

References#

1. ↑ H.J. Hoogeboom - homepage
2. ↑ H.J. Hoogeboom - homepage
3. ↑ 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
4. ↑ How to Construct Tetris Configurations
5. ↑ dblp: Hendrik Jan Hoogeboom
6. ↑ Monadic second-order logic from Wikipedia
7. ↑ Ciliate from Wikipedia
8. ↑ Matroid from Wikipedia
9. ↑ Schur complement from Wikipedia, Issai Schur

Up one level