 | 2008 |
|---|
| 11 |       | Marcel F. van Amstel,
M. G. J. van den Brand,
Z. Protic,
Tom Verhoeff:
Transforming Process Algebra Models into UML State Machines: Bridging a Semantic Gap?.
ICMT 2008: 61-75 |
| 2006 |
|---|
| 10 | | Tom Verhoeff:
A Master Class Software Engineering for Secondary Education.
ISSEP 2006: 150-158 |
| 2002 |
|---|
| 9 | | 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) |
| 1999 |
|---|
| 8 | | Willem C. Mallon,
Jan Tijmen Udding,
Tom Verhoeff:
Analysis and Applications of the XDI model.
ASYNC 1999: 231-242 |
| 1998 |
|---|
| 7 | | Tom Verhoeff:
Analyzing Specifications for Delay-Insensitive Circuits.
ASYNC 1998: 172-183 |
| 6 |  | Petra Heijnen,
Henk C. A. van Tilborg,
Tom Verhoeff,
Sander Weijs:
Some New Binary, Quasi-Cyclic Codes.
IEEE Transactions on Information Theory 44(5): 1994-1996 (1998) |
| 1993 |
|---|
| 5 | | Andries E. Brouwer,
Tom Verhoeff:
An updated table of minimum-distance bounds for binary linear codes.
IEEE Transactions on Information Theory 39(2): 662- (1993) |
| 1992 |
|---|
| 4 | | Mark B. Josephs,
Rudolf H. Mak,
Jan Tijmen Udding,
Tom Verhoeff,
Jelio T. Yantchev:
High-Level Design of an Asynchronous Packet-Routing Chip.
Designing Correct Circuits 1992: 261-274 |
| 1989 |
|---|
| 3 | | Wei Chen,
Jan Tijmen Udding,
Tom Verhoeff:
Networks of Communicating Processes and Their (De-)Composition.
MPC 1989: 174-196 |
| 1988 |
|---|
| 2 | | Tom Verhoeff:
Delay-Insensitive Codes - an Overview.
Distributed Computing 3(1): 1-8 (1988) |
| 1987 |
|---|
| 1 | | Tom Verhoeff:
An updated table of minimum-distance bounds for binary linear codes.
IEEE Transactions on Information Theory 33(5): 665-680 (1987) |
