Difference between revisions of "Hendrik Jan Hoogeboom"

From Chessprogramming wiki
Jump to: navigation, search
 
Line 9: Line 9:
 
=Selected Publications=
 
=Selected Publications=
 
<ref>[https://dblp.org/pid/h/HendrikJanHoogeboom.html dblp: Hendrik Jan Hoogeboom]</ref>  
 
<ref>[https://dblp.org/pid/h/HendrikJanHoogeboom.html dblp: Hendrik Jan Hoogeboom]</ref>  
==2004 ...==
+
==1983 ...==
 +
* [[Mathematician#GRozenberg|Grzegorz Rozenberg]], [[Mathematician#AEhrenfeucht|Andrzej Ehrenfeucht]], [[Hendrik Jan Hoogeboom]] ('''1983'''). ''[https://scholar.colorado.edu/concern/reports/kh04dq44n Real Time Coordinated Pair Systems]''. [https://en.wikipedia.org/wiki/University_of_Colorado_Boulder University of Colorado at Boulder], Technical Report, CU-CS-259-83
 +
* [[Mathematician#AEhrenfeucht|Andrzej Ehrenfeucht]], [[Hendrik Jan Hoogeboom]], [[Mathematician#GRozenberg|Grzegorz Rozenberg]] ('''1985'''). ''[https://link.springer.com/chapter/10.1007/BFb0028796 On coordinated rewriting]''. [https://dblp.org/db/conf/fct/fct1985.html#EhrenfeuchtHR85 FCT 1985]
 +
* [[Hendrik Jan Hoogeboom]], [[Mathematician#GRozenberg|Grzegorz Rozenberg]] ('''1986'''). ''[https://link.springer.com/chapter/10.1007/BFb0027043 Infinitary Languages: Basic Theory an Applications to Concurrent Systems]''. [https://dblp.org/db/books/collections/Trends86.html#HoogeboomR86 Current Trends in Concurrency, 1986]
 +
* [[Mathematician#AEhrenfeucht|Andrzej Ehrenfeucht]], [[Hendrik Jan Hoogeboom]], [[Mathematician#GRozenberg|Grzegorz Rozenberg]] ('''1986'''). ''[https://www.sciencedirect.com/science/article/pii/0304397586900952 On the Active and Full Use of Memory in Right-Boundary Grammars and Push-Down Automata]''. [https://en.wikipedia.org/wiki/Theoretical_Computer_Science_(journal) Theoretical Computer Science], Vol. 48, No. 3
 +
* [[Mathematician#AEhrenfeucht|Andrzej Ehrenfeucht]], [[Hendrik Jan Hoogeboom]], [[Mathematician#GRozenberg|Grzegorz Rozenberg]] ('''1986'''). ''[http://www.numdam.org/item/ITA_1986__20_4_405_0/ Coordinated Pair Systems; Part I: Dyck Works and Classical Pumping]''. [https://fr.wikipedia.org/wiki/RAIRO_Informatique_th%C3%A9orique_et_applications Theoretical Informatics and Applications], Vol. 20, No. 4
 +
* [[Mathematician#AEhrenfeucht|Andrzej Ehrenfeucht]], [[Hendrik Jan Hoogeboom]], [[Mathematician#GRozenberg|Grzegorz Rozenberg]] ('''1986'''). ''[http://www.numdam.org/item/ITA_1986__20_4_425_0/ Coordinated Pair Systems; Part II: Sparse Structure of Dyck Words and Ogden's Lemma]''. [https://fr.wikipedia.org/wiki/RAIRO_Informatique_th%C3%A9orique_et_applications Theoretical Informatics and Applications], Vol. 20, No. 4
 +
* [[Hendrik Jan Hoogeboom]] ('''1987'''). ''Coordinated Pair Systems''. Ph.D. thesis, [[Leiden University]], advisor [[Mathematician#GRozenberg|Grzegorz Rozenberg]]
 +
* [[Mathematician#JEngelfriet|Joost Engelfriet]], [[Hendrik Jan Hoogeboom]] ('''1989'''). ''[https://link.springer.com/chapter/10.1007/BFb0035767 Automata with Storage on Infinite Words]''. [https://dblp.org/db/conf/icalp/icalp89.html#EngelfrietH89 ICALP 1989]
 +
==1990 ...==
 +
* [[Hendrik Jan Hoogeboom]], [[Mathematician#GRozenberg|Grzegorz Rozenberg]] ('''1991'''). ''[https://www.semanticscholar.org/paper/Diamond-properties-of-elementary-net-systems-Hoogeboom-Rozenberg/2ce69a0596f8ed278f570b7d3a79b9968796c0f2 Diamond properties of elementary net systems]''. [https://en.wikipedia.org/wiki/Fundamenta_Informaticae Fundamenta Informaticae], Vol. 14, No. 3
 +
* [[Mathematician#AEhrenfeucht|Andrzej Ehrenfeucht]], [[Hendrik Jan Hoogeboom]], [[Mathematician#GRozenberg|Grzegorz Rozenberg]] ('''1994'''). ''[https://openaccess.leidenuniv.nl/handle/1887/68041 Combinatorial Properties of Dependence Graphs]''. [https://en.wikipedia.org/wiki/Information_and_Computation Information and Computation], Vol. 114, No. 2
 +
* [[Hendrik Jan Hoogeboom]], [[Mathematician#GRozenberg|Grzegorz Rozenberg]] ('''1995'''). ''[https://www.worldscientific.com/doi/abs/10.1142/9789814261456_0002 Dependence Graphs]''. [https://dblp.org/db/books/collections/DR1995.html#HoogeboomR95 The Book of Traces, 1995]
 +
* [[Mathematician#JEngelfriet|Joost Engelfriet]], [[Hendrik Jan Hoogeboom]] ('''1999'''). ''MSO definable string transductions and two-way finite state transducers''. [https://arxiv.org/abs/cs/9906007 arXiv:cs/9906007] <ref>[https://en.wikipedia.org/wiki/Monadic_second-order_logic Monadic second-order logic from Wikipedia]</ref>
 +
* [[Mathematician#JEngelfriet|Joost Engelfriet]], [[Hendrik Jan Hoogeboom]] ('''1999'''). ''[https://link.springer.com/chapter/10.1007/978-3-642-60207-8_7 Tree-Walking Pebble Automata]''. [https://link.springer.com/book/10.1007/978-3-642-60207-8 Jewels are Forever]
 +
* [[Mathematician#AEhrenfeucht|Andrzej Ehrenfeucht]], [[Hendrik Jan Hoogeboom]], [[Mathematician#GRozenberg|Grzegorz Rozenberg]], [[Mathematician#NvVugt|Nikè van Vugt]] ('''1999'''). ''Forbidding and enforcing''. DNA Based Computers, [http://liacs.leidenuniv.nl/~hoogeboomhj/journal/forbidding.pdf pdf]
 +
==2000 ...==
 +
* [[Hendrik Jan Hoogeboom]], [[Mathematician#NvVugt|Nikè van Vugt]] ('''2000'''). ''[https://link.springer.com/article/10.1007/PL00006050 Fair sticker languages]''. [https://en.wikipedia.org/wiki/Acta_Informatica Acta Informatica], Vol. 37, No. 3
 
* [https://dblp.org/pid/74/5120.html Ron Breukelaar], [[Erik D. Demaine]], [[Mathematician#SHohenberger|Susan Hohenberger]], [[Hendrik Jan Hoogeboom]], [[Walter Kosters]], [[Mathematician#DLibenNowell|David Liben-Nowell]] ('''2004'''). ''[https://www.worldscientific.com/doi/10.1142/S0218195904001354 Tetris is hard, even to approximate]''. [https://en.wikipedia.org/wiki/International_Journal_of_Computational_Geometry_and_Applications International Journal of Computational Geometry & Applications], Vol. 14
 
* [https://dblp.org/pid/74/5120.html Ron Breukelaar], [[Erik D. Demaine]], [[Mathematician#SHohenberger|Susan Hohenberger]], [[Hendrik Jan Hoogeboom]], [[Walter Kosters]], [[Mathematician#DLibenNowell|David Liben-Nowell]] ('''2004'''). ''[https://www.worldscientific.com/doi/10.1142/S0218195904001354 Tetris is hard, even to approximate]''. [https://en.wikipedia.org/wiki/International_Journal_of_Computational_Geometry_and_Applications International Journal of Computational Geometry & Applications], Vol. 14
 
* [[Hendrik Jan Hoogeboom]], [[Walter Kosters]] ('''2004'''). ''[https://www.sciencedirect.com/science/article/abs/pii/S0020019003005404 Tetris and Decidability]''. [https://en.wikipedia.org/wiki/Information_Processing_Letters Information Processing Letters], Vol. 9
 
* [[Hendrik Jan Hoogeboom]], [[Walter Kosters]] ('''2004'''). ''[https://www.sciencedirect.com/science/article/abs/pii/S0020019003005404 Tetris and Decidability]''. [https://en.wikipedia.org/wiki/Information_Processing_Letters Information Processing Letters], Vol. 9
Line 20: Line 37:
 
* [[Hendrik Jan Hoogeboom]] ('''2009'''). ''Automata walking over trees and graphs''. [https://dblp.org/db/conf/ncma/ncma2009.html#Hoogeboom09 NCMA 2009]
 
* [[Hendrik Jan Hoogeboom]] ('''2009'''). ''Automata walking over trees and graphs''. [https://dblp.org/db/conf/ncma/ncma2009.html#Hoogeboom09 NCMA 2009]
 
==2010 ...==
 
==2010 ...==
* [[Mathematician#RBrijder|Robert Brijder]], [[Hendrik Jan Hoogeboom]] ('''2010, 2014''') ''Interlace polynomials for multimatroids and delta-matroids''. [https://arxiv.org/abs/1010.4678 arXiv:1010.4678] <ref>[https://en.wikipedia.org/wiki/Matroid Matroid from Wikipedia]</ref>
+
* [[Mathematician#RBrijder|Robert Brijder]], [[Hendrik Jan Hoogeboom]] ('''2010'''). ''[https://link.springer.com/chapter/10.1007/978-3-642-13562-0_15 Pivot and Loop Complementation on Graphs and Set Systems]''. [https://dblp.org/db/conf/tamc/tamc2010.html#BrijderH10 TAMC 2010]
 +
* [[Mathematician#RBrijder|Robert Brijder]], [[Hendrik Jan Hoogeboom]] ('''2010, 2014'''). ''Interlace polynomials for multimatroids and delta-matroids''. [https://arxiv.org/abs/1010.4678 arXiv:1010.4678] <ref>[https://en.wikipedia.org/wiki/Matroid Matroid from Wikipedia]</ref>
 +
* [[Mathematician#RBrijder|Robert Brijder]], [[Hendrik Jan Hoogeboom]] ('''2012'''). ''[https://www.semanticscholar.org/paper/Binary-Symmetric-Matrix-Inversion-Through-Local-Brijder-Hoogeboom/09ef223c36ed4eb89de177ff4d75cb398627c541 Binary Symmetric Matrix Inversion Through Local Complementation]''. [https://en.wikipedia.org/wiki/Fundamenta_Informaticae Fundamenta Informaticae], Vol. 116 <ref>[https://en.wikipedia.org/wiki/Schur_complement Schur complement from Wikipedia], [[Mathematician#Schur|Issai Schur]]</ref>
 
* [[Hendrik Jan Hoogeboom]], [[Walter Kosters]], [[Jan van Rijn]], [[Jonathan K. Vis]] ('''2014, 2016'''). ''Acyclic Constraint Logic and Games''. [[ICGA Journal#37_1|ICGA Journal, Vol 37, No. 1]], [https://arxiv.org/abs/1604.05487 arXiv:1604.05487]
 
* [[Hendrik Jan Hoogeboom]], [[Walter Kosters]], [[Jan van Rijn]], [[Jonathan K. Vis]] ('''2014, 2016'''). ''Acyclic Constraint Logic and Games''. [[ICGA Journal#37_1|ICGA Journal, Vol 37, No. 1]], [https://arxiv.org/abs/1604.05487 arXiv:1604.05487]
 
* [[Mathematician#JEngelfriet|Joost Engelfriet]], [[Hendrik Jan Hoogeboom]], [https://www.researchgate.net/profile/Bart_Samwel Bart Samwel] ('''2018'''). ''XML Navigation and Transformation by Tree-Walking Automata and Transducers with Visible and Invisible Pebbles''. [https://arxiv.org/abs/1809.05730 arXiv:1809.05730]
 
* [[Mathematician#JEngelfriet|Joost Engelfriet]], [[Hendrik Jan Hoogeboom]], [https://www.researchgate.net/profile/Bart_Samwel Bart Samwel] ('''2018'''). ''XML Navigation and Transformation by Tree-Walking Automata and Transducers with Visible and Invisible Pebbles''. [https://arxiv.org/abs/1809.05730 arXiv:1809.05730]
 +
==2020 ...==
 +
* [[Mathematician#RBrijder|Robert Brijder]], [[Hendrik Jan Hoogeboom]] ('''2020'''). ''Counterexamples to a conjecture of Las Vergnas''. [https://en.wikipedia.org/wiki/European_Journal_of_Combinatorics European Journal of Combinatorics], Vol. 89, [https://arxiv.org/abs/1809.00813 arXiv:1809.00813] » [[Mathematician#MLasVergnas|Michel Las Vergnas]]
  
 
=External Links=
 
=External Links=

Latest revision as of 20:27, 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]

1983 ...

1990 ...

2000 ...

2010 ...

2020 ...

External Links

References

Up one level