au Aarhus University ANNUAL REPORT 2009

First Page		Document Content
Date: 2014-01-20 05:49:01 Mathematics Cache Models of computation Cache-oblivious algorithm Algorithms Computational complexity theory Asymptotically optimal algorithm Parallel computing Database Theoretical computer science Applied mathematics Analysis of algorithms		au Aarhus University ANNUAL REPORT 2009 Add to Reading List Source URL: madalgo.au.dk Download Document from Source Website File Size: 3,37 MB Share Document on Facebook

	Asymptotically Optimal Algorithm for Stochastic Adwords Nikhil R. Devanur, Microsoft Research Balasubramanian Sivan, University of Wisconsin-Madison Yossi Azar, Tel-Aviv University In this paper we consider the adwords DocID: 1sXji - View Document
	Optimizing TTL Caches under Heavy-Tailed Demands Andrés Ferragut Ismael Rodríguez Fernando Paganini DocID: 1rqor - View Document
	Trade-offs between Selection Complexity and Performance when Searching the Plane without Communication∗ Christoph Lenzen Nancy Lynch DocID: 1qqb7 - View Document
	Optimizing TTL Caches under Heavy-Tailed Demands Andrés Ferragut Ismael Rodríguez Fernando Paganini DocID: 1q6LF - View Document
	CS264: Beyond Worst-Case Analysis Lecture #2: Instance-Optimal Geometric Algorithms∗ Tim Roughgarden† September 24, DocID: 1pPTu - View Document