James F. Korsh

According to our database, James F. Korsh authored at least 29 papers between 1970 and 2011.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2011

Fast Generation of <i>t</i>-ary Trees.

James F. Korsh

Comput. J., 2011

2006

A loopless Gray code for rooted trees.

James F. Korsh, Paul LaFollette

ACM Trans. Algorithms, 2006

Skarbek's Algorithm for <i>t</i>-Ary Trees.

James F. Korsh

Comput. J., 2006

2005

Generating T-ary Trees in Linked Representation.

James F. Korsh

Comput. J., 2005

2004

Constant time generation of derangements.

James F. Korsh, Paul LaFollette

Inf. Process. Lett., 2004

Loopless Array Generation of Multiset Permutations.

James F. Korsh, Paul LaFollette

Comput. J., 2004

2003

Loopless Algorithms and Schröder Trees.

James F. Korsh, Paul LaFollette, Seymour Lipschutz

Int. J. Comput. Math., 2003

Loopless Generation of Schröder Trees.

James F. Korsh, Paul LaFollette

Comput. J., 2003

2002

Loopless Generation of Linear Extensions of a Poset.

James F. Korsh, Paul LaFollette

Order, 2002

Loopless Generation of Trees with Specified Degrees.

James F. Korsh, Paul LaFollette

Comput. J., 2002

2001

Loopless generation of up-down permutations.

James F. Korsh

Discret. Math., 2001

2000

A Visual Interface for Effortless Animation of C/C++ Programs.

Paul LaFollette, James F. Korsh, Raghvinder S. Sangwan

J. Vis. Lang. Comput., 2000

A Loopless Algorithm for Generation of Basic Minimal Interval Orders.

Paul LaFollette, James F. Korsh

Order, 2000

Multiset Permutations and Loopless Generation of Ordered Trees with Specified Degree Sequence.

James F. Korsh, Paul LaFollette

J. Algorithms, 2000

1999

Loopless Generation of Gray Codes for <i>k</i>-Ary Trees.

James F. Korsh, Paul LaFollette

Inf. Process. Lett., 1999

1998

Shifts and Loopless Generation of <i>k</i>-Ary Trees.

James F. Korsh, Seymour Lipschutz

Inf. Process. Lett., 1998

A system for program visualization in the classroom.

Raghvinder S. Sangwan, James F. Korsh, Paul LaFollette

Proceedings of the 29th SIGCSE Technical Symposium on Computer Science Education, 1998

1997

Generating Multiset Permutations in Constant Time.

James F. Korsh, Seymour Lipschutz

J. Algorithms, 1997

1994

Loopless Generation of k-Ary Tree Sequences.

James F. Korsh

Inf. Process. Lett., 1994

1993

Counting and Randomly Generating Binary Trees.

James F. Korsh

Inf. Process. Lett., 1993

1983

A Multiple-Stack Manipulation Procedure.

James F. Korsh, Gary Laison

Commun. ACM, 1983

1982

Growing Nearly Optimal Binary Search Trees.

James F. Korsh

Inf. Process. Lett., 1982

1981

Greedy Binary Search Trees are Nearly Optimal.

James F. Korsh

Inf. Process. Lett., 1981

1977

A General Algorithm for One-Dimensional Knapsack Problems.

Giorgio P. Ingargiola, James F. Korsh

Oper. Res., 1977

1976

Canonical Coin Changing and Greedy Solutions.

Lena Chang, James F. Korsh

J. ACM, 1976

1975

An Algorithm for the Solution of 0-1 Loading Problems.

Giorgio P. Ingargiola, James F. Korsh

Oper. Res., 1975

1974

Finding Optimal Demand Paging Algorithms.

Giorgio P. Ingargiola, James F. Korsh

J. ACM, 1974

1973

Exponential Bounds for Error and Equivocation Based on Markov Chain Observations

James F. Korsh

Inf. Control., March, 1973

1970

On Decisions and Information Concerning an Unknown Parameter

James F. Korsh

Inf. Control., April, 1970