Sorting, Trees, and Measures of Order - William H. Burge (Inf. Control., 1958)

The evaluation, classification and interpretation of expressions. - William H. Burge (ACM National Conference, 1964)

A reprogramming machine. - William H. Burge (Commun. ACM, 1966)

An Analysis of the Compromise Merge Sorting Techniques. - William H. Burge (IFIP Congress (1), 1971)

Some examples of the use of function-producing functions. - William H. Burge (SYMSAC, 1971)

An Accessing Model. - William H. Burge; Alan G. Konheim (J. ACM, 1971)

Combinatory Programming and Combinatorial Analysis. - William H. Burge (IBM J. Res. Dev., 1972)

Four Correspondences Between Graphs and Generalized Young Tableaux. - William H. Burge (J. Comb. Theory A, 1974)

Stream Processing Functions. - William H. Burge (IBM J. Res. Dev., 1975)

An Analysis of Binary Search Trees Formed from Sequences of Nondistinct Keys. - William H. Burge (J. ACM, 1976)

APL and LISP - should they be combined, and if so how? - Alan J. Perlis; William H. Burge; Joel Moses; Vaughan R. Pratt (APL, 1979)

A correspondence between partitions related to generalizations of the Rogers-Ramanujan identities. - William H. Burge (Discret. Math., 1981)

Stacks in a Two-Level Store. - William H. Burge (J. Algorithms, 1981)

A Three-way Correspondence Between Partitions. - William H. Burge (Eur. J. Comb., 1982)

Infinite structures in SCRATCHPAD II. - William H. Burge; Stephen M. Watt (EUROCAL, 1987)

Partitions with Prescribed Hook Differences. - George E. Andrews; R. J. Baxter; David M. Bressoud; William H. Burge; Peter J. Forrester; Gérard Viennot (Eur. J. Comb., 1987)

Scratchpad and the Rogers-Ramanujan Identities. - William H. Burge (ISSAC, 1991)

Restricted Partition Pairs. - William H. Burge (J. Comb. Theory A, 1993)