| |
| 1993 | ||
|---|---|---|
| 13 | William H. Burge: Restricted Partition Pairs. J. Comb. Theory, Ser. A 63(2): 210-222 (1993) | |
| 1991 | ||
| 12 | EE | William H. Burge: Scratchpad and the Rogers-Ramanujan Identities. ISSAC 1991: 189-190 |
| 1987 | ||
| 11 | William H. Burge, Stephen M. Watt: Infinite structures in SCRATCHPAD II. EUROCAL 1987: 138-148 | |
| 1981 | ||
| 10 | EE | William H. Burge: A correspondence between partitions related to generalizations of the Rogers-Ramanujan identities. Discrete Mathematics 34(1): 9-15 (1981) |
| 9 | William H. Burge: Stacks in a Two-Level Store. J. Algorithms 2(2): 178-185 (1981) | |
| 1976 | ||
| 8 | EE | William H. Burge: An Analysis of Binary Search Trees Formed from Sequences of Nondistinct Keys. J. ACM 23(3): 451-454 (1976) |
| 1975 | ||
| 7 | William H. Burge: Stream Processing Functions. IBM Journal of Research and Development 19(1): 12-25 (1975) | |
| 1974 | ||
| 6 | William H. Burge: Four Correspondences Between Graphs and Generalized Young Tableaux. J. Comb. Theory, Ser. A 17(1): 12-30 (1974) | |
| 1972 | ||
| 5 | William H. Burge: Combinatory Programming and Combinatorial Analysis. IBM Journal of Research and Development 16(5): 450-461 (1972) | |
| 1971 | ||
| 4 | William H. Burge: An Analysis of the Compromise Merge Sorting Techniques. IFIP Congress (1) 1971: 454-459 | |
| 3 | EE | William H. Burge, Alan G. Konheim: An Accessing Model. J. ACM 18(2): 400-404 (1971) |
| 1966 | ||
| 2 | EE | William H. Burge: A reprogramming machine. Commun. ACM 9(2): 60-66 (1966) |
| 1958 | ||
| 1 | William H. Burge: Sorting, Trees, and Measures of Order Information and Control 1(3): 181-197 (1958) | |
| 1 | Alan G. Konheim | [3] |
| 2 | Stephen M. Watt | [11] |