William H. Burge

According to our database1, William H. Burge authored at least 18 papers between 1958 and 1993.

Collaborative distances:
  • Dijkstra number2 of two.
  • Erdős number3 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1993
Restricted Partition Pairs.
J. Comb. Theory A, 1993

1991
Scratchpad and the Rogers-Ramanujan Identities.
Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation, 1991

1987
Partitions with Prescribed Hook Differences.
Eur. J. Comb., 1987

Infinite structures in SCRATCHPAD II.
Proceedings of the EUROCAL '87, 1987

1982
A Three-way Correspondence Between Partitions.
Eur. J. Comb., 1982

1981
Stacks in a Two-Level Store.
J. Algorithms, 1981

A correspondence between partitions related to generalizations of the Rogers-Ramanujan identities.
Discret. Math., 1981

1979
APL and LISP - should they be combined, and if so how?
Proceedings of the international conference on APL, 1979

1976
An Analysis of Binary Search Trees Formed from Sequences of Nondistinct Keys.
J. ACM, 1976

1975
Stream Processing Functions.
IBM J. Res. Dev., 1975

1974
Four Correspondences Between Graphs and Generalized Young Tableaux.
J. Comb. Theory A, 1974

1972
Combinatory Programming and Combinatorial Analysis.
IBM J. Res. Dev., 1972

1971
An Accessing Model.
J. ACM, 1971

Some examples of the use of function-producing functions.
Proceedings of the second ACM symposium on Symbolic and algebraic manipulation, 1971

An Analysis of the Compromise Merge Sorting Techniques.
Proceedings of the Information Processing, Proceedings of IFIP Congress 1971, Volume 1, 1971

1966
A reprogramming machine.
Commun. ACM, 1966

1964
The evaluation, classification and interpretation of expressions.
Proceedings of the 19th ACM national conference, 1964

1958
Sorting, Trees, and Measures of Order
Inf. Control., September, 1958


  Loading...