doi:j.ins

First Page		Document Content
Date: 2008-10-22 02:35:21 Theory of computation Dynamic programming Maximal pair String Mathematics String searching algorithm Suffix tree Approximate string matching Time complexity Algorithm Computer science		doi:j.ins Add to Reading List Source URL: pbil.univ-lyon1.fr Download Document from Source Website File Size: 510,66 KB Share Document on Facebook

	Eﬃcient String-Commitment from Weak Bit-Commitment Kai-Min Chung1, , Feng-Hao Liu2, , Chi-Jen Lu3 , and Bo-Yin Yang3 1 2 DocID: 1xW2U - View Document
	Pushing on a String: State-Owned Enterprises and Monetary Policy Transmission in China Hongyi Chen Hong Kong Institute for Monetary Research Ran Li DocID: 1xVBz - View Document
	Learning Semantic String Transformations from Examples ∗ Rishabh Singh Sumit Gulwani DocID: 1xV1V - View Document
	BlinkFill: Semi-supervised Programming By Example for Syntactic String Transformations Rishabh Singh Microsoft Research, Redmond, USA DocID: 1xUyP - View Document
	HONG KONG INSTITUTE FOR MONETARY RESEARCH PUSHING ON A STRING: STATE-OWNED ENTERPRISES AND MONETARY POLICY TRANSMISSION IN CHINA Hongyi Chen, Ran Li and Peter Tillmann DocID: 1xUfH - View Document