| 2007 |
| 29 | EE | Vincent van Oostrom:
Random Descent.
RTA 2007: 314-328 |
| 28 | EE | Jan Willem Klop,
Vincent van Oostrom,
Femke van Raamsdonk:
Reduction Strategies and Acyclicity.
Rewriting, Computation and Proof 2007: 89-112 |
| 2006 |
| 27 | EE | Jan Willem Klop,
Vincent van Oostrom,
Roel C. de Vrijer:
Iterative Lexicographic Path Orders.
Essays Dedicated to Joseph A. Goguen 2006: 541-554 |
| 2005 |
| 26 | | Aart Middeldorp,
Vincent van Oostrom,
Femke van Raamsdonk,
Roel C. de Vrijer:
Processes, Terms and Cycles: Steps on the Road to Infinity, Essays Dedicated to Jan Willem Klop, on the Occasion of His 60th Birthday
Springer 2005 |
| 25 | EE | Jeroen Ketema,
Jan Willem Klop,
Vincent van Oostrom:
Vicious Circles in Orthogonal Term Rewriting Systems.
Electr. Notes Theor. Comput. Sci. 124(2): 65-77 (2005) |
| 24 | EE | Bas Luttik,
Vincent van Oostrom:
Decomposition orders another generalisation of the fundamental theorem of arithmetic.
Theor. Comput. Sci. 335(2-3): 147-186 (2005) |
| 2004 |
| 23 | | Vincent van Oostrom:
Rewriting Techniques and Applications, 15th International Conference, RTA 2004, Aachen, Germany, June 3-5, 2004, Proceedings
Springer 2004 |
| 22 | EE | Vincent van Oostrom:
Sub-Birkhoff.
FLOPS 2004: 180-195 |
| 2003 |
| 21 | EE | Dimitri Hendriks,
Vincent van Oostrom:
adbmal
CADE 2003: 136-150 |
| 2002 |
| 20 | EE | Vincent van Oostrom,
Roel C. de Vrijer:
Four equivalent equivalences of reductions.
Electr. Notes Theor. Comput. Sci. 70(6): (2002) |
| 2001 |
| 19 | EE | Zurab Khasidashvili,
Mizuhito Ogawa,
Vincent van Oostrom:
Uniform Normalisation beyond Orthogonality.
RTA 2001: 122-136 |
| 18 | | Zurab Khasidashvili,
Mizuhito Ogawa,
Vincent van Oostrom:
Perpetuality and Uniform Normalization in Orthogonal Rewrite Systems.
Inf. Comput. 164(1): 118-151 (2001) |
| 2000 |
| 17 | | Jan Willem Klop,
Vincent van Oostrom,
Roel C. de Vrijer:
A geometric proof of confluence by decreasing diagrams.
J. Log. Comput. 10(3): 437-460 (2000) |
| 1999 |
| 16 | EE | Vincent van Oostrom:
Normalisation in Weakly Orthogonal Rewriting.
RTA 1999: 60-74 |
| 15 | | Richard Kennaway,
Vincent van Oostrom,
Fer-Jan de Vries:
Meaningless Terms in Rewriting.
Journal of Functional and Logic Programming 1999(1): (1999) |
| 1998 |
| 14 | | Marc Bezem,
Jan Willem Klop,
Vincent van Oostrom:
Diagram Techniques for Confluence.
Inf. Comput. 141(2): 172-204 (1998) |
| 1997 |
| 13 | | Vincent van Oostrom:
Finite Family Developments.
RTA 1997: 308-322 |
| 12 | | Joost Engelfriet,
Vincent van Oostrom:
Logical Description of Contex-Free Graph Languages.
J. Comput. Syst. Sci. 55(3): 489-503 (1997) |
| 11 | EE | Vincent van Oostrom:
Developing Developments.
Theor. Comput. Sci. 175(1): 159-181 (1997) |
| 1996 |
| 10 | | Richard Kennaway,
Vincent van Oostrom,
Fer-Jan de Vries:
Meaningless Terms in Rewriting.
ALP 1996: 254-268 |
| 9 | | Vincent van Oostrom:
Higher-Order Families.
RTA 1996: 392-407 |
| 8 | | Joost Engelfriet,
Vincent van Oostrom:
Regular Description of Context-Free Graph Languages.
J. Comput. Syst. Sci. 53(3): 556-574 (1996) |
| 1995 |
| 7 | | Vincent van Oostrom:
Development Closed Critical Pairs.
HOA 1995: 185-200 |
| 6 | EE | Zurab Khasidashvili,
Vincent van Oostrom:
Context-sensitive conditional expression reduction systems.
Electr. Notes Theor. Comput. Sci. 2: (1995) |
| 1994 |
| 5 | | Vincent van Oostrom,
Femke van Raamsdonk:
Weak Orthogonality Implies Confluence: The Higher Order Case.
LFCS 1994: 379-392 |
| 4 | | Vincent van Oostrom,
Erik P. de Vink:
Transition System Specifications in Stalk Formal with Bisimulation as a Congruence.
STACS 1994: 569-580 |
| 3 | | Vincent van Oostrom:
Confluence by Decreasing Diagrams.
Theor. Comput. Sci. 126(2): 259-280 (1994) |
| 1993 |
| 2 | | Vincent van Oostrom,
Femke van Raamsdonk:
Comparing Combinatory Reduction Systems and Higher-order Rewrite Systems.
HOA 1993: 276-304 |
| 1 | | Jan Willem Klop,
Vincent van Oostrom,
Femke van Raamsdonk:
Combinatory Reduction Systems: Introduction and Survey.
Theor. Comput. Sci. 121(1&2): 279-308 (1993) |