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
Hilfe
Suche: Author="Jackson, D.M."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A rooted map invariant, non-orientability and Jack symmetric functions
D.R.L. Brown
,
D.M. Jackson
Journal of Combinatorial Theory Series B
97
(3), 2007, pp. 430-452
The matrix of chromatic joins and the Temperley-Lieb algebra
S. Cautis
,
D.M. Jackson
Journal of Combinatorial Theory Series B
89
(1), 2003, pp. 109-155
A proof of a conjecture for the number of ramified coverings of the sphere by the torus
I.P. Goulden
,
D.M. Jackson
Journal of Combinatorial Theory Series A
88
(2), 1999, pp. 246-258
The number of ramified coverings of the sphere by the double torus, and a general form for higher genera
I.P. Goulden
,
D.M. Jackson
Journal of Combinatorial Theory Series A
88
(2), 1999, pp. 259-275
A combinatorial relationship between Eulerian maps and hypermaps in orientable surfaces
D.M. Jackson
,
T.I. Viscentin
Journal of Combinatorial Theory Series A
87
(1), 1999, pp. 120-150
Further determinants with the averaging property of Andrews-Burge
I.P. Goulden
,
D.M. Jackson
Journal of Combinatorial Theory Series A
73
(2), 1996, pp. 368-375
A formulation for the genus series for regular maps
D.M. Jackson
,
T.I. Visentin
Journal of Combinatorial Theory Series A
74
(1), 1996, pp. 14-32
The asymptotic behaviour of the number of three-connected triangulations of the disk, with a reflective symmetry in a line
D.M. Jackson
,
L.B. Richmond
Combinatorica
12
, 1992, pp. 149-153
A combinatorial construction for products of linear transformations over a finite field
I.P. Goulden
,
D.M. Jackson
Journal of Combinatorial Theory Series A
53
, 1990, pp. 157-160
Some combinatorial problems associated with products of conjugacy classes of the symmetric group
D.M. Jackson
Journal of Combinatorial Theory Series A
49
, 1988, pp. 363-369
Labelled graphs with vertices of degree at least three
I.P. Goulden
,
D.M. Jackson
Journal of Graph Theory
11
(2), 1987, pp. 177-189
Distributions, continued fractions, and the Ehrenfest urn model
I.P. Goulden
,
D.M. Jackson
Journal of Combinatorial Theory Series A
41
, 1986, pp. 21-31
Labelled graphs with small vertex degrees and
P
-recursiveness
I.P. Goulden
,
D.M. Jackson
SIAM Journal on Algebraic Discrete Methods
7
, 1986, pp. 60-66
Path generating functions and continued fractions
I.P. Goulden
,
D.M. Jackson
Journal of Combinatorial Theory Series A
41
, 1986, pp. 1-10
Ballot sequences and a determinant of Good's
I.P. Goulden
,
D.M. Jackson
Journal of Combinatorial Theory Series A
40
, 1985, pp. 55-61
The Hammond series of a symmetric function and its application of
P
-recursiveness
I.P. Goulden
,
D.M. Jackson
,
J.W. Reilly
SIAM Journal on Algebraic Discrete Methods
4
, 1983, pp. 179-193
Comma-free codes: An extension of certain enumerative techniques to recursively defined sequences
J.S. Devitt
,
D.M. Jackson
Journal of Combinatorial Theory Series A
30
, 1981, pp. 1-18
An algebraic theory of sequence enumeration
William T. Spears
,
Barbara Jeffcott
,
D.M. Jackson
Journal of Combinatorial Theory Series A
28
, 1980, pp. 191-218
Some results on ``product-weighted lead codes''
D.M. Jackson
Journal of Combinatorial Theory Series A
25
, 1978, pp. 181-187
The unification of certain enumeration problems for sequences
D.M. Jackson
Journal of Combinatorial Theory Series A
22
, 1977, pp. 92-96
The combinatorial interpretation of the Jacobi identity from Lie algebras
D.M. Jackson
Journal of Combinatorial Theory Series A
23
, 1977, pp. 233-256
The enumeration of generalized double stochastic nonnegative integer square matrices
D.M. Jackson
,
G.H.J. van Rees
SIAM Journal on Computing
4
, 1975, pp. 474-477
The enumeration of homeomorphically irreducible labelled graphs
D.M. Jackson
,
J.W. Reilly
Journal of Combinatorial Theory Series B
19
, 1975, pp. 272-286
Expectations of functions of sequences over finite alphabets with given transition probabilities by methods independent of sequence length
D.M. Jackson
SIAM Journal on Computing
1
, 1972, pp. 203-217