A parallel tree difference algorithm

Information Processing Letters

Volumn 60, Issue 5, 1996, Pages 231-235

  Skillicorn, D B ^a  

^a QUEEN S UNIVERSITY   (Canada)

Author keywords

Accumulations; Structured text; Tree contraction; Tree difference; Tree edit; Universal hashing

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; DYNAMIC PROGRAMMING; PARALLEL PROCESSING SYSTEMS; PROGRAM PROCESSORS;

HYPERTEXT; PARALLEL EXECUTION TIME; SEQUENTIAL EXECUTION TIME; STRUCTURED TEXT; TREE CONTRACTION; TREE DIFFERENCE; TREE EDIT; UNIVERSAL HASHING;

PARALLEL ALGORITHMS;

EID: 0030577287     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(96)00171-8     Document Type: Article

References (14)

1. K. Abrahamson, N. Dadoun, D.G. Kirkpatrick and T. Przytycka, A simple parallel tree contraction algorithm, in: Proc. 25th Allerton Conf. on Communication, Control and Computing (1987) 624-633.
2. D.T. Barnard and N. Duncan, The document-to-document correction problem, Tech. Rept. 91-315, Dept. of Computing and Information Science, Queen's University, 1991.
3. A. Gibbons and W. Rytter, Efficient Parallel Algorithms (Cambridge University Press, Cambridge, MA, 1988).
4. J. Gibbons, Algebras for tree algorithms, D.Phil. Thesis, Programming Research Group, University of Oxford, 1991.
5. J. Gibbons, W. Cai and D.B. Skillicorn, Efficient parallel algorithms for tree accumulations, Sci. Comput. Programming 23 (1994) 1-14.
6. G. Gonnet, Expected length of the longest probe sequence in hash code searching, J. ACM 28 (2) (1981) 289.
7. International Organisation for Standardisation, Information Processing Systems - Document Filing and Retrieval, 1987. ISO/TC 97/SC 18/WG 4.
8. ISO, Information processing - Text and office systems -Standard generalized markup language (SGML), 1986.
9. D.E. Knuth, The Art of Computer Programming, Vol. I: Fundamental Algorithms (Addison-Wesley, Reading, MA, 19730.
10. G.L. Miller and J. Reif, Parallel tree contraction and its application, in: Proc. 26th IEEE Symp. on Foundations of Computer Science (1985) 478-489.
11. D. Shasha and K. Zhang, Fast algorithms for the unit cost editing, J. Algorithms 11 (1990) 581-621.
12. D.B. Skillicorn, Parallel implementation of tree skeletons, J. Parallel Distributed Comput., to appear.
13. R.C. Uzgalis, General hash functions, Tech. Rept. TR-92-01, The University of Hong Kong, 1993.
14. M.N. Wegman and J.L. Carter, New hash functions and their use in authentication and set equality, J. Comput. System Sci. 22 (3) (1981) 265-279.