2000 CS Technical Reports
- CS-2000-01
Eli Biham:
Cryptanalysis of Patarin's 2-Round Public Key System with S Boxes (2R)
- CS-2000-02
Michael Yoeli and Emil Dan Kohn:
Petrify-Based Verification of Asynchronous Circuits - Three Case Studies
- CS-2000-03
Karen Yorav, Orna Grumberg:
Static Analysis for State-Space Reductions Preserving Temporal Logics
- CS-2000-04
Doron Bustan and Orna Grumberg:
Simulation Based Minimization
- CS-2000-05
T. Eilam, S. Moran, S. Zaks:
Approximation Algorithms for Survivable Optical Networks
- CS-2000-06
Ronny Lempel and Shlomo Moran:
The Stochastic Approach for Link-Structure Analysis (SALSA) and the TKC Effect
- CS-2000-07
Shai Ben-David and Hans Ulrich Simon:
Efficient Agnostic Learning of Linear Perceptrons
- CS-2000-08
Magnus M. Halldorsson, Guy Kortarz and Hadas Shachnai:
Resource-Constrained Scheduling and Graph Multicoloring with Min-sum Objectives
- CS-2000-09
Noam Rinetzky, Mooly Sagiv:
Interprocedual Shape Analysis for Recursive Programs
- CS-2000-10
Reuven Bar-Yehuda and Dror Rawitz:
On the Equivalence Between the Primal-Dual Schema and the Local-Ratio Technique
- CS-2000-11
Adnan Agbaria and Roy Friedman:
Virtual Machine Based Heterogeneous Checkpointing
- CS-2000-12
Roy Friedman and Svetlana Rubanovich:
Probabilistic Scalable Application Placement in Distributed Systems
- CS-2000-13
Doron Bustan and Orna Grumberg:
Checking for Fair Simulation in Models with Buchi Fairness Constraints
To the main CS technical reports page