<%@ page language="java" contentType="text/html" %>
<%-- Include common initialisation code --%>
<%@ include file="/arch/common.jsp" %>
<%-- The current tab --%>
<% String currentTab = "Research"; %>
<%-- Content of navigation pane --%>
<%@ include file="nav.jsp" %>
<% showCurrentLink=true; %>
<%-- Current navigation location --%>
<% String currentNav = "Reports and Theses"; %>
<%-- Include the code for the document header --%>
<%@ include file="/arch/header.jsp" %>
Research Reports 1984
<%-- Include the code for the lines and navigation --%>
<%@ include file="/arch/middle.jsp" %>
<%@ include file="copyright.html" %>
- CS-RR-071
- J.A. Dain,
Error Recovery Schemes in LR Parsers,
December 1, 1984
- CS-RR-069
- P.E. Dunne,
Techniques for the Analysis of Monotone Boolean Networks,
September 1, 1984
- CS-RR-068
- A.M. Gibbons and O.A. Ogunyode,
A Polynomial-time Algorithm to Edge-Colour Almost All Graphs Using Y Colours,
September 1, 1984
- CS-RR-067
- W.M. Beynon,
Monotone Boolean Functions Computable by Planar Circuits,
September 1, 1984
- CS-RR-066
- P.E. Dunne,
Lower Bounds on the Complexity of 1-time only Branching Programs,
August 1, 1984
- CS-RR-065
- J.W. Daykin,
Inequalities for the Number of Monotonic Functions of Partial Orders,
March 1, 1984
- CS-RR-064
- P.E. Dunne,
Some Results on Replacement Rules in Monotone Boolean Networks,
January 1, 1984
- CS-RR-062
- P.E. Dunne,
A 2.5n Lower Bound on the Monotone Network Complexity of T3n,
March 1, 1984
- CS-RR-061
- W.M. Beynon,
Replaceability and Computational Equivalence in Finite Distributive Lattices,
March 1, 1984
- CS-RR-060
- W.F. McColl and M.S. Paterson,
The Planar Realization of Boolean Functions,
March 1, 1984
- CS-RR-059
- W.F. McColl,
Planar Circuits Have Short Specifications,
March 1, 1984
- CS-RR-058
- I. Parberry,
On the Power of Parallel Machines with High-Arity Instruction Sets,
February 1, 1984
<%-- Include the code for the document footer --%>
<%@ include file="/arch/footer.jsp" %>