1996 CS Technical Reports
- CS0876(*)
Eyal Kushilevitz:
A Simple Algorithm for Learning O(log n)-Term DNF
- CS0877(*)
Avram Sidi:
KRYLOV SUBSPACE METHODS FOR EIGENVALUES WITH SPECIAL PROPERTIES AND THEIR ANALYSIS FOR NORMAL MATRICES
- CS0878(*)
Amos Beimel and Eyal Kushilevitz:
On the Learnability of Multiplicity Automata
- CS0879(*)
Nader H. Bshouty and Eyal Kushilevitz:
On Learning Exclusive-Or of Terms
- CS0880(*)
Y. Hollander and A. Itai:
A $(4k+1)$-Competitive Algorithm for the $k$-server with fixed cost excursion problem
- CS0881
T. Eilam, S. Moran and S. Zaks:
A Lower Bound for Linear Interval Routing
- CS0882(*)
O Sharon and A. Segall:
Models for Address Distribution and Session Management in Broadcast Networks with Dynamic Addresses (Revised version of TR #589, October 1989)
- CS0883(*)
A. Beimel and E. Kushilevitz:
Learning Boxes in High Dimension
- CS0884
Eli Biham:
How to Forge DES-Encrypted Messages in $2^{28}$ Steps
- CS0885
Eli Biham:
Cryptanalysis of Triple-Modes of Operation
- CS0886(*)
Ye. Dinitz and Z. Nutov:
Finding minimum weight $k$-vertex connected spanning subgraphs: approximation algorithms with factor 2 for $k=3$ and factor 3 for $k=4,5$
- CS0887(*)
A. Biryukov and S. Even:
Cryptanalysis of the Portz Interconnection-Network Block-Cipher
- CS0888
Shlomo Moran and Lihu Rappoport:
On the Robustness of h^r_m
- CS0889
Daniel M. Berry and Matthias Weber:
A Pragmatic, Rigorous Integration of Structural and Behavioral Modeling Notations
(*) An electronic copy does not exist in this server
To the main CS technical reports page