Key publications of Advanced Algorithms and Systems

Research group: Information-Theoretic Learning

Research group: Information-Theoretic Learning

  • M. Li, X. Chen, X. Li, B. Ma, P. Vitányi, The similarity metric, Proc. 14th ACM-SIAM Symp. Discrete Algorithms, 2003. CC/0111054.
  • N.K. Vereshchagin, P.M.B. Vitányi, Kolmogorov's structure functions and an application to the foundations of model selection, Proc. 47th IEEE Symp. Found. Comput. Sci., 2002, 751-760.
  • S. Haldar and P. Vitányi, Bounded concurrent timestamp systems using vector clocks, J. Assoc. Comp. Mach., 49:1(2002), 101-126.
  • M. Li, B. Ma, and J. Tromp. PatternHunter: Faster And More Sensitive Homology Search. Bioinformatics. Accepted for publication, 2001.
  • T. Jiang, M. Li, P. Vitányi, A lower bound on the average-case complexity of Shellsort, J. Assoc. Comp. Mach., 47:5(2000), 905-911.
  • H. Buhrman, M. Franklin, J. Garay, J.H. Hoepman, J. Tromp, P. Vitányi, Mutual Search, J. Assoc. Comp. Mach., 46:4(1999), 517-536.
  • C.H. Bennett, P. Gács, M. Li, P.M.B. Vitányi, and W. Zurek, Information Distance, IEEE Trans. Information Theory, IT-44:4(1998) 1407-1423.
  • M. Li and P.M.B. Vitányi, An Introduction to Kolmogorov Complexity and its Applications, Springer-Verlag, New York, Second Edition, 1997.