Skip to main content
guest
Join
|
Help
|
Sign In
chessprogramming
Home
guest
|
Join
|
Help
|
Sign In
Wiki Home
Recent Changes
Pages and Files
Members
Home
Basics
Getting Started
Board Representation
Search
Evaluation
Principle Topics
Chess
Programming
Artificial Intelligence
Knowledge
Learning
Testing
Tuning
User Interface
Protocols
Dictionary
Lists
Arts
Cartoons
CC Forums
Conferences
Dedicated CC
Engines
Games
Hardware
History
Organizations
Papers
People
Periodical
Samples
Software
Timeline
Tournaments and Matches
Videos
Misc
Acknowledgments
On New Pages
Recommended Reading
Wikispaces Help
Hendrik Jan Hoogeboom
Edit
0
6
…
0
Tags
No tags
Notify
RSS
Backlinks
Source
Print
Export (PDF)
Home
*
People
* Hendrik Jan Hoogeboom
Hendrik Jan Hoogeboom
,
a Dutch mathematician, computer scientist, and researcher and lecturer 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
[1]
. Along with
Walter Kosters
et al., Hendrik Hoogeboom works on the
computational complexity
of
Tetris
[2]
, and maintains the
How to Construct Tetris Configurations
site
[3]
.
Hendrik Hoogeboom
[4]
Table of Contents
Selected Publications
External Links
References
What links here?
Selected Publications
[5]
[6]
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 (IJIGS), Vol. 3
Hendrik Jan Hoogeboom
,
Walter Kosters
(
2005
).
The Theory of Tetris
. Nieuwsbrief van de Nederlandse Vereniging voor Theoretische Informatica, Vol. 9
Hendrik Jan Hoogeboom
(
2009
).
Automata walking over trees and graphs
. Workshop on Non-Classical Models for Automata and Applications (NCMA). Vienna, Austria
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
[7]
Robert Brijder
,
Hendrik Jan Hoogeboom
(
2014
)
Interlace polynomials for multimatroids and delta-matroids
.
European Journal of Combinatorics
, Vol. 40
[8]
Hendrik Jan Hoogeboom
,
Walter Kosters
,
Jan van Rijn
,
Jonathan K. Vis
(
2014
).
Acyclic Constraint Logic and Games
.
ICGA Journal, Vol 37, No. 1
External Links
H.J. Hoogeboom - homepage
People - LIACS - Leiden Institute of Advanced Computer Science: Hendrik Jan Hoogeboom
The Mathematics Genealogy Project - Hendrik Hoogeboom
How to Construct Tetris Configurations
by
Hendrik Jan Hoogeboom
and
Walter Kosters
References
^
People - LIACS - Leiden Institute of Advanced Computer Science: Hendrik Jan Hoogeboom
^
Tetris is Hard: An Introduction to P vs NP
(pdf) slides based on
Erik D. Demaine
,
Susan Hohenberger
,
David Liben-Nowell
(
2003
).
Tetris is Hard, Even to Approximate
.
COCOON 2003
^
How to Construct Tetris Configurations
^
H.J. Hoogeboom - homepage
^
dblp: Hendrik Jan Hoogeboom
^
People - LIACS - Leiden Institute of Advanced Computer Science: Hendrik Jan Hoogeboom - Publications
^
Ciliate from Wikipedia
^
Matroid from Wikipedia
What links here?
Page
Date Edited
Games
Feb 20, 2018
Hendrik Jan Hoogeboom
May 26, 2015
ICGA Journal
Dec 21, 2017
Jan van Rijn
Dec 8, 2014
Jonathan K. Vis
Dec 8, 2014
Leiden University
Jul 5, 2016
Mathematician
Apr 9, 2018
People
Feb 28, 2018
Walter Kosters
Jan 8, 2017
Up one level
Javascript Required
You need to enable Javascript in your browser to edit pages.
help on how to format text
Turn off "Getting Started"
Home
...
Loading...
a Dutch mathematician, computer scientist, and researcher and lecturer 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 [1]. Along with Walter Kosters et al., Hendrik Hoogeboom works on the computational complexity of Tetris [2], and maintains the How to Construct Tetris Configurations site [3].
Table of Contents
Selected Publications
[5] [6]External Links
References
What links here?
Up one level