 | 
| |
Online DBLP entries are available for Louxin Zhang and the following references. (The DiSC DBLP references below have been taken from the Novemember 1998 DBLP.)
-
Jing
Chen,
Limsoon
Wong, Louxin Zhang: A Protein Patent Query System Powered By Kleisli.
SIGMOD
Conference 1998: 593-595
-
Richard
Beigel,
William
I. Gasarch,
Ming
Li, Louxin Zhang: Addition in log2n + O(1) Steps on Average:
A Simple Analysis.
TCS
191(1-2): 245-248 (1998)
-
John
Tromp, Louxin Zhang,
Ying
Zhao: Small Weight Bases for Hamming Codes.
TCS
181(2): 337-345 (1997)
-
Ming
Li,
John
Tromp, Louxin Zhang: Some Notes on the Nearest Neighbour Interchange
Distance.
COCOON
1996: 343-351
-
Richard
Beigel,
William
I. Gasarch,
Ming
Li, Louxin Zhang: Addition in $\log_2{n}$ + O(1)$ Steps on Average:
A Simple Analysis.
Electronic
Colloquium on Computational Complexity (ECCC)(051): (1996)
-
John
Tromp, Louxin Zhang,
Ying
Zhao: Small Weight Bases for Hamming Codes.
COCOON
1995: 235-243
-
Alan
Roberts,
Antonios
Symvonis, Louxin Zhang: Routing on Trees via Matchings.
WADS
1995: 251-262
-
Louxin Zhang: On the Approximation of Longest Common Nonsupersequences
and Shortest Common Nonsubsequences.
TCS
143(2): 353-362 (1995)
-
Klaus
Madlener,
Paliath
Narendran,
Friedrich
Otto, Louxin Zhang: On Weakly Confluent Monadic String-Rewriting Systems.
TCS
113(1): 119-165 (1993)
-
Louxin Zhang: The Pre-NTS Property is Undecidable for Context-Free Grammars.
IPL
44(4): 181-184 (1992)
-
Friedrich
Otto, Louxin Zhang: Decision Problems for Finite Special String-Rewriting
Systems that are Confluent on Some Congruence Class.
Acta
Informatica 28(5): 477 (1991)
DBLP: Copyright ©1999 by Michael Ley (ley@uni-trier.de).
|
|
