D. M. Jackson

	1998
15		Joy N. Reed, D. M. Jackson, B. Deianov, George M. Reed: Automated Formal Analysis of Networks: FDR Models of Arbitrary Topologies and Flow-Control Mechanisms. FASE 1998: 239-254
	1995
14		A. W. Roscoe, Paul H. B. Gardiner, Michael Goldsmith, J. R. Hulance, D. M. Jackson, J. B. Scattergood: Hierarchical Compression for Model-Checking CSP or How to Check 1020 Dining Philosophers for Deadlock. TACAS 1995: 133-152
	1994
13		D. M. Jackson: The Lattice of Non-crossing Partitions and the Birkhoff-Lewis Equations. Eur. J. Comb. 15(3): 245-250 (1994)
	1992
12		E. Rodney Canfield, D. M. Jackson: A D-finiteness result for products of permutations. Discrete Mathematics 99(1-3): 25-30 (1992)
	1991
11		Steve Schneider, Jim Davies, D. M. Jackson, George M. Reed, Joy N. Reed, A. W. Roscoe: Timed CSP: Theory and Practice. REX Workshop 1991: 640-675
	1989
10		Walter A. Deuber, D. M. Jackson, Dieter Jungnickel: Preface. Discrete Mathematics 73(1-2): 1 (1989)
	1981
9		J. S. Devitt, D. M. Jackson: Comma-free Codes: An Extension of Certain Enumerative Techniques to Recursively Defined Sequences. J. Comb. Theory, Ser. A 30(1): 1-18 (1981)
	1980
8		William T. Spears, Barbara Jeffcott, D. M. Jackson: An Algebraic Theory of Sequence Enumeration. J. Comb. Theory, Ser. A 28(2): 191-218 (1980)
	1978
7		D. M. Jackson: Some Results on "Product-Weighted Lead Codes". J. Comb. Theory, Ser. A 25(2): 181-187 (1978)
	1975
6		D. M. Jackson, G. H. John van Rees: The Enumeration of Generalized Double Stochastic Nonnegative Integer Square Matrices. SIAM J. Comput. 4(4): 474-477 (1975)
	1974
5		D. M. Jackson, William W. Wadge: Normal Form Reduction of Probabilistic Computations in Non-Parametric Classification. Comput. J. 17(3): 249-252 (1974)
	1973
4		D. M. Jackson: Closed Form Approximations for Random Errors in Distance Functions. Comput. J. 16(1): 52-56 (1973)
	1972
3		D. M. Jackson, L. J. White: Stability problems in non-statistical classification. Comput. J. 15(3): 214-221 (1972)
2		D. M. Jackson: Expectations of Functions of Sequences over Finite Alphabets with Given Transition Probabilities by Methods Independent of Sequence Length. SIAM J. Comput. 1(3): 203-217 (1972)
	1971
1		D. M. Jackson: Classification, Relevance, and Information Retrieval. Advances in Computers 11: 59-125 (1971)

Coauthor Index

1	E. Rodney Canfield	[12]
2	Jim Davies	[11]
3	B. Deianov	[15]
4	Walter A. Deuber	[10]
5	J. S. Devitt	[9]
6	Paul H. B. Gardiner	[14]
7	Michael Goldsmith	[14]
8	J. R. Hulance	[14]
9	Barbara Jeffcott	[8]
10	Dieter Jungnickel	[10]
11	George M. Reed	[11] [15]
12	Joy N. Reed	[11] [15]
13	G. H. John van Rees	[6]
14	A. W. Roscoe (A. William Roscoe, Bill Roscoe)	[11] [14]
15	J. B. Scattergood	[14]
16	Steve A. Schneider (Steve Schneider)	[11]
17	William T. Spears	[8]
18	William W. Wadge	[5]
19	L. J. White	[3]

Colors in the list of coauthors

Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page