The Library
Browse by Department at the University of Warwick
Up a level |
Number of items: 8.
Beynon, Meurig (1984) Monotone Boolean functions computable by planar circuits. Coventry, UK: University of Warwick. Department of Computer Science. (Department of Computer Science Research Report). (Unpublished)
Beynon, Meurig (1984) Replaceability and computational equivalence in finite distributive lattices. Coventry, UK: University of Warwick. Department of Computer Science. (Department of Computer Science Research Report). (Unpublished)
Dain, Julia Anne (1984) Error recovery schemes in LR parsers. Coventry, UK: University of Warwick. Department of Computer Science. (Department of Computer Science Research Report). (Unpublished)
Daykin, J. W. (1984) Inequalities for the number of monotonic functions of partial orders. Coventry, UK: University of Warwick. Department of Computer Science. (Department of Computer Science Research Report). (Unpublished)
Dunne, P. E. (1984) Lower bounds on the complexity of 1-time only branching programs. Coventry: University of Warwick. Department of Computer Science. (Unpublished)
Dunne, Paul E. (1984) Some results on replacement rules in monotone Boolean networks. Coventry, UK: University of Warwick. Department of Computer Science. (Department of Computer Science Research Report). (Unpublished)
Dunne, Paul E. (1984) Techniques for the analysis of monotone Boolean networks. PhD thesis, University of Warwick.
Wilson, Roland (1984) Uncertainty, Eigenvalue problems and filter design. In: IEEE International Conference on ICASSP '84 Acoustics, Speech, and Signal Processing. Published in: IEEE International Conference on ICASSP '84 Acoustics, Speech, and Signal Processing, Volume 9 pp. 164-167.