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
[1]
Hilfe
Suche: Author="Mullen, Gary L."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Sets of orthogonal hypercubes of class
r
John T. Ethier
,
Gary L. Mullen
,
Daniel Panario
,
Brett Stevens
,
David Thomson
Journal of Combinatorial Theory Series A
119
(2), 2012, pp. 430-439
The extent to which subsets are additively closed
Sophie Huczynska
,
Gary L. Mullen
,
Joseph L. Yucas
Journal of Combinatorial Theory Series A
116
(4), 2009, pp. 831-843
Parallel computing of a quasi-Monte Carlo algorithm for valuing derivatives
Jenny X. Li
,
Gary L. Mullen
Parallel Computing
26
(5), 2000, pp. 641-653
Irreducible polynomials and linear recurring arrays
Mulan Liu
,
Gary L. Mullen
Discrete Applied Mathematics
74
(1), 1997, pp. 93-99
An equivalence between (T,M,S)-nets and strongly orthogonal hypercubes
Gary L. Mullen
,
Wolfgang Ch. Schmid
Journal of Combinatorial Theory Series A
76
(1), 1996, pp. 164-174
Generalizations of Bose's equivalence between complete sets of mutually orthogonal latin squares and affine planes
Charles F. Laywine
,
Gary L. Mullen
Journal of Combinatorial Theory Series A
61
, 1992, pp. 13-35
Partitions with ``
d(a)
copies of
a
''
Ashok K. Agarwal
,
Gary L. Mullen
Journal of Combinatorial Theory Series A
48
, 1988, pp. 120-135