Menu_Home Home   Menu_Latest Latest   Menu_Search Advanced Search   Menu_Browse_by_Year By Year   Menu_Browse_by_Division By Division
  
Screen decoration graphicsLogo

Computing a longest increasing subsequence of length k in time O(nloglog k)

Crochemore, Maxime and Porat, Ely (2008) Computing a longest increasing subsequence of length k in time O(nloglog k). In: Visions of computer science, 22-24 September 2008, Imperial College, London, UK.

Full text not available from this repository.


Item Type:Conference or Workshop Item (Paper)
Subjects:UNSPECIFIED
ID Code:1307
Deposited By:Prof Maxime Crochemore
Deposited On:11 Mar 2009 10:47
Last Modified:11 Mar 2009 10:47

Repository Staff Only: item control page