Calculating an Optimal Homomorphic Algorithm for Bracket Matching (1999)

by Zhenjiang Hu , Masato Takeichi
Venue:Parallel Processing Letters
Citations:2 - 2 self

Documents Related by Co-Citation

9 Computing Downwards Accumulations on Trees Quickly – Jeremy Gibbons, Jeremy Gibbons - 1995
5 A Calculus for Exploiting Data Parallelism on Recursively Defined Data – Susumu Nishimura, Atsushi Ohori - 1994
5 Data Parallel Programming: A Survey and a Proposal for a New Model РPer Hammarlund, Per Hammarlundy, Björn Lisper, Bjorn Lisper - 1993
7 Categorical Data Types – D. B. Skillicorn - 1993
60 Safe fusion of functional expressions – Wei-Ngan Chin - 1992
18 Parallel Implementation of Tree Skeletons – D. B. Skillicorn - 1995
28 Polytypic Pattern Matching – Johan Jeuring - 1995
41 Calculate Polytypically! – Lambert Meertens - 1996
4 Kernel-Control Parallel Versus Data Parallel: A Technical Comparison – T Pratt - 1992
18 Efficient Parallel Algorithms for Tree Accumulations – Jeremy Gibbons, Wentong Cai, David B. Skillicorn - 1994
19 Parallelism via homomorphism – Z N Grant-Duff, P Harrison - 1996
97 and Order in Algorithmics – Law - 1992
35 Homomorphisms and promotability – G Malcolm - 1989
91 Programming for Parallelism – A H Karp - 1987
21 Formal derivation of efficient parallel programs by construction of list homomorphisms – Z Hu, H Iwasaki, M Takechi - 1997
17 Flattening Trees – Gabriele Keller, Manuel M.T. Chakravarty - 1998
41 The Bird-Meertens Formalism as a Parallel Model – D. B. Skillicorn - 1993
13 A Generic Program for Sequential Decision Processes – Oege De Moor - 1995
92 Polytypic programming – Patrik Jansson - 2000