Coenraad Bron

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

	2001
j11		Wim H. Hesselink, Arnold Meijster, Coenraad Bron: Concurrent determination of connected components. Sci. Comput. Program. 41(2): 173-194 (2001)
	1992
j10		Coenraad Bron: Letter to the Authors of the Article 'On Intermediate Variables'. Structured Programming 13(1): 51-53 (1992)
	1991
j9		Coenraad Bron, Wim H. Hesselink: Smoothsort Revisited. Inf. Process. Lett. 39(5): 269-276 (1991)
	1990
j8		Coenraad Bron: Symmetric (and Generic) Algorithms for Height Balanced Trees. Structured Programming 11(2): 59-68 (1990)
	1989
j7		Coenraad Bron, E. J. Dijkstra: A better way to combine efficient string length encoding and zero-termination. SIGPLAN Notices 24(6): 11-19 (1989)
	1982
j6		Coenraad Bron, E. J. Dijkstra, S. Doaitse Swierstra: A Memory-Management Unit for the Optimal Exploitation of a Small Address Space. Inf. Process. Lett. 15(1): 20-22 (1982)
	1981
c1		Coenraad Bron: Modules, Program Structures and the Structuring of Operating Systems. ECI 1981: 135-153
	1976
j5		Coenraad Bron, W. de Vries: A PASCAL Compiler for PDP 11 Minicomputers. Softw., Pract. Exper. 6(1): 109-116 (1976)
	1974
j4		Coenraad Bron: Merge Sort Algorithm (Remark on Algorithm 426). Commun. ACM 17(12): 706 (1974)
	1973
j3		Coenraad Bron, Joep Kerbosch: Finding All Cliques of an Undirected Graph (Algorithm 457). Commun. ACM 16(9): 575-576 (1973)
	1972
j2		Coenraad Bron: Merge Sort Algorithm [M1] (Algorithm 426). Commun. ACM 15(5): 357-358 (1972)
j1		Coenraad Bron: Outline of a Machine Without Branch Instructions. Inf. Process. Lett. 1(3): 117-119 (1972)

Coauthor Index

Last update Sun May 26 00:21:59 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page