New applications of the incompressibility method

Computer Journal

Volumn 42, Issue 4, 1999, Pages 292-293

  Jlang, Tag ^a   Li, Mlng ^a   Vltányi, Paul ^a,b,c  

^a MCMASTER UNIVERSITY   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

^c UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; THEOREM PROVING;

INCOMPRESSIBILITY METHODS;

COMPUTATIONAL COMPLEXITY;

EID: 0032692011     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (17)

1. Li, M. and Vitânyi, P. M. B. (1997) An Introduction to Kolmogorov Complexity and its Applications, (2nd edn). Springer, New York.
2. Jiang, T., Li, M. and Vitânyi, P. (1999) Averagecase complexity of Shellsort. Proc. Int. Conf. Automata, Languages and Programming, Lecture Notes in Computer Science. Springer.
3. Li, M. and Vitânyi, P. M. B. (1994) Kolmogorov complexity arguments in combinatorics. J. Comb. Theory, A, 66, 226-236. Errata, J. Comb. Theory, A, 69, (1995) 183.
4. Buhrman, H., Jiang, T., Li, M. and Vitânyi, P. M. B. (1998) New applications of the incompressibility method: part II. Theoret. Compiit. Sei. (Special Issue for Int. Conf. Theoret. Compitt. Sei. Hong Kong, April, 1998. To appear.
5. Kolmogorov, A. N. (1965) Three approaches to the quantita-tive definition of information. Prob. Inform. Transmission, 1, 1-7.
6. Niedermeier, R., Reinhard!, K. and Sanders, P. (1997) Towards optimal locality in Mesh-Indexings. In Proc. FCT'97, (LNCS 1279), pp. 364-375. Springer, Berlin.
7. Paterson, M. and Dancfk, V. (1994) Longest common subsequences. In Proc. 19th Int. Symp. on Mathematical Foundations of Computer Science (LNCS 841), pp. 127-142. Springer, Berlin.
8. Sankoff, D. and Kruskall, J. (eds) (1983) Tune Warps, String Edits, and Macromoleciiles: The Theory and Practice of Sequence Comparison. Addison-Wesley, Reading, MA.
9. Chvâtal, V. and Sankoff, D. (1975) Longest common subsequences of two random sequences. 7. Appl. Probab., 12, 306-315.
10. Dancfk, V. and Paterson, M. (1994) Upper bounds for the expected length of a longest common subsequence of two binary sequences. In Pr. llth Ann. Symp. Theoretical Aspects of Computer Science (LNCS 775), pp. 669-678. Springer, Berlin.
11. Deken, J. G. (1979) Some limit results for longest common subsequences. Discrete Math., 26, 17-31.
12. Deken, J. G. (1983) Probabilistic behavior of longestcommon-subsequence length. In Sankoff, D. and Kruskall, J. (eds), Tune Warps, String Edits, and Macromoleciiles: The Theory and Practice of Sequence Comparison, pp. 359-362. Addison-Wesley, Reading, MA.
13. Jiang, T. and Li, M. (1995) On the approximation of shortest common supersequences and longest common subsequences. SIAMJ. Computing, 24-5, 1122-1139.
14. Baeza-Yates, R. and Navarro, G. (1999) Bounding the length of longest common subsequences and forests. Theor. Compiit. Syst., 32,435-452.
15. Khinchine, A. I. (1924) Fundamenta Mathemalicae, 6, 9-20.
16. Feller, W. (1957) An Introduction to Probability Theory and Its Applications, Vols. 1 and 2, (2nd edn). Wiley, New York.
17. Révész, P. (1990) Random Walk in Random and Non-Random Environments. World Scientific, Singapore.