http://www.bibsonomy.org/burst/user/gwpl/AlgorithmicBibSonomy BuRST Feed for /user/gwpl/Algorithmic2008-08-21T05:39:26+02:00http://www.bibsonomy.org/bibtex/2e86c06e90e672624cc5e986beaefb1b3/gwplgwpl2008-06-30T18:06:50+02:00recommended_by_GW algorithm Algorithmic <span style="color:#555555;">Thomas H. <a href="http://www.bibsonomy.org/author/Cormen">Cormen</a> and Clifford <a href="http://www.bibsonomy.org/author/Stein">Stein</a> and Ronald L. <a href="http://www.bibsonomy.org/author/Rivest">Rivest</a> and Charles E. <a href="http://www.bibsonomy.org/author/Leiserson">Leiserson</a> </span><em>McGraw-Hill Higher Education, </em>(<em>2001</em>)Mon Jun 30 18:06:50 CEST 2008Introduction to Algorithms2001recommended_by_GW algorithm Algorithmic Markov chains with almost exponential hitting timeshttp://www.bibsonomy.org/bibtex/2886b55d3cee112cd5e079167488575d5/gwplgwpl2008-04-03T19:13:04+02:00Algorithmic <span style="color:#555555;">David J. <a href="http://www.bibsonomy.org/author/Aldous">Aldous</a> </span><em>Stochastic Processes and their Applications</em><em>13(3):305--310</em><em>#sep#1982. </em>Thu Apr 03 19:13:04 CEST 2008Stochastic Processes and their Applications#sep#3305--310Markov chains with almost exponential hitting times131982Algorithmic If a Markov chain converges rapidly to stationarity, then the time until the first hit on a rarely-visited set of states is approximately exponentially distributed; moreover an explicit bound for the error in this approximation can be given. This complements results of Keilson.