On Decisions and Information Concerning an Unknown Parameter - James F. Korsh (Inf. Control., 1970)

Exponential Bounds for Error and Equivocation Based on Markov Chain Observations - James F. Korsh (Inf. Control., 1973)

Finding Optimal Demand Paging Algorithms. - Giorgio P. Ingargiola; James F. Korsh (J. ACM, 1974)

An Algorithm for the Solution of 0-1 Loading Problems. - Giorgio P. Ingargiola; James F. Korsh (Oper. Res., 1975)

Canonical Coin Changing and Greedy Solutions. - Lena Chang; James F. Korsh (J. ACM, 1976)

A General Algorithm for One-Dimensional Knapsack Problems. - Giorgio P. Ingargiola; James F. Korsh (Oper. Res., 1977)

Greedy Binary Search Trees are Nearly Optimal. - James F. Korsh (Inf. Process. Lett., 1981)

Growing Nearly Optimal Binary Search Trees. - James F. Korsh (Inf. Process. Lett., 1982)

A Multiple-Stack Manipulation Procedure. - James F. Korsh; Gary Laison (Commun. ACM, 1983)

Counting and Randomly Generating Binary Trees. - James F. Korsh (Inf. Process. Lett., 1993)

Loopless Generation of k-Ary Tree Sequences. - James F. Korsh (Inf. Process. Lett., 1994)

Generating Multiset Permutations in Constant Time. - James F. Korsh; Seymour Lipschutz (J. Algorithms, 1997)

A system for program visualization in the classroom. - Raghvinder S. Sangwan; James F. Korsh; Paul LaFollette (SIGCSE, 1998)

Shifts and Loopless Generation of k-Ary Trees. - James F. Korsh; Seymour Lipschutz (Inf. Process. Lett., 1998)

Loopless Generation of Gray Codes for k-Ary Trees. - James F. Korsh; Paul LaFollette (Inf. Process. Lett., 1999)

Multiset Permutations and Loopless Generation of Ordered Trees with Specified Degree Sequence. - James F. Korsh; Paul LaFollette (J. Algorithms, 2000)

A Loopless Algorithm for Generation of Basic Minimal Interval Orders. - Paul LaFollette; James F. Korsh (Order, 2000)

A Visual Interface for Effortless Animation of C/C++ Programs. - Paul LaFollette; James F. Korsh; Raghvinder S. Sangwan (J. Vis. Lang. Comput., 2000)

Loopless generation of up-down permutations. - James F. Korsh (Discret. Math., 2001)

Loopless Generation of Trees with Specified Degrees. - James F. Korsh; Paul LaFollette (Comput. J., 2002)

Loopless Generation of Linear Extensions of a Poset. - James F. Korsh; Paul LaFollette (Order, 2002)

Loopless Generation of Schröder Trees. - James F. Korsh; Paul LaFollette (Comput. J., 2003)

Loopless Algorithms and Schröder Trees. - James F. Korsh; Paul LaFollette; Seymour Lipschutz (Int. J. Comput. Math., 2003)

Loopless Array Generation of Multiset Permutations. - James F. Korsh; Paul LaFollette (Comput. J., 2004)

Constant time generation of derangements. - James F. Korsh; Paul LaFollette (Inf. Process. Lett., 2004)

Generating T-ary Trees in Linked Representation. - James F. Korsh (Comput. J., 2005)

Skarbek's Algorithm for t-Ary Trees. - James F. Korsh (Comput. J., 2006)

A loopless Gray code for rooted trees. - James F. Korsh; Paul LaFollette (ACM Trans. Algorithms, 2006)

Fast Generation of t-ary Trees. - James F. Korsh (Comput. J., 2011)