1985 CS Technical Reports
This is a partial list of scanned reports. Other reports are not yet scanned
- CS0350
A. Ginzburg and M. Yoeli:
Reducibility of Syncrhonization Structures
- CS0351
M. Yoeli and A.Ginzburg:
On Parallel Programming Primitives
- CS0352
E. Schieber and S. Moran:
Parallel Algorithm for Finding Maximum Bipartite Matching and Maximum Flow in 0-1 Networks
- CS0354
L. Shrira and O. Goldreich:
Electing a Leader in the Presence of Faults: A Ring as a Special Case
- CS0355
L. Shrira and O. Goldreich:
Consultation in the Presence of Faults: Two Lower Bounds
- CS0356
Z. Shmuely:
Composite Diffie-Hellman Public-Key Generating Systems are Hard to Break
- CS0357
Y. Mond and Y. Raz:
Concurrency Control in B+ Trees Databases Using Preparatory Operations
- CS0358
I. Gold, O. Shmueli and M. Hofri:
The Private Workspace Model Feasibility and Applications to 2PL Performance Improvements
- CS0363
I. Chlamtac and A. Lerner:
A Link Allocation Protocol for Mobile Multi-Hop Radio Networks
- CS0390
R. Rinat ; N. Francez ; O. Grumberg:
Infinite trees, markings and well foundedness
- CSnonm
L. Shrira and M. Rodeh:
Methodological Construction of Reliable Distributed Algorithms
To the main CS technical reports page