Comparing Combinatory Reduction Systems and Higher-order Rewrite Systems. - Vincent van Oostrom; Femke van Raamsdonk (HOA, 1993)

Combinatory Reduction Systems: Introduction and Survey. - Jan Willem Klop; Vincent van Oostrom; Femke van Raamsdonk (Theor. Comput. Sci., 1993)

Weak Orthogonality Implies Confluence: The Higher Order Case. - Vincent van Oostrom; Femke van Raamsdonk (LFCS, 1994)

Transition System Specifications in Stalk Formal with Bisimulation as a Congruence. - Vincent van Oostrom; Erik P. de Vink (STACS, 1994)

Confluence by Decreasing Diagrams. - Vincent van Oostrom (Theor. Comput. Sci., 1994)

Development Closed Critical Pairs. - Vincent van Oostrom (HOA, 1995)

Context-sensitive conditional expression reduction systems. - Zurab Khasidashvili; Vincent van Oostrom (SEGRAGRA, 1995)

Higher-Order Families. - Vincent van Oostrom (RTA, 1996)

Regular Description of Context-Free Graph Languages. - Joost Engelfriet; Vincent van Oostrom (J. Comput. Syst. Sci., 1996)

Finite Family Developments. - Vincent van Oostrom (RTA, 1997)

Logical Description of Contex-Free Graph Languages. - Joost Engelfriet; Vincent van Oostrom (J. Comput. Syst. Sci., 1997)

Developing Developments. - Vincent van Oostrom (Theor. Comput. Sci., 1997)

Diagram Techniques for Confluence. - Marc Bezem; Jan Willem Klop; Vincent van Oostrom (Inf. Comput., 1998)

Normalisation in Weakly Orthogonal Rewriting. - Vincent van Oostrom (RTA, 1999)

Meaningless Terms in Rewriting. - Richard Kennaway; Vincent van Oostrom; Fer-Jan de Vries (J. Funct. Log. Program., 1999)

A geometric proof of confluence by decreasing diagrams. - Jan Willem Klop; Vincent van Oostrom; Roel C. de Vrijer (J. Log. Comput., 2000)

Uniform Normalisation beyond Orthogonality. - Zurab Khasidashvili; Mizuhito Ogawa; Vincent van Oostrom (RTA, 2001)

Perpetuality and Uniform Normalization in Orthogonal Rewrite Systems. - Zurab Khasidashvili; Mizuhito Ogawa; Vincent van Oostrom (Inf. Comput., 2001)

Four equivalent equivalences of reductions. - Vincent van Oostrom; Roel C. de Vrijer (WRS, 2002)

adbmal - Dimitri Hendriks; Vincent van Oostrom (CADE, 2003)

Sub-Birkhoff. - Vincent van Oostrom (FLOPS, 2004)

Vicious Circles in Orthogonal Term Rewriting Systems. - Jeroen Ketema; Jan Willem Klop; Vincent van Oostrom (WRS, 2004)

Decomposition orders another generalisation of the fundamental theorem of arithmetic. - Bas Luttik; Vincent van Oostrom (Theor. Comput. Sci., 2005)

Iterative Lexicographic Path Orders. - Jan Willem Klop; Vincent van Oostrom; Roel C. de Vrijer (Essays Dedicated to Joseph A. Goguen, 2006)

Reduction Strategies and Acyclicity. - Jan Willem Klop; Vincent van Oostrom; Femke van Raamsdonk (Rewriting, Computation and Proof, 2007)

Random Descent. - Vincent van Oostrom (RTA, 2007)

Modularity of Confluence. - Vincent van Oostrom (IJCAR, 2008)

Using groups for investigating rewrite systems. - Patrick Dehornoy; Vincent van Oostrom (Math. Struct. Comput. Sci., 2008)

Lambda calculus with patterns. - Jan Willem Klop; Vincent van Oostrom; Roel C. de Vrijer (Theor. Comput. Sci., 2008)

Diagrammatic Confluence and Completion. - Jean-Pierre Jouannaud; Vincent van Oostrom (ICALP (2), 2009)

Higher-Order (Non-)Modularity . - Claus Appel; Vincent van Oostrom; Jakob Grue Simonsen (RTA, 2010)

Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting. - Jörg Endrullis; Clemens Grabmayer; Dimitri Hendriks; Jan Willem Klop; Vincent van Oostrom (RTA, 2010)

Realising Optimal Sharing. - Vincent van Oostrom (RTA, 2010)

On the Termination of Russell's Description Elimination Algorithm. - Clemens Grabmayer; Joop Leo; Vincent van Oostrom; Albert Visser (Rev. Symb. Log., 2011)

On equal μ-terms. - Jörg Endrullis; Clemens Grabmayer; Jan Willem Klop; Vincent van Oostrom (Theor. Comput. Sci., 2011)

Triangulation in Rewriting. - Vincent van Oostrom; Hans Zantema (RTA, 2012)

Proof Orders for Decreasing Diagrams. - Bertram Felgenhauer; Vincent van Oostrom (RTA, 2013)

Infinitary Term Rewriting for Weakly Orthogonal Systems: Properties and Counterexamples. - Jörg Endrullis; Clemens Grabmayer; Dimitri Hendriks; Jan Willem Klop; Vincent van Oostrom (Log. Methods Comput. Sci., 2014)

Nested Term Graphs. - Clemens Grabmayer; Vincent van Oostrom (TERMGRAPH, 2014)

Layer Systems for Proving Confluence. - Bertram Felgenhauer; Aart Middeldorp; Harald Zankl; Vincent van Oostrom (ACM Trans. Comput. Log., 2015)

Normalisation by Random Descent. - Vincent van Oostrom; Yoshihito Toyama (FSCD, 2016)

The Z Property. - Bertram Felgenhauer; Julian Nagele; Vincent van Oostrom; Christian Sternagel (Arch. Formal Proofs, 2016)

A Short Mechanized Proof of the Church-Rosser Theorem by the Z-property for the λβ-calculus in Nominal Isabelle. - Julian Nagele; Vincent van Oostrom; Christian Sternagel (CoRR, 2016)

Critical Peaks Redefined - $Φ sqcup Ψ= top$. - Nao Hirokawa; Julian Nagele; Vincent van Oostrom; Michio Oyamaguchi (CoRR, 2017)

Confluence by Critical Pair Analysis Revisited. - Nao Hirokawa; Julian Nagele; Vincent van Oostrom; Michio Oyamaguchi (CADE, 2019)

Confluence by Critical Pair Analysis Revisited (Extended Version). - Nao Hirokawa; Julian Nagele; Vincent van Oostrom; Michio Oyamaguchi (CoRR, 2019)

Z; Syntax-Free Developments. - Vincent van Oostrom (FSCD, 2021)

On Causal Equivalence by Tracing in String Rewriting. - Vincent van Oostrom (TERMGRAPH@FSCD, 2022)

α-Avoidance. - Samuel Frontull; Georg Moser; Vincent van Oostrom (FSCD, 2023)

The paint pot problem and common multiples in monoids. - Hans Zantema; Vincent van Oostrom (Appl. Algebra Eng. Commun. Comput., 2025)

Correction: The paint pot problem and common multiples in monoids. - Hans Zantema; Vincent van Oostrom (Appl. Algebra Eng. Commun. Comput., 2025)