Professor C Mitchell, Department of Computer Science, Royal Holloway, University of London, Egham Hill, Surrey, TW20 0EX Address for correspondence (temporary): Molenstraat 3C, B-1560 Hoeilaart, Belgium, tel: + 32 2 657 5905

• The Combinatorics of some Abstract Data Types ; Recent Results in the Theory or Program Flowgraphs ; Applications of Combinatorics to Security ; The Regular Coloration of Graphs ; The Use of Combinatorial Structures in Communication Signal Design ; A Constructive Algorithm for Neural Network Design with Application to Channel Equalization ; The Weight Distribution of K M Codes ; Densities of Perfect Linear Complexity Profile Binary Sequences ; When Constraints are Easy to Satisfy ; A Unified Approach to Problems in Radio Channel Assignment ; Interconnection Networks Based on Two-dimensional de Bruijn Graphs ; A Graph Theoretic Solution to the Interface Equation ; Uniformly Optimally Reliable Networks for Vertex Failures ; Multi-Function Coding and Modulation for Spread Spectrum and CDMA with Inherent Security ; Multi-Stage Scheduling Problems with Precedence Constraints ; Frequency Assignment for Cellular Radio Networks

Professor C Mitchell, Department of Computer Science, Royal Holloway, University of London, Egham Hill, Surrey, TW20 0EX Address for correspondence (temporary): Molenstraat 3C, B-1560 Hoeilaart, Belgium, tel: + 32 2 657 5905

• The Combinatorics of some Abstract Data Types ; Recent Results in the Theory or Program Flowgraphs ; Applications of Combinatorics to Security ; The Regular Coloration of Graphs ; The Use of Combinatorial Structures in Communication Signal Design ; A Constructive Algorithm for Neural Network Design with Application to Channel Equalization ; The Weight Distribution of K M Codes ; Densities of Perfect Linear Complexity Profile Binary Sequences ; When Constraints are Easy to Satisfy ; A Unified Approach to Problems in Radio Channel Assignment ; Interconnection Networks Based on Two-dimensional de Bruijn Graphs ; A Graph Theoretic Solution to the Interface Equation ; Uniformly Optimally Reliable Networks for Vertex Failures ; Multi-Function Coding and Modulation for Spread Spectrum and CDMA with Inherent Security ; Multi-Stage Scheduling Problems with Precedence Constraints ; Frequency Assignment for Cellular Radio Networks

Professor C Mitchell, Department of Computer Science, Royal Holloway, University of London, Egham Hill, Surrey, TW20 0EX Address for correspondence (temporary): Molenstraat 3C, B-1560 Hoeilaart, Belgium, tel: + 32 2 657 5905

• The Combinatorics of some Abstract Data Types ; Recent Results in the Theory or Program Flowgraphs ; Applications of Combinatorics to Security ; The Regular Coloration of Graphs ; The Use of Combinatorial Structures in Communication Signal Design ; A Constructive Algorithm for Neural Network Design with Application to Channel Equalization ; The Weight Distribution of K M Codes ; Densities of Perfect Linear Complexity Profile Binary Sequences ; When Constraints are Easy to Satisfy ; A Unified Approach to Problems in Radio Channel Assignment ; Interconnection Networks Based on Two-dimensional de Bruijn Graphs ; A Graph Theoretic Solution to the Interface Equation ; Uniformly Optimally Reliable Networks for Vertex Failures ; Multi-Function Coding and Modulation for Spread Spectrum and CDMA with Inherent Security ; Multi-Stage Scheduling Problems with Precedence Constraints ; Frequency Assignment for Cellular Radio Networks