First Page | Document Content | |
---|---|---|
Date: 2013-11-25 11:07:00Computational complexity theory Mathematics Graph theory Analysis of algorithms Online algorithms Edsger W. Dijkstra Network theory Probabilistic complexity theory Randomized algorithm Algorithm Distributed computing Shortest path problem | Page Migration with Limited Local Memory Capacity Susanne Albers? Hisashi Koga??Add to Reading ListSource URL: www14.in.tum.deDownload Document from Source WebsiteFile Size: 194,86 KBShare Document on Facebook |
Probabilistic Modeling and Model Checking Erika Ábrahám RWTH Aachen University, Germany SFM’14 Tutorial June 17, 2014DocID: 1rrqu - View Document | |
Randomization, random walks, derandomization, expansion April 12, L´ aszl´ o Babai. Monte Carlo algorithms in graph isomorphism testing.DocID: 1rgOi - View Document | |
ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro CorettiDocID: 1rgbF - View Document | |
Master thesis ANALYSIS OF A SIMPLE METHOD TO APPROXIMATE THE EXPECTED STATE OF A MARKOV CHAIN ByDocID: 1rdMz - View Document | |
Locally Random Reductions: Improvements and Applications D. Beavery J. Feigenbaumz J. Kilianx September 1, 1995DocID: 1raDV - View Document |