Coenraad Bron - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 14 from 14

2001

Concurrent determination of connected componentsWim H. Hesselink, Arnold Meijster, Coenraad Bron. SCP, 41(2):173-194, 2001.

1992

Letter to the Authors of the Article On Intermediate Variables Coenraad Bron. stp, 13(1):51-53, 1992.

1991

Smoothsort RevisitedCoenraad Bron, Wim H. Hesselink. ipl, 39(5):269-276, 1991.

1990

Symmetric (and Generic) Algorithms for Height Balanced TreesCoenraad Bron. stp, 11(2):59-68, 1990.

1989

A better way to combine efficient string length encoding and zero-terminationCoenraad Bron, Edsger W. Dijkstra. SIGPLAN, 24(6):11-19, 1989. [doi]

1985

A note on the checking of interfaces between separately compiled modulesCoenraad Bron, E. J. Dijkstra, T. J. Rossingh. SIGPLAN, 20(8):60-63, 1985. [doi]

1982

A Memory-Management Unit for the Optimal Exploitation of a Small Address SpaceCoenraad Bron, E. J. Dijkstra, S. Doaitse Swierstra. ipl, 15(1):20-22, 1982.

1981

Modules, Program Structures and the Structuring of Operating SystemsCoenraad Bron. eci 1981: 135-153

1979

A discipline for the programming of interactive I/O in PascalCoenraad Bron, E. J. Dijkstra. SIGPLAN, 14(12):59-61, 1979. [doi]

1976

A PASCAL Compiler for PDP 11 MinicomputersCoenraad Bron, W. de Vries. SPE, 6(1):109-116, 1976.

1974

Merge Sort Algorithm (Remark on Algorithm 426)Coenraad Bron. CACM, 17(12):706, 1974.

1973

Finding All Cliques of an Undirected Graph (Algorithm 457)Coenraad Bron, Joep Kerbosch. CACM, 16(9):575-576, 1973.

1972

Outline of a Machine Without Branch InstructionsCoenraad Bron. ipl, 1(3):117-119, 1972.

Merge Sort Algorithm [M1] (Algorithm 426)Coenraad Bron. CACM, 15(5):357-358, 1972.

Sign in or sign up to see more results.

runs on WebDSL