JOURNAL PUBLICATIONS/PROCEEDINGS:
Fast Generation of t-ary Trees
The Computer Journal Vol 54 No 5 (May 2011) 776-785.

Loopless Implementation of a Gray Code for Signed Permutations
with P. LaFollette and S. Lipschutz, Publications de L'Institut Mathematique Vol 89 No 103 (May 2011) 37-47.

Gray code and loopless algorithm for the reflection group Dn
with S. Lipschutz, Pure Mathematics and Applications Vol 17 No 1-2 (2006) 135-146.

Skarbek's Algorithm for t-ary Trees
The Computer Journal Vol 49 No 3 (2006) 351-357.

A Loopless Gray Code For Rooted Trees
with P. LaFollette, ACM Transactions On Algorithms Vol 2 Issue 2 (2006) 135-152.

Generating T-ary Trees in Linked Representation
The Computer Journal Vol 48 No 4 (2005) 488-497.

Loopless Array Generation of Multiset Permutations
with P. LaFollette, The Computer Journal Vol 47 No 5 (2004) 612-62.

Constant time generation of derangements
with P. LaFollette, Inform. Process. Lett. 90 (2004) 181-186.

Loopless Generation of Schroder Trees
with P. LaFollette, The Computer Journal Vol 46 No 1 (2003) 106-113.

Loopless Algorithms and Schroder Trees
with P. LaFollette and S. Lipschutz, Intern. J. Computer Math. Vol 80 (2003) 709-725.

Loopless generation of linear extensions of a poset
with P. LaFollette, Order 19 (2002) 115-126.

Loopless Generation of Trees with Specified Degrees
with P. LaFollette, The Computer Journal Vol 45 No 3 (2002).

Loopless generation of up-down permutations
Discrete Mathematics 240 (2001) 97-122.

A Loopless Algorithm for Generation of Basic Minimal Interval Orders
with P. LaFollette, Order 17 (2000) 271-285.

Multiset Permutations and Loopless Generation of Ordered Trees with Specified Degree Sequence  
with P. LaFollette, Journal of Algorithms 34, (Feb 2000) 309-336.

A Visual Interface for Effortless Animation of C/C++ Programs
with P. LaFollette and R. Sangwan, Journal of Visual Languages and Programming 11 (Feb 2000) 27-48.

Towers, Beads, and Loopless Generation of Trees with Specified Degree Sequences
with P. LaFollette, Congressus Numerantium 139 (Dec 1999) 157-166.

Loopless Generation of Gray codes for k-ary Trees
with P. LaFollette, Inform. Process. Lett. 52 (April 1999) 243-247.

Towers, Beads, and Loopless Generation of Trees with Specified DegreeSequences
with P. LaFollette. Thirtieth Southeastern International Conference on Combinatorics, Graph Theory, and Computing (March 1999) (Abstract in Proceedings).

Shifts and Loopless Generation of K-ary Trees
with Lipschutz, S., Inform. Process.  Lett. 65 (1998) 235-240.

A System for Program Visualization in the Classroom
with LaFollette, P. and Sangwan, R., SIGCSE ’98 Proceedings of the Twenty-ninth Technical Symposium On Computer Science Education (Feb. 1998) ACM: 272- 276.

Animating Programs and Students in the Laboratory
with LaFollette, P. and Sangwan, R., Proceedings of 1998 ASEE/IEEE Frontiers in Education Conference (Nov. 1998) (In Electronic Proceedings).

Generating Multiset Permutations in Constant Time
with Lipschutz, S., Journal of Algorithms 25 (1997) 321-335.

A-order generation of k-ary trees with a 4k-4 letter alphabet
Journal of Information and Optimization Sciences Vol 16  No 3 (September 1995) 557-564.

Loopless Generation of K-ary Tree Sequences 
Inform. Process.  Lett. 52 (1994) 243-247.

Counting and Randomly Generating Binary Trees
Inform. Process.  Lett. 45 (1993) 291-294.

A Multiple Stack Manipulation Procedure
with G. Liaison, Communications of the ACM (November 1983) 921-923.

Growing Nearly Optimal Binary Search Trees
Information  Processing Letters (May 1982) 139-143.

Greedy Binary Search Trees are Nearly Optimal
Information Processing Letters (October 1981) 16-19.

A General Algorithm for One Dimensional Knapsack Problems
with G. Ingargiola, Operations Research (September-October 1977) 752-759.

Canonical Coin Changing and Greedy Solutions
with L. Chang, Journal of Association for Computing Machinery (July  1976) 418-422.

Rejoinder to "Notes on Hofshi and Korsh 1972
with R. Hofshi, Management Science (February 1976).

An Algorithm for the Solution of 0-1 Loading Problems
with G. Ingargiola, Operations Research (November-December 1975) 1110-1119.

A Generalized Approach to Maximum Likelihood Paired Comparison Ranking
with J. Flueck, The Annals of Statistics (July 1975) 846-861.

A Branch Search Algorithm for Maximum Likelihood Paired Comparison Ranking
with J. Flueck, Biometrika   (1974) 621-626.

Finding Optimal Demand Paging Algorithms
with G. Ingargiola, Journal of the Association for Computing Machinery (January 1974) 40-53.  (Also presented at Industrial Associates Conference on Research in Information and Computer Science, California Institute of Technology, November 18, 1971.)

A Reduction Algorithm for Zero-One Single Knapsack Problems
with G. Ingargiola, Management Science (December 1973) 460-463.

Exponential Bounds on Error and Equivocation Based on Markov Chain Observations
Information and Control (March 1973) 107-122.

A Measure of an Individual's Power in a Group
with R. Hofshi, Management Science (September 1972) 52-61.

On Decisions and Information Concerning an Unknown Parameter
Information and Control (April 1970) 123-127.

BOOKS:
Data Structures, Algorithms, and Program Style Using C
with Leonard Garrett, PWS-Kent, Boston, Mass, 1988.

Data Structures, Algorithms, and Program Style
PWS-Kent,  Boston, Mass, 1986.

CONFERENCES:
Loopless Generation of Multiset Permutations
SIAM Conference on Discrete Mathematics June 13-16, 2004.

Animating Programs and Students in the Laboratory
with LaFollette, P. and Sangwan, R., ASEE/IEEE Frontiers in Education Conference (Nov. 1998).

A System for Program Visualization in the Classroom
with LaFollette, P. and Sangwan, R., SIGCSE ’98

Canonical Coin Changing
with L. Chang, invited paper at ORSA/TIMS Conference, November, 1975.

A General Algorithm for One-Dimensional Knapsack Problems
with G. Ingargiola, ORSA/TIMS Conference, October, 1974.

DIGITAL PRESS:
Data Structures, Algorithms, and Program Style Using C
with Leonard Garrett, CD ROM, Dr. Dobb’s Essential Books On Algorithms and ata Structures November 1995.