Mahmoud Fouz
| Address: | Universität des Saarlandes Informatik Postfach 151150 66041 Saarbrücken Germany |
| Office: | Building E1 3, Room 422 |
| Phone: | +49 681 302-5502 |
| Email: | "mfouz" at "cs.uni-saarland.de" |
| |
Publications
| [P13] |
Why Rumors Spread Fast in Social Networks. Communications of the ACM, To appear. |
| [P13] |
Asymptotically Optimal Randomized Rumor Spreading International Colloquium on Automata, Languages and Programming (ICALP 2011), 2011. |
| [P12] |
Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes International Colloquium on Automata, Languages and Programming (ICALP 2011), 2011. |
| [P11] |
Sharp Bounds by Probability-Generating Functions and Variable Drift Genetic and Evolutionary Computation Conference (GECCO 2011), 2011. |
| [P10] |
Social Networks Spread Rumors in Sublogarithmic Time ACM Symposium on Theory of Computing (STOC 2011), 2011. |
| [P9] |
Quasi-Random Rumor Spreading: Reducing Randomness Can Be Costly Information Processing Letters |
| [P8] |
Truthful Mechanisms for Exhibitions Workshop on Internet & Networking (WINE '10). |
| [P7] |
Approximation Algorithms for Non-Single-minded Profit-Maximization Problems with Limited Supply Workshop on Internet & Networking (WINE '10). |
| [P6] |
Quasirandom Evolutionary Algorithms Genetic and Evolutionary Computation Conference, GECCO 2009 |
| [P5] | A Time-Randomness Tradeoff for Quasi-Random Rumor Spreading. European Conference on Combinatorics, Graph Theory and Applications (EuroComb '09). |
| [P4] | BBOB: Nelder-Mead with Resize and Halfruns. Genetic and Evolutionary Computation Conference, GECCO 2009 |
| [P3] | On Smoothed Analysis of Quicksort and Hoare's Find. Computing and Combinatorics, 15th Annual International Conference, COCOON 2009 |
| [P2] | Complexity and Approximability of the Cover Polynomial to appear |
| [P1] | Hereditary Discrepancies in Different Numbers of Colors II SIAM Journal on Discrete Mathematics (Vol.24, No.3) |
Copyright Notice: The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
