B

Bollobas, B. and Fenner, Trevor and Frieze, A.M. (1987) An algorithm for finding Hamilton cycles in a random graph. Combinatorica 7 (4), pp. 327-341. ISSN 0209-9683.

C

Cruz, I.F. and Mendelzon, A.O. and Wood, Peter (1987) A graphical query language supporting recursion. In: Dayal, U. and Traiger, I.L. (eds.) Proceedings of the Association for Computing Machinery Special Interest Group on Management of Data 1987 Annual Conference. Association for Computing Machinery, pp. 323-330. ISBN 9780897912365.

L

Levene, Mark and Loizou, G. (1987) γ-Acyclic database schemes and nested relations. In: Abiteboul, S. and Fischer, P.C. and Schek, H.-J. (eds.) Nested Relations and Complex Objects in Databases: Papers from the Workshop 'Theory and Applications of Nested Relations and Complex Objects'. Lecture Notes in Computer Science 361. Springer, pp. 313-323. ISBN 9783540511717.

Levene, Mark and Loizou, G. (1987) Project join constructibility for NF2 relational databases. In: Adiba, M.A. (ed.) Troisiemes Journees Bases de Donnees Avancees. INRIA, pp. 143-164.

Lorentzos, N.A. and Johnson, Roger (1987) TRAA model for a temporal relational algebra. In: Rolland, C. and Bodart, F. and Leonard, M. (eds.) Temporal Aspects in Information Systems: Proceedings of the IFIP Working Conference on Temporal Aspects in Information Systems. Elsevier.

M

Mitton, Roger (1987) Spelling checkers, spelling correctors and the misspellings of poor spellers. Information Processing & Management 23 (5), pp. 495-505. ISSN 0306-4573.

Z

Zakharyaschev, Michael (1987) Theorem proving in intermediate and modal logics. In: Budach, L. and Bakharajev, R.G. and Lipanov, O.B. (eds.) FCT 87: Fundamentals of Computation Theory. Lecture Notes in Computer Science 278. Springer, pp. 492-496. ISBN 9783540187400.