Jiang, T. ., & Li, M. . (1993). Approximating shortest superstrings with constraints.
Publications
Filter by:
Jiang, T. ., & Li, M. . (1993). On the complexity of learning strings and sequences. On the Complexity of Learning Strings and Sequences.
Jiang, T. ., & Li, M. . (1993). On the complexity of learning strings and sequences. Theoretical Computer Science, 119, 363-371.
Bennett, C. ., Gacs, P. ., Li, M. ., Vitanyi, P. ., & Zurek, W. . (1993). Thermodynamics of computation and information distance.
Jiang, T. ., Li, M. ., & Du, D. . (1992). A note on shortest common superstrings with flipping. Inform. Process. Lett., 44:4, 195-199.
Jiang, T. ., Li, M. ., & Du, D. . (1992). A note on shortest common superstrings with flipping. A Note on Shortest Common Superstrings With Flipping.
Jiang, T. ., Li, M. ., & Du, D. . (1992). A note on shortest common superstrings with flipping. A Note on Shortest Common Superstrings With Flipping.
Jiang, T. ., Li, M. ., & Du, D. . (1992). A note on shortest common superstrings with flipping. A Note on Shortest Common Superstrings With Flipping.
Jiang, T. ., Li, M. ., & Du, D. . (1992). A note on shortest common superstrings with flipping. A Note on Shortest Common Superstrings With Flipping.
Jiang, T. ., & Li, M. . (1991). On the complexity of learning strings and sequences.