<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2014-12-28 08:41:16Analysis of algorithms Time complexity Randomized algorithm Algorithm Adversary model Decision tree model Big O notation Binary search algorithm NP Theoretical computer science Applied mathematics Computational complexity theory |
 | Probabilistic Modeling and Model Checking Erika Ábrahám RWTH Aachen University, Germany SFM’14 Tutorial June 17, 2014DocID: 1rrqu - View Document |
 | Spheres of Influence for More Effective Viral Marketing Yasir Mehmood Francesco Bonchi David García-SorianoDocID: 1riqm - View Document |
 | Competitive Online Algorithms Susanne Albers Overview arrive one by one and must be scheduled immediatelyDocID: 1ri9G - View Document |
 | Computing the Width of a Point Set in 3-Spa e Thomas Herrmann Institute for Theoreti al Computer S ien e Institute for Operations Resear hDocID: 1rhdY - View Document |
 | Master thesis ANALYSIS OF A SIMPLE METHOD TO APPROXIMATE THE EXPECTED STATE OF A MARKOV CHAIN ByDocID: 1rdMz - View Document |