| 2006 |
|---|
| 26 | EE | James F. Korsh,
Paul LaFollette:
A loopless Gray code for rooted trees.
ACM Transactions on Algorithms 2(2): 135-152 (2006) |
| 25 | EE | James F. Korsh:
Skarbek's Algorithm for t-Ary Trees.
Comput. J. 49(3): 351-357 (2006) |
| 2005 |
|---|
| 24 | EE | James F. Korsh:
Generating T-ary Trees in Linked Representation.
Comput. J. 48(4): 488-497 (2005) |
| 2004 |
|---|
| 23 | EE | James F. Korsh,
Paul LaFollette:
Loopless Array Generation of Multiset Permutations.
Comput. J. 47(5): 612-621 (2004) |
| 22 | EE | James F. Korsh,
Paul LaFollette:
Constant time generation of derangements.
Inf. Process. Lett. 90(4): 181-186 (2004) |
| 2003 |
|---|
| 21 | EE | James F. Korsh,
Paul LaFollette:
Loopless Generation of Schröder Trees.
Comput. J. 46(1): 106-113 (2003) |
| 20 | EE | James F. Korsh,
Paul LaFollette,
Seymour Lipschutz:
Loopless Algorithms and Schröder Trees.
Int. J. Comput. Math. 80(6): 709-725 (2003) |
| 2002 |
|---|
| 19 | EE | James F. Korsh,
Paul LaFollette:
Loopless Generation of Trees with Specified Degrees.
Comput. J. 45(3): 364-372 (2002) |
| 18 | EE | James F. Korsh,
Paul LaFollette:
Loopless Generation of Linear Extensions of a Poset.
Order 19(2): 115-126 (2002) |
| 2001 |
|---|
| 17 | EE | James F. Korsh:
Loopless generation of up-down permutations.
Discrete Mathematics 240(1-3): 97-122 (2001) |
| 2000 |
|---|
| 16 | | James F. Korsh,
Paul LaFollette:
Multiset Permutations and Loopless Generation of Ordered Trees with Specified Degree Sequence.
J. Algorithms 34(2): 309-336 (2000) |
| 15 | | Paul LaFollette,
James F. Korsh,
Raghvinder S. Sangwan:
A Visual Interface for Effortless Animation of C/C++ Programs.
J. Vis. Lang. Comput. 11(1): 27-48 (2000) |
| 14 | EE | Paul LaFollette,
James F. Korsh:
A Loopless Algorithm for Generation of Basic Minimal Interval Orders.
Order 17(3): 271-285 (2000) |
| 1999 |
|---|
| 13 | EE | James F. Korsh,
Paul LaFollette:
Loopless Generation of Gray Codes for k-Ary Trees.
Inf. Process. Lett. 70(1): 7-11 (1999) |
| 1998 |
|---|
| 12 | EE | Raghvinder S. Sangwan,
James F. Korsh,
Paul LaFollette:
A system for program visualization in the classroom.
SIGCSE 1998: 272-276 |
| 11 | EE | James F. Korsh,
Seymour Lipschutz:
Shifts and Loopless Generation of k-Ary Trees.
Inf. Process. Lett. 65(5): 235-240 (1998) |
| 1997 |
|---|
| 10 | | James F. Korsh,
Seymour Lipschutz:
Generating Multiset Permutations in Constant Time.
J. Algorithms 25(2): 321-335 (1997) |
| 1994 |
|---|
| 9 | | James F. Korsh:
Loopless Generation of k-Ary Tree Sequences.
Inf. Process. Lett. 52(5): 243-247 (1994) |
| 1993 |
|---|
| 8 | | James F. Korsh:
Counting and Randomly Generating Binary Trees.
Inf. Process. Lett. 45(6): 291-294 (1993) |
| 1983 |
|---|
| 7 | | James F. Korsh,
Gary Laison:
A Multiple-Stack Manipulation Procedure.
Commun. ACM 26(11): 921-923 (1983) |
| 1982 |
|---|
| 6 | | James F. Korsh:
Growing Nearly Optimal Binary Search Trees.
Inf. Process. Lett. 14(3): 139-143 (1982) |
| 1981 |
|---|
| 5 | | James F. Korsh:
Greedy Binary Search Trees are Nearly Optimal.
Inf. Process. Lett. 13(1): 16-19 (1981) |
| 1976 |
|---|
| 4 | EE | Lena Chang,
James F. Korsh:
Canonical Coin Changing and Greedy Solutions.
J. ACM 23(3): 418-422 (1976) |
| 1974 |
|---|
| 3 | EE | Giorgio P. Ingargiola,
James F. Korsh:
Finding Optimal Demand Paging Algorithms.
J. ACM 21(1): 40-53 (1974) |
| 1973 |
|---|
| 2 | | James F. Korsh:
Exponential Bounds for Error and Equivocation Based on Markov Chain Observations
Information and Control 22(2): 107-122 (1973) |
| 1970 |
|---|
| 1 | | James F. Korsh:
On Decisions and Information Concerning an Unknown Parameter
Information and Control 16(2): 123-127 (1970) |
