2001 CS Technical Reports
- CS-2001-08
Michael Yoeli:
Examples of LOTOS-Based Verification of Asynchronous Circuits
- CS-2001-09
Michael Yoeli and Abraham Ginzburg:
LOTOS/CADP-based verification of asynchronous circuits
- CS-2001-10
Michael Yoeli:
Introduction to Digital Circuit Verification
- CS-2001-11
Shirley Halevy, Ron M. Roth:
Parallel constrained coding with application to two-dimensional constraints
- CS-2001-12
Ami Litman, Shiri Moran-Schein:
Fast, minimal and oblivious routing algorithms on the mesh with bounded queues
- CS-2001-14
Eli Biham, Orr Dunkelman, Nathan Keller:
The Rectangle Attack - Rectangling the Serpent
- CS-2001-15
Micah Adler, Adi Ros\'{e}n:
Tight Bounds for the Performance of Longest in System on DAGs
- CS-2001-16
M. Yoeli:
Decompositions of Asynchronous Circuits
- CS-2001-17
Ari Freund, Joseph (Seffi) Naor:
Approximating the Advertisement Placement Problem
- CS-2001-18
Gitit Ruckenstein and Ron M. Roth:
Bounds on the list-decoding radius of Reed-Solomon codes
- CS-2001-19
Zvi Lotker, Boaz Patt-Shamir, Adi Ros\'{e}n:
A Rate Threshold for Stability in Adversarial Queuing Theory
- CS-2001-20
Azaria Paz:
A Theory of Decomposition into Prime Factors of Layered Interconnection Networks
- CS-2001-21
Asnat Dadon-Elichai, Danny Raz:
The Security Communication tradeoff in Mobile Computing
- CS-2001-22
Ronny Lempel and Shlomo Moran:
Rank-Stability and Rank-Similarity of Web Link-Based Ranking Algorithms
To the main CS technical reports page