Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Author="Korsh, James"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Constant time generation of derangements
James F. Korsh
,
Paul S. LaFollette
Information Processing Letters
90
(4), 2004, pp. 181-186
Multiset permutations and loopless generation of ordered trees with specified degree sequence
James F. Korsh
,
Paul LaFollette
Journal of Algorithms
34
(2), 2000, pp. 309-336
Loopless generation of Gray codes for
k
-ary trees
James F. Korsh
,
Paul LaFollette
Information Processing Letters
70
(1), 1999, pp. 7-11
Shifts and loopless generation of
k
-ary trees
James F. Korsh
,
Seymour Lipschutz
Information Processing Letters
65
(5), 1998, pp. 235-240
Generating multiset permutations in constant time
James Korsh
,
Seymour Lipschutz
Journal of Algorithms
25
(2), 1997, pp. 321-335
Loopless generation of
k
-ary tree sequences
James F. Korsh
Information Processing Letters
52
, 1994, pp. 243-247
Counting and randomly generating binary trees
James F. Korsh
Information Processing Letters
45
(6), 1993, pp. 291-294
Exponential bounds for error and equivocation based on Markov chain observations
James F. Korsh
Information and Control
22
, 1973, pp. 107-122
On decisions and information concerning an unknown parameter
James F. Korsh
Information and Control
16
, 1970, pp. 123-127