James F. Korsh - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 29 from 29

2011

Fast Generation of ::::t::::-ary TreesJames F. Korsh. cj, 54(5):776-785, 2011. [doi]

2006

Skarbek s Algorithm for ::::t::::-Ary TreesJames F. Korsh. cj, 49(3):351-357, 2006. [doi]

A loopless Gray code for rooted treesJames F. Korsh, Paul LaFollette. TALG, 2(2):135-152, 2006. [doi]

2005

Generating T-ary Trees in Linked RepresentationJames F. Korsh. cj, 48(4):488-497, 2005. [doi]

2004

Constant time generation of derangementsJames F. Korsh, Paul LaFollette. ipl, 90(4):181-186, 2004. [doi]

Loopless Array Generation of Multiset PermutationsJames F. Korsh, Paul LaFollette. cj, 47(5):612-621, 2004. [doi]

2003

Loopless Algorithms and Schröder TreesJames F. Korsh, Paul LaFollette, Seymour Lipschutz. ijcm, 80(6):709-725, 2003. [doi]

Loopless Generation of Schröder TreesJames F. Korsh, Paul LaFollette. cj, 46(1):106-113, 2003. [doi]

2002

Loopless Generation of Trees with Specified DegreesJames F. Korsh, Paul LaFollette. cj, 45(3):364-372, 2002. [doi]

Loopless Generation of Linear Extensions of a PosetJames F. Korsh, Paul LaFollette. order, 19(2):115-126, 2002. [doi]

2001

Loopless generation of up-down permutationsJames F. Korsh. DM, 240(1-3):97-122, 2001. [doi]

2000

Multiset Permutations and Loopless Generation of Ordered Trees with Specified Degree SequenceJames F. Korsh, Paul LaFollette. jal, 34(2):309-336, 2000.

A Loopless Algorithm for Generation of Basic Minimal Interval OrdersPaul LaFollette, James F. Korsh. order, 17(3):271-285, 2000. [doi]

A Visual Interface for Effortless Animation of C/C++ ProgramsPaul LaFollette, James F. Korsh, Raghvinder S. Sangwan. JCL (JVLC), 11(1):27-48, 2000.

1999

Loopless Generation of Gray Codes for ::::k::::-Ary TreesJames F. Korsh, Paul LaFollette. ipl, 70(1):7-11, 1999. [doi]

1998

Shifts and Loopless Generation of ::::k::::-Ary TreesJames F. Korsh, Seymour Lipschutz. ipl, 65(5):235-240, 1998. [doi]

A system for program visualization in the classroomRaghvinder S. Sangwan, James F. Korsh, Paul LaFollette. sigcse 1998: 272-276 [doi]

1997

Generating Multiset Permutations in Constant TimeJames F. Korsh, Seymour Lipschutz. jal, 25(2):321-335, 1997.

1994

Loopless Generation of k-Ary Tree SequencesJames F. Korsh. ipl, 52(5):243-247, 1994.

1993

Counting and Randomly Generating Binary TreesJames F. Korsh. ipl, 45(6):291-294, 1993.

1983

A Multiple-Stack Manipulation ProcedureJames F. Korsh, Gary Laison. CACM, 26(11):921-923, 1983.

1982

Growing Nearly Optimal Binary Search TreesJames F. Korsh. ipl, 14(3):139-143, 1982.

1981

Greedy Binary Search Trees are Nearly OptimalJames F. Korsh. ipl, 13(1):16-19, 1981.

1977

A General Algorithm for One-Dimensional Knapsack ProblemsGiorgio P. Ingargiola, James F. Korsh. ior, 25(5):752-759, 1977. [doi]

1976

Canonical Coin Changing and Greedy SolutionsLena Chang, James F. Korsh. JACM, 23(3):418-422, 1976. [doi]

1975

An Algorithm for the Solution of 0-1 Loading ProblemsGiorgio P. Ingargiola, James F. Korsh. ior, 23(6):1110-1119, 1975. [doi]

1974

Finding Optimal Demand Paging AlgorithmsGiorgio P. Ingargiola, James F. Korsh. JACM, 21(1):40-53, 1974. [doi]

1973

Exponential Bounds for Error and Equivocation Based on Markov Chain ObservationsJames F. Korsh. iandc, 22(2):107-122, March 1973.

1970

On Decisions and Information Concerning an Unknown ParameterJames F. Korsh. iandc, 16(2):123-127, April 1970.

Sign in or sign up to see more results.

runs on WebDSL