The Communication and Streaming Complexity of Computing the Longest Common and Increasing Subsequences Xiaoming Sun Tsinghua University David Woodruff.
Analyzing Nonlinear Time Series with Hilbert-Huang Transform Sai-Ping Li Lunch Seminar December 7, 2011.
UGC & SDP, or, Are there any more polynomial time algorithms? Ryan O’Donnell Microsoft Research.
Statistical Models and Methods for Computer Experiments Habilitation à Diriger des Recherches Olivier ROUSTANT Ecole des Mines de St-Etienne 8 th November.
Complexity 1 Hardness of Approximation. Complexity 2 Introduction Objectives: –To show several approximation problems are NP-hard Overview: –Reminder:
Talks on parts of 4 papers. 1) M. Hajiaghayi, Khandekar and K. 2) M. Cygan, K 3) R Chitnis, M. Hajiaghayi, K 4) M. Hajiaghayi, K and some students.
Hardness of Approximation
