tag:blogger.com,1999:blog-8890204.post919592952774307823..comments2024-03-10T05:26:42.148-04:00Comments on My Biased Coin: Aldous/Diaconis: Longest Increasing SubsequencesMichael Mitzenmacherhttp://www.blogger.com/profile/06738274256402616703noreply@blogger.comBlogger4125tag:blogger.com,1999:blog-8890204.post-27143217618537618452012-05-24T09:10:52.536-04:002012-05-24T09:10:52.536-04:00Well i implemented a c# version of this you can ch...Well i implemented a c# version of this you can check here<br /><br />http://chandermani.blogspot.in/2012/05/alogorithm-finding-longest-increasing.htmlAnonymoushttps://www.blogger.com/profile/01682638722697732038noreply@blogger.comtag:blogger.com,1999:blog-8890204.post-66694927433792424132011-05-17T15:19:28.194-04:002011-05-17T15:19:28.194-04:00This is so clearly explained. Thank you! I was loo...This is so clearly explained. Thank you! I was looking for an algorithm for longest increasing subsequence. I saw most involved doing a binary search with an O(nlogk). I did not understand them. This is so clear.Soniahttps://www.blogger.com/profile/03932803441755688342noreply@blogger.comtag:blogger.com,1999:blog-8890204.post-53105231509691178442010-05-07T15:01:14.240-04:002010-05-07T15:01:14.240-04:00This paper by Sergei Bereg (Bespamyatnikh) and Mi...This paper by Sergei Bereg (Bespamyatnikh) and Michael Segal gives an efficient algorithm for realizing the connections between patience sorting and longest increasing subsequences:<br /><br /><br />http://www.utdallas.edu/~sxb027100/pat.ps.gzAnonymousnoreply@blogger.comtag:blogger.com,1999:blog-8890204.post-65036652444990554322010-05-07T09:35:16.661-04:002010-05-07T09:35:16.661-04:00For the lazy, the paper can be found at http://cit...For the lazy, the paper can be found at http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.39.9172&rep=rep1&type=pdfDavid Andersenhttps://www.blogger.com/profile/03996590425188586871noreply@blogger.com