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