Mi Lu

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Hua Lin

> Home > Persons > Mi Lu

Publications

1996
[j11]
- view
  authority control:
- export record
  dblp key:
  - journals/jcst/LinLF96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcst/LinLF96
Hua Lin, Mi Lu, Jesse Zhixi Fang:
A direct approach for finding loop transformation matrices. J. Comput. Sci. Technol. 11(3): 237-256 (1996)
1994
[j9]
- view
  authority control:
- export record
  dblp key:
  - journals/tpds/LuL94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tpds/LuL94
Mi Lu, Hua Lin:
Parallel Algorithms for the Longest Common Subsequence Problem. IEEE Trans. Parallel Distributed Syst. 5(8): 835-848 (1994)
[c15]
- view
  authority control:
- export record
  dblp key:
  - conf/icpads/LinLF94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icpads/LinLF94
Hua Lin, Mi Lu, Jesse Zhixi Fang:
A New Approach for Finding Loop Transformation Matrices. ICPADS 1994: 386-391
1991
[c9]
- view
  authority control:
- export record
  dblp key:
  - conf/ipps/FangLL91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ipps/FangLL91
Zhixi Fang, Mi Lu, Hua Lin:
An Approach to Solve the Cache Thrashing Problem. IPPS 1991: 330-335
[c7]
- view
  authority control:
- export record
  dblp key:
  - conf/spdp/LinLF91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/spdp/LinLF91
Hua Lin, Mi Lu, Jesse Zhixi Fang:
An optimal algorithm for the longest common subsequence problem. SPDP 1991: 630-639

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.