2011 CS Technical Reports

• CS-2011-01 Irad Yavneh and Marion Bendig: Nonsymmetric Black Box Multigrid with Coarsening by Three: Analysis and Numerical Results
• CS-2011-02 A. Paz: Probabilistic Arrays
• CS-2011-03 Orna Agmon Ben-Yehuda, Assaf Schuster, Artyom Sharov, Mark Silberstein, Alexandru Iosup: ExPERT: Pareto-Efficient Task Replication on Grids and Clouds
• CS-2011-04 Fanica Gavril: Algorithms for maximum induced multicliques and complete multipartite subgraphs in polygon-circle graphs
• CS-2011-05 Fanica Gavril: Some NP-complete problems on graphs
• CS-2011-06 Hagit Attiya and Eshcar Hillel: A Single-Version STM that is Multi-Version Permissive
• CS-2011-07 Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom and Shmuel Zaks: Optimizing Regenerator Cost in Traffic Grooming
• CS-2011-08 Royi Ronen and Oded Shmueli: Programmable Protocols for Social Networks
• CS-2011-09 Orna Agmon Ben-Yehuda, Muli Ben-Yehuda, Assaf Schuster, Dan Tsafrir: Deconstructing Amazon EC2 Spot Instance Pricing
• CS-2011-10 Inbal Horev, Ori Bryt and Ron Rubinstein: Adaptive Image Compression Using Sparse Dictionaries
• CS-2011-11 Fanica Gavril: Maximum induced multicliques and complete multipartite subgraphs in polygon-circle graphs and circle graphs
• CS-2011-12 Fanica Gavril: Algorithms on 2-Acyclic-Subtree Filament Graphs
• CS-2011-13 Eliyahu Osherovich, Michael Zibulevsky, and Irad Yavneh: Phase retrieval combined with digital holography
• CS-2011-14 Eliyahu Osherovich, Michael Zibulevsky, and Irad Yavneh: Designing reference beam for phase retrieval