1. Two polynomial algorithms in PLA folding;Arbib,1991
2. Optimal design of programmed logic arrays;Arbib,1988
3. Complexity of finding embeddings in a k-tree;Arnborg;SIAM J. Alg. Discr. Meth.,1987
4. An optimum gate placement algorithm for MOS one-dimensional arrays;Asano;J. Digital Systems,1982
5. An approximation algorithm for Manhattan routing;Baker,1984