Volume 102,
Number 1-2,
May 2000
- Charles J. Colbourn, Hadi Kharaghani:
Coding, Cryptography, and Computer Security - Preface.
1
- Yeow Meng Chee, Charles J. Colbourn, Alan C. H. Ling:
Asymptotically optimal erasure-resilient codes for large disk arrays.
3-36
- Warwick de Launey:
On the asymptotic existence of partial complex Hadamard matrices and related combinatorial objects.
37-45
- Warwick de Launey, D. L. Flannery, Kathy J. Horadam:
Cocyclic Hadamard matrices and difference sets.
47-61
- Warwick de Launey, Richard M. Stafford:
On cocyclic weighing matrices and the regular group actions of certain paley matrices.
63-101
- Wolf H. Holzmann, Hadi Kharaghani:
On the orthogonal designs of order 24.
103-114
- Kathy J. Horadam:
An introduction to cocyclic generalised Hadamard matrices.
115-131
- Chengxin Qu, Jennifer Seberry, Josef Pieprzyk:
Homogeneous bent functions.
133-139
- Koichi Shinoda, Mieko Yamada:
A family of Hadamard matrices of dihedral group type.
141-150
- Stoicho D. Stoichev, Vladimir D. Tonchev:
Unital designs in planes of order 16.
151-158
Volume 102,
Number 3,
June 2000
- H. S. Chao, Fang-Rong Hsu, Richard C. T. Lee:
An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs.
159-173
- Grant A. Cheston, Stephen T. Hedetniemi, Arthur L. Liestman, J. B. Stehman:
The even adjacency split problem for graphs.
175-188
- Peter C. Fishburn, Paul E. Wright:
Interference patterns in bijective colorings of 2-regular graphs.
189-204
- Raymond Greenlaw, Rossella Petreschi:
Computing Prüfer codes efficiently in parallel.
205-222
- Nicholas G. Hall, Chris N. Potts, Chelliah Sriskandarajah:
Parallel machine scheduling with a common server.
223-243
- Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang:
Approximation algorithms for some optimum communication spanning tree problems.
245-266
Copyright © Fri Dec 11 19:36:07 2009
by Michael Ley (ley@uni-trier.de)
