2012 CS Technical Reports
- CS-2012-01
Didem Gözüpek and Mordechai Shalom and Ariella Voloshin and Shmuel Zaks:
On the Complexity of Constructing Minimum Reload Cost Path-Trees
- CS-2012-02
M. Shalom, A. Voloshin, P.W.H. Wong, F.C.C. Yung, S. Zaks:
Online Optimization of Busy Time on Parallel Machines
- CS-2012-03
Lila Shnaiderman, Oded Shmueli:
Practical and Theoretical Aspects of a Parallel Twig Join Algorithm for XML Processing using a GPGPU
- CS-2012-04
Gabi Nakibly, Reuven Cohen and Liran Katzir:
On the Trade-Off between Control Plane Load and Data Plane Efficiency in Software Defined Networks
- CS-2012-05
Roy Friedman, David Sainz, and Aline C. Viana:
An Opportunistic Data Backup System for Mobile Ad Hoc Networks
- CS-2012-06
Ella Bolshinsky and Roy Friedman:
Traffic Flow Forecast Survey
- CS-2012-07
Roy Friedman, Gabriel Kliot, and:
Hybrid Distributed Consensus
- CS-2012-08
Itamar Hartstein and Mordechai Shalom and Shmuel Zaks:
On the Complexity of the Regenerator Location Problem-Treewidth and Other Parameters
- CS-2012-09
Michael Kaminski and Nissim Francez:
Relational semantics of the Lambek calculus extended with classical propositional logic
- CS-2012-10
Roy Friedman and Amit Portnoy:
A Generic Decentralized Trust Management Framework
- CS-2012-11
Yossi Kanizo, Danny Raz, Alexander Zlotnik:
Efficient Use of Geographically Spread Cloud Resources
- CS-2012-12
Ron Y. Pinter and Meirav Zehavi:
Algorithms for Topology-Free and Alignment Queries
To the main CS technical reports page