William H. Burge

18 papers B 1Journal 12Unranked 5
YearRankTypeTitle / Venue / Authors
1993 J jnl
Restricted Partition Pairs.
J. Comb. Theory A
William H. Burge
1991 B conf
Scratchpad and the Rogers-Ramanujan Identities.
ISSAC
William H. Burge
1987 — conf
Infinite structures in SCRATCHPAD II.
EUROCAL
William H. Burge, Stephen M. Watt
1987 J jnl
Partitions with Prescribed Hook Differences.
Eur. J. Comb.
George E. Andrews, R. J. Baxter, David M. Bressoud, William H. Burge, Peter J. Forrester, Gérard Viennot
1982 J jnl
A Three-way Correspondence Between Partitions.
Eur. J. Comb.
William H. Burge
1981 J jnl
A correspondence between partitions related to generalizations of the Rogers-Ramanujan identities.
Discret. Math.
William H. Burge
1981 J jnl
Stacks in a Two-Level Store.
J. Algorithms
William H. Burge
1979 — conf
APL and LISP - should they be combined, and if so how?
APL
Alan J. Perlis, William H. Burge, Joel Moses, Vaughan R. Pratt
1976 J jnl
An Analysis of Binary Search Trees Formed from Sequences of Nondistinct Keys.
J. ACM
William H. Burge
1975 J jnl
Stream Processing Functions.
IBM J. Res. Dev.
William H. Burge
1974 J jnl
Four Correspondences Between Graphs and Generalized Young Tableaux.
J. Comb. Theory A
William H. Burge
1972 J jnl
Combinatory Programming and Combinatorial Analysis.
IBM J. Res. Dev.
William H. Burge
1971 J jnl
An Accessing Model.
J. ACM
William H. Burge, Alan G. Konheim
1971 — conf
An Analysis of the Compromise Merge Sorting Techniques.
IFIP Congress (1)
William H. Burge
1971 — conf
Some examples of the use of function-producing functions.
SYMSAC
William H. Burge
1966 J jnl
A reprogramming machine.
Commun. ACM
William H. Burge
1964 — conf
The evaluation, classification and interpretation of expressions.
ACM National Conference
William H. Burge
1958 J jnl
Sorting, Trees, and Measures of Order
Inf. Control.
William H. Burge