<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2012-10-11 21:49:50Analysis of algorithms Probabilistic complexity theory Parallel computing Reconfigurable computing Systolic array Randomized algorithm Algorithm Time complexity Computational geometry Theoretical computer science Computational complexity theory Applied mathematics |
| 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 |