James F. Korsh

30 papers A 1Journal 28
YearRankTypeTitle / Venue / Authors
2011 J jnl
Fast Generation of
Comput. J.
James F. Korsh
2006 J jnl
A loopless Gray code for rooted trees.
ACM Trans. Algorithms
James F. Korsh, Paul LaFollette
2006 J jnl
Skarbek's Algorithm for
Comput. J.
James F. Korsh
2005 J jnl
Generating T-ary Trees in Linked Representation.
Comput. J.
James F. Korsh
2004 J jnl
Constant time generation of derangements.
Inf. Process. Lett.
James F. Korsh, Paul LaFollette
2004 J jnl
Loopless Array Generation of Multiset Permutations.
Comput. J.
James F. Korsh, Paul LaFollette
2003 J jnl
Loopless Algorithms and Schröder Trees.
Int. J. Comput. Math.
James F. Korsh, Paul LaFollette, Seymour Lipschutz
2003 J jnl
Loopless Generation of Schröder Trees.
Comput. J.
James F. Korsh, Paul LaFollette
2002 J jnl
Loopless Generation of Linear Extensions of a Poset.
Order
James F. Korsh, Paul LaFollette
2002 J jnl
Loopless Generation of Trees with Specified Degrees.
Comput. J.
James F. Korsh, Paul LaFollette
2001 J jnl
Loopless generation of up-down permutations.
Discret. Math.
James F. Korsh
2000 J jnl
A Loopless Algorithm for Generation of Basic Minimal Interval Orders.
Order
Paul LaFollette, James F. Korsh
2000 J jnl
A Visual Interface for Effortless Animation of C/C++ Programs.
J. Vis. Lang. Comput.
Paul LaFollette, James F. Korsh, Raghvinder S. Sangwan
2000 J jnl
Multiset Permutations and Loopless Generation of Ordered Trees with Specified Degree Sequence.
J. Algorithms
James F. Korsh, Paul LaFollette
1999 J jnl
Loopless Generation of Gray Codes for
Inf. Process. Lett.
James F. Korsh, Paul LaFollette
1998 A conf
A system for program visualization in the classroom.
SIGCSE
Raghvinder S. Sangwan, James F. Korsh, Paul LaFollette
1998 J jnl
Shifts and Loopless Generation of
Inf. Process. Lett.
James F. Korsh, Seymour Lipschutz
1997 J jnl
Generating Multiset Permutations in Constant Time.
J. Algorithms
James F. Korsh, Seymour Lipschutz
1994 J jnl
Loopless Generation of k-Ary Tree Sequences.
Inf. Process. Lett.
James F. Korsh
1993 J jnl
Counting and Randomly Generating Binary Trees.
Inf. Process. Lett.
James F. Korsh
1984 — ed.
Proceedings of the ACM 12th annual computer science conference on SIGCSE symposium, CSC 1984, Philadelphia, Pennsylvania, USA, February 14-16, 1984
ACM Conference on Computer Science
Frank L. Friedman, James F. Korsh
1983 J jnl
A Multiple-Stack Manipulation Procedure.
Commun. ACM
James F. Korsh, Gary Laison
1982 J jnl
Growing Nearly Optimal Binary Search Trees.
Inf. Process. Lett.
James F. Korsh
1981 J jnl
Greedy Binary Search Trees are Nearly Optimal.
Inf. Process. Lett.
James F. Korsh
1977 J jnl
A General Algorithm for One-Dimensional Knapsack Problems.
Oper. Res.
Giorgio P. Ingargiola, James F. Korsh
1976 J jnl
Canonical Coin Changing and Greedy Solutions.
J. ACM
Lena Chang, James F. Korsh
1975 J jnl
An Algorithm for the Solution of 0-1 Loading Problems.
Oper. Res.
Giorgio P. Ingargiola, James F. Korsh
1974 J jnl
Finding Optimal Demand Paging Algorithms.
J. ACM
Giorgio P. Ingargiola, James F. Korsh
1973 J jnl
Exponential Bounds for Error and Equivocation Based on Markov Chain Observations
Inf. Control.
James F. Korsh
1970 J jnl
On Decisions and Information Concerning an Unknown Parameter
Inf. Control.
James F. Korsh