1 Faster algorithms for string matching with k mismatches Adviser : R. C. T. Lee Speaker: C. C. Yen Journal of Algorithms, Volume 50, Issue 2, February.
Routing in Poisson small-world networks A. J. Ganesh Microsoft Research, Cambridge Joint work with Moez Draief.
Computational Complexity Dr. Colin Campbell Course: EMAT20531.
Error correcting codes A practical problem of theoretical importance.
Tuned Boyer Moore Algorithm Fast string searching, HUME A. and SUNDAY D.M., Software - Practice & Experience 21(11), 1991, pp. 1221-1248. Adviser: R. C.
Tight Bounds for Online Class- constrained Packing Hadas Shachnai Bell Labs and The Technion IIT Tami Tamir The Technion IIT.
Mathematics Involving Shape and Space a Algebra. The 9-Dot Problem.
Http://cindy1 Efficient Probe Selection in Micro-array Design Speaker: Cindy Y. Li Joint work with: Leszek G ą sieniec, Paul Sant, and.
10/12/20141LCS. Given two strings S 1 of length m and S 2 of length n over the same alphabeth. The Longest Common Substring problem is to find the longest.
Approximate List- Decoding and Hardness Amplification Valentine Kabanets (SFU) joint work with Russell Impagliazzo and Ragesh Jaiswal (UCSD)
11 - Programming languages
Ch10
