Merge Sort Algorithm [M1] (Algorithm 426). - Coenraad Bron (Commun. ACM, 1972)

Outline of a Machine Without Branch Instructions. - Coenraad Bron (Inf. Process. Lett., 1972)

Finding All Cliques of an Undirected Graph (Algorithm 457). - Coenraad Bron; Joep Kerbosch (Commun. ACM, 1973)

Merge Sort Algorithm (Remark on Algorithm 426). - Coenraad Bron (Commun. ACM, 1974)

A PASCAL Compiler for PDP 11 Minicomputers. - Coenraad Bron; W. de Vries (Softw. Pract. Exp., 1976)

A discipline for the programming of interactive I/O in Pascal. - Coenraad Bron; E. J. Dijkstra (ACM SIGPLAN Notices, 1979)

Modules, Program Structures and the Structuring of Operating Systems. - Coenraad Bron (ECI, 1981)

A Memory-Management Unit for the Optimal Exploitation of a Small Address Space. - Coenraad Bron; E. J. Dijkstra; S. Doaitse Swierstra (Inf. Process. Lett., 1982)

A note on the checking of interfaces between separately compiled modules. - Coenraad Bron; E. J. Dijkstra; T. J. Rossingh (ACM SIGPLAN Notices, 1985)

A better way to combine efficient string length encoding and zero-termination. - Coenraad Bron; E. J. Dijkstra (ACM SIGPLAN Notices, 1989)

Symmetric (and Generic) Algorithms for Height Balanced Trees. - Coenraad Bron (Struct. Program., 1990)

Smoothsort Revisited. - Coenraad Bron; Wim H. Hesselink (Inf. Process. Lett., 1991)

Letter to the Authors of the Article 'On Intermediate Variables'. - Coenraad Bron (Struct. Program., 1992)

Concurrent determination of connected components. - Wim H. Hesselink; Arnold Meijster; Coenraad Bron (Sci. Comput. Program., 2001)