David M. Jackson
Affiliations:- University of Waterloo, Department of Combinatorics and Optimization, Department of Combinatorics and Optimization, ON, Canada
- Cornell University, Department of Computer Science, Ithaca, NY, USA (former)
- Ohio State University, Department of Computer and Information Science, Columbus, OH, USA (former)
According to our database1,
David M. Jackson
authored at least 47 papers
between 1967 and 2012.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
On csauthors.net:
Bibliography
2012
Near-central permutation factorization and Strahov's generalized Murnaghan-Nakayama rule.
J. Comb. Theory A, 2012
J. Comb. Theory A, 2012
2007
J. Comb. Theory B, 2007
2003
J. Comb. Theory B, 2003
2002
2000
Transitive Factorizations in the Symmetric Group, and Combinatorial Aspects of Singularity Theory.
Eur. J. Comb., 2000
1999
A Combinatorial Relationship between Eulerian Maps and Hypermaps in Orientable Surfaces.
J. Comb. Theory A, 1999
The Number of Ramified Coverings of the Sphere by the Double Torus, and a General Form for Higher Genera.
J. Comb. Theory A, 1999
A Proof of a Conjecture for the Number of Ramified Coverings of the Sphere by the Torus.
J. Comb. Theory A, 1999
1996
J. Comb. Theory A, 1996
1994
Eur. J. Comb., 1994
Algebraic and Analytic Approaches for the Genus Series for 2-Cell Embeddings on Orientable and Nonorientable Surfaces.
Proceedings of the Formal Power Series and Algebraic Combinatorics, 1994
1992
The combinatorial relationship between trees, cacti and certain connection coefficients for the symmetric group.
Eur. J. Comb., 1992
The asymptotic behaviour of the number of three-connected triangulations of the disk, with a reflective symmetry in a line.
Comb., 1992
1990
A combinatorial construction for products of linear transformations over a finite field.
J. Comb. Theory A, 1990
1989
1988
Some combinatorial problems associated with products of conjugacy classes of the symmetric group.
J. Comb. Theory A, 1988
1987
1986
J. Comb. Theory A, 1986
J. Comb. Theory A, 1986
1985
1983
1981
Comma-free Codes: An Extension of Certain Enumerative Techniques to Recursively Defined Sequences.
J. Comb. Theory A, 1981
The Enumeration of Directed Closed Euler Trails and Directed Hamiltonian Circuits by Lagrangian Methods.
Eur. J. Comb., 1981
Discret. Math., 1981
1980
Discret. Math., 1980
1978
Discret. Math., 1978
1977
J. Comb. Theory A, 1977
1975
The Enumeration of Generalized Double Stochastic Nonnegative Integer Square Matrices.
SIAM J. Comput., 1975
1974
Normal Form Reduction of Probabilistic Computations in Non-Parametric Classification.
Comput. J., 1974
1973
1972
Expectations of Functions of Sequences over Finite Alphabets with Given Transition Probabilities by Methods Independent of Sequence Length.
SIAM J. Comput., 1972
Pattern Recognit., 1972
1971
Proceedings of the ACM SIGIR Information Storage and Retrieval Symposium, 1971
1970
Inf. Storage Retr., 1970
The construction of retrieval environments and pseudo-classifications based on external relevance.
Inf. Storage Retr., 1970
1969
1967
Current approaches to classification and clump-finding at the Cambridge Language Research Unit.
Comput. J., 1967