tag:blogger.com,1999:blog-5057407789239134038.post4364171015368235166..comments2010-08-22T06:31:13.499-07:00Comments on CMU Advanced Algorithms: Lecture 5 notesUnknownnoreply@blogger.comBlogger1125tag:blogger.com,1999:blog-5057407789239134038.post-86213219752314149092009-09-30T17:21:13.147-07:002009-09-30T17:21:13.147-07:00P.S. In the RAM model, Mendelson, Tarjan, Thorup a...P.S. In the RAM model, Mendelson, Tarjan, Thorup and Zwick (SODA 04, STACS 04) give a deterministic algorithm for branchings that runs in time O(m log log n), and a randomized algorithm that has expected runtime O(m \sqrt{log log n}).Anupamhttps://www.blogger.com/profile/16810841145280011482noreply@blogger.com