default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTom Verhoeff
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j11]Ana-Maria Sutîi, Mark van den Brand
, Tom Verhoeff:
Exploration of modularity and reusability of domain-specific languages: an expression DSL in MetaMod. Comput. Lang. Syst. Struct. 51: 48-70 (2018)- [c21]Tom Verhoeff:
A Master Class on Recursion. Adventures Between Lower Bounds and Higher Altitudes 2018: 610-633 - 2017
- [j10]Tom Verhoeff:
The spurs of D. H. Lehmer - Hamiltonian paths in neighbor-swap graphs of permutations. Des. Codes Cryptogr. 84(1-2): 295-310 (2017) - 2016
- [c20]Ana-Maria Sutîi, Tom Verhoeff, Mark van den Brand:
Modular modeling with a computational twist in MetaMod. MODULARITY (Companion) 2016: 4-7 - [c19]Ana-Maria Sutîi, Tom Verhoeff, Mark van den Brand:
Modular multilevel metamodeling with MetaMod. MODULARITY (Companion) 2016: 212-217 - [c18]Önder Babur, Loek Cleophas, Tom Verhoeff, Mark van den Brand:
Towards Statistical Comparison and Analysis of Models. MODELSWARD 2016: 361-367 - 2015
- [c17]Önder Babur, Vít Smilauer, Tom Verhoeff, Mark van den Brand:
A Survey of Open Source Multiphysics Frameworks in Engineering. ICCS 2015: 1088-1097 - 2013
- [c16]Kees van Overveld, Tom Verhoeff:
Self-consistent Peer Ranking for Assessing Student Work - Dealing with Large Populations. CSEDU 2013: 399-404 - [c15]Ulyana Tikhonova, Maarten Manders, Mark van den Brand, Suzana Andova, Tom Verhoeff:
Applying Model Transformation and Event-B for Specifying an Industrial DSL. MoDeVVa@MoDELS 2013: 41-50 - 2012
- [c14]Cornelis Huizing, Ruurd Kuiper, Tom Verhoeff:
Generalizations of Rice's Theorem, Applicable to Executable and Non-Executable Formalisms. Turing-100 2012: 168-180 - [c13]Suzana Andova, Mark G. J. van den Brand, Luc J. P. Engelen, Tom Verhoeff:
MDE Basics with a DSL Focus. SFM 2012: 21-57 - 2011
- [c12]Mark van den Brand, Albert T. Hofkamp, Tom Verhoeff, Zvezdan Protic:
Assessing the quality of model-comparison tools: a method and a benchmark data set. IWMCP@ICMT 2011: 2-11 - [c11]Mark van den Brand, Zvezdan Protic, Tom Verhoeff:
A Generic Solution for Syntax-Driven Model Co-evolution. TOOLS (49) 2011: 36-51 - 2010
- [j9]Tom Verhoeff:
3D turtle geometry: artwork, theory, program equivalence and symmetry. Int. J. Arts Technol. 3(2/3): 288-319 (2010) - [c10]Mark van den Brand, Zvezdan Protic, Tom Verhoeff:
Fine-grained metamodel-assisted model comparison. IWMCP@ICMT 2010: 11-20 - [c9]Mark van den Brand, Zvezdan Protic, Tom Verhoeff:
Generic tool for visualization of model differences. IWMCP@ICMT 2010: 66-75 - [c8]Cornelis Huizing, Ruurd Kuiper, Tom Verhoeff:
Halting Still Standing - Programs versus Specifications. UTP 2010: 226-233
2000 – 2009
- 2008
- [c7]Marcel van Amstel, Mark G. J. van den Brand, Zvezdan Protic, Tom Verhoeff:
Transforming Process Algebra Models into UML State Machines: Bridging a Semantic Gap?. ICMT@TOOLS 2008: 61-75 - 2006
- [j8]Tom Verhoeff:
The IOI is (not) a Science Olympiad. Informatics Educ. 5(1): 147-159 (2006) - [c6]Tom Verhoeff:
A Master Class Software Engineering for Secondary Education. ISSEP 2006: 150-158 - 2004
- [j7]Tom Verhoeff:
Settling Multiple Debts Efficiently: An Invitation to Computing Science. Informatics Educ. 3(1): 105-126 (2004) - 2003
- [j6]Gyula Horváth, Tom Verhoeff:
Numerical Difficulties in Pre-University Informatics Education and Competitions. Informatics Educ. 2(1): 21-38 (2003) - 2002
- [j5]R. W. Bulterman, F. W. van der Sommen, Gerard Zwaan, Tom Verhoeff, A. J. M. van Gasteren, W. H. J. Feijen:
On computing a longest path in a tree. Inf. Process. Lett. 81(2): 93-96 (2002)
1990 – 1999
- 1999
- [c5]Willem C. Mallon, Jan Tijmen Udding, Tom Verhoeff:
Analysis and Applications of the XDI model. ASYNC 1999: 231-242 - 1998
- [j4]Petra Heijnen, Henk C. A. van Tilborg, Tom Verhoeff, Sander Weijs:
Some New Binary, Quasi-Cyclic Codes. IEEE Trans. Inf. Theory 44(5): 1994-1996 (1998) - [c4]Tom Verhoeff:
Analyzing Specifications for Delay-Insensitive Circuits. ASYNC 1998: 172-183 - 1994
- [c3]Mark B. Josephs, Paul G. Lucassen, Jan Tijmen Udding, Tom Verhoeff:
Formal design of an asynchronous DSP counterflow pipeline: a case study in handshake algebra. ASYNC 1994: 206-215 - 1993
- [j3]Andries E. Brouwer, Tom Verhoeff:
An updated table of minimum-distance bounds for binary linear codes. IEEE Trans. Inf. Theory 39(2): 662-677 (1993) - 1992
- [c2]Mark B. Josephs, Rudolf H. Mak, Jan Tijmen Udding, Tom Verhoeff, Jelio Todorov Yantchev:
High-Level Design of an Asynchronous Packet-Routing Chip. Designing Correct Circuits 1992: 261-274
1980 – 1989
- 1989
- [c1]Wei Chen, Jan Tijmen Udding, Tom Verhoeff:
Networks of Communicating Processes and Their (De-)Composition. MPC 1989: 174-196 - 1988
- [j2]Tom Verhoeff:
Delay-Insensitive Codes - an Overview. Distributed Comput. 3(1): 1-8 (1988) - 1987
- [j1]Tom Verhoeff:
An updated table of minimum-distance bounds for binary linear codes. IEEE Trans. Inf. Theory 33(5): 665-680 (1987)
Coauthor Index
aka: Mark G. J. van den Brand
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
