1997 CS Technical Reports

• CS0890 Eli Biham: Cryptanalysis of Ladder-DES
• CS0891 Eli Biham: A Fast New DES Implementation in Software
• CS0892 Azaria Paz: A Theory of Decomposition into Prime Factors of Layered Interconnection Networks
• CS0893 E. Kantorowitz, A. Guttman and L. Arzi: The Performance of the N-Fold Requirement Inspection Method
• CS0894 Shai Ben-David and Ami Litman: Combinatorial Variability of Vapnik-Chervonenkis Classes
• CS0895 Ye. Dinitz, T. Eilam, Sh. Moran, and Sh. Zaks: On the Total$_k$-Diameter of Connection Networks
• CS0897 Shlomo Moran and Sagi Snir: Simple and Efficient Network Decomposition and Synchronization
• CS0898(*) U. Zrahia, S.A. Orszag, and M. Israeli: Hybrid Spectral Element/Asymptotic Method for Boundary Layers Problems
• CS0899(*) Uri Zrahia, Steve Orszag, Moshe Israeli: Effect of Boundary Conditions in Legendre Spectral Methods
• CS0900 Vitaly Skachek, Tuvi Etzion, Ron M. Roth: Efficient Encoding Algorithm for Third-Order Spectral-Null Codes
• CS0901(*) Avram Sidi: IMPROVING THE ACCURACY OF QUADRATURE METHOD SOLUTIONS OF FREDHOLM INTEGRAL EQUATIONS THAT ARISE FROM NONLINEAR TWO-POINT BOUNDARY VALUE PROBLEMS
• CS0902(*) Avram Sidi: FURTHER CONVERGENCE AND STABILITY RESULTS FOR THE GENERALIZED RICHARDSON EXTRAPOLATION PROCESS GREP$^{(1)}$ WITH AN APPLICATION TO THE $D^{(1)}$-TRANSFORMATION FOR INFINITE INTEGRALS
• CS0903(*) Karen Laster and Orna Grumberg: Compositional Model Checking of Software
• CS0904(*) Yuval Ishai and Eyal Kushilevitz: Protecting Data Privacy in Private Information Retrieval Schemes
• CS0905 T. Eilam, S. Moran and S. Zaks: The Complexity of the Characterization of Networks Supporting Shortest-Path Interval Routing
• CS0906(*) E. Kushilevitz and R. Ostrovsky: Replication Is NOT Needed: A SINGLE Database, Computational PIR
• CS0907 Felix Geller and Eyal Kushilevitz: The Query Complexity of Finding Local Minima in the Lattice
• CS0908 Claudson F. Bornstein, Ami Litman, Bruce M. Maggs, Ramesh K. Sitaraman and Tal Yatzkar: On the Bisection Width and Expansion of Butterfly Networks
• CS0909(*) Tuvi Etzion and Patric R.J. Ostergard: Greedy and Heuristic Algorithms for Codes and Colorings
• CS0910 Eli Biham, Adi Shamir: Differential Fault Analysis of Secret Key Cryptosystems
• CS0911 A. Cohen, Y. Rabinovich, A. Schuster, and H. Shachnai: Optimal Bounds on Tail Probabilities - A Simplified Approach
• CS0912 David H. Lorenz: Tiling Design Patterns - A Case Study using the Interpreter Pattern
• CS0913 Yefim Dinitz: Constant Absolute Error Approximation Algorithm for the ``Safe Deposit Boxes'' Problem
• CS0914(*) Gideon Kaempferand Reuven Cohen: A TCP-Based Approach for Reliable Multicast
• CS0915 Yefim Dinitz and Zeev Nutov: A $2$-level cactus tree model for the system of minimum and minimum+1 edge cuts of a graph and its incremental maintenance
• CS0916(*) Avran Sidi: Numerical Differentiation, Polynomial Interpolation, and Richardson Extrapolation
• CS0917(*) Benny Chor and Niv Gilboa: Private Information Retrieval by Keywords
• CS0918(*) A. Biryukov and E. Kushilevitz: Improved Cryptanalysis of RC5
• CS0919 Eliezer Kantorowitz, Lior Arzi and Assaf Harel: A Study of Optimal Requirements Inspection Team Size
• CS0920 Reuven Bar-Yehuda: One for the Price of Two: A Unified Approach for Approximating Covering Problems
• CS0921 Yefim Dinitz and Alek Vainshtein: The general structure of edge-connectivity of a vertex subset in a graph and its incremental maintenance . Odd case
• CS0922 Alex Gontmakher and Assaf Schuster: Java Consistency = Causality + Coherency. Non-Operational Characterizations for the Java Me mory Behavior.
• CS0923 Hagit Attiya and Hadas Shachnai: IDA-Based Protocols for Reliable Multicast
• CS0924 Hagit Attiya and Sergio Rajsbaum: The Combinatorial Structure of Wait-free Solvable Tasks
• CS0925(*) Tuvi Etzion, Ari Trachtenberg, Alexander Vardy: Which Codes Have Cycle-Free Tanner Graphs?