default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJames F. Korsh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[j28]James F. Korsh:
Fast Generation of t-ary Trees. Comput. J. 54(5): 776-785 (2011)
2000 – 2009
- 2006
- [j27]James F. Korsh:
Skarbek's Algorithm for t-Ary Trees. Comput. J. 49(3): 351-357 (2006) - [j26]James F. Korsh, Paul LaFollette:
A loopless Gray code for rooted trees. ACM Trans. Algorithms 2(2): 135-152 (2006) - 2005
- [j25]James F. Korsh:
Generating T-ary Trees in Linked Representation. Comput. J. 48(4): 488-497 (2005) - 2004
- [j24]James F. Korsh, Paul LaFollette:
Loopless Array Generation of Multiset Permutations. Comput. J. 47(5): 612-621 (2004) - [j23]James F. Korsh, Paul LaFollette:
Constant time generation of derangements. Inf. Process. Lett. 90(4): 181-186 (2004) - 2003
- [j22]James F. Korsh, Paul LaFollette:
Loopless Generation of Schröder Trees. Comput. J. 46(1): 106-113 (2003) - [j21]James F. Korsh, Paul LaFollette, Seymour Lipschutz:
Loopless Algorithms and Schröder Trees. Int. J. Comput. Math. 80(6): 709-725 (2003) - 2002
- [j20]James F. Korsh, Paul LaFollette:
Loopless Generation of Trees with Specified Degrees. Comput. J. 45(3): 364-372 (2002) - [j19]James F. Korsh, Paul LaFollette:
Loopless Generation of Linear Extensions of a Poset. Order 19(2): 115-126 (2002) - 2001
- [j18]James F. Korsh:
Loopless generation of up-down permutations. Discret. Math. 240(1-3): 97-122 (2001) - 2000
- [j17]James F. Korsh, Paul LaFollette:
Multiset Permutations and Loopless Generation of Ordered Trees with Specified Degree Sequence. J. Algorithms 34(2): 309-336 (2000) - [j16]Paul LaFollette, James F. Korsh:
A Loopless Algorithm for Generation of Basic Minimal Interval Orders. Order 17(3): 271-285 (2000) - [j15]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)
1990 – 1999
- 1999
- [j14]James F. Korsh, Paul LaFollette:
Loopless Generation of Gray Codes for k-Ary Trees. Inf. Process. Lett. 70(1): 7-11 (1999) - 1998
- [j13]James F. Korsh, Seymour Lipschutz:
Shifts and Loopless Generation of k-Ary Trees. Inf. Process. Lett. 65(5): 235-240 (1998) - [c1]Raghvinder S. Sangwan, James F. Korsh, Paul LaFollette:
A system for program visualization in the classroom. SIGCSE 1998: 272-276 - 1997
- [j12]James F. Korsh, Seymour Lipschutz:
Generating Multiset Permutations in Constant Time. J. Algorithms 25(2): 321-335 (1997) - 1994
- [j11]James F. Korsh:
Loopless Generation of k-Ary Tree Sequences. Inf. Process. Lett. 52(5): 243-247 (1994) - 1993
- [j10]James F. Korsh:
Counting and Randomly Generating Binary Trees. Inf. Process. Lett. 45(6): 291-294 (1993)
1980 – 1989
- 1984
- [e1]Frank L. Friedman, James F. Korsh:
Proceedings of the ACM 12th annual computer science conference on SIGCSE symposium, CSC 1984, Philadelphia, Pennsylvania, USA, February 14-16, 1984. ACM 1984, ISBN 978-0-89791-127-6 [contents] - 1983
- [j9]James F. Korsh, Gary Laison:
A Multiple-Stack Manipulation Procedure. Commun. ACM 26(11): 921-923 (1983) - 1982
- [j8]James F. Korsh:
Growing Nearly Optimal Binary Search Trees. Inf. Process. Lett. 14(3): 139-143 (1982) - 1981
- [j7]James F. Korsh:
Greedy Binary Search Trees are Nearly Optimal. Inf. Process. Lett. 13(1): 16-19 (1981)
1970 – 1979
- 1977
- [j6]Giorgio P. Ingargiola, James F. Korsh:
A General Algorithm for One-Dimensional Knapsack Problems. Oper. Res. 25(5): 752-759 (1977) - 1976
- [j5]Lena Chang, James F. Korsh:
Canonical Coin Changing and Greedy Solutions. J. ACM 23(3): 418-422 (1976) - 1975
- [j4]Giorgio P. Ingargiola, James F. Korsh:
An Algorithm for the Solution of 0-1 Loading Problems. Oper. Res. 23(6): 1110-1119 (1975) - 1974
- [j3]Giorgio P. Ingargiola, James F. Korsh:
Finding Optimal Demand Paging Algorithms. J. ACM 21(1): 40-53 (1974) - 1973
- [j2]James F. Korsh:
Exponential Bounds for Error and Equivocation Based on Markov Chain Observations. Inf. Control. 22(2): 107-122 (1973) - 1970
- [j1]James F. Korsh:
On Decisions and Information Concerning an Unknown Parameter. Inf. Control. 16(2): 123-127 (1970)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
