1984 CS Technical Reports
- CS0310
Zvi Rosberg:
A Decentralized 'cu' Protocol for a Local Area Network
- CS0311
Micha Hofri and Zvi Rosberg:
Optimally Controlled CCD Shift Registers (Optimal Interception of a Recurrent Trajectory)
- CS0312
O. Shmueli and A. Itai:
Complexity of Views: Tree and Gyclic Schemas
- CS0313
Shlomo Moran:
A Ramsey-Theorem Based Technique for Proving Lower Bounds on Decisions Trees
- CS0314
Shmuel Katz:
Mutations and Test for VLSI Chips
- CS0315
T. Etzion and A. Lempel:
An Efficient Algorithm for Generating Linear Transformations in a Shufflf-Exchange Network
- CS0316
Tuvi Etzion:
An Algorithm for Constructing m-ary De Bruijn Sequences
- CS0317
H. Boral and I. Gold:
Towards a Self-Adapting Centralized Control Algorithm
- CS0318
Zvi Rosberg:
Deterministic Routing to Buffered Channels
- CS0319
Victor Markowitz:
Relational Algebra Revisited: Toward an Object-Predicate Oriented Relational Model
- CS0320
E. Dahlhaus, A. Israeli and J.A. Makowsky:
On the Existence of Polynomial Time Algorithms for Interpolation Problems in Propositional Logic
- CS0321
Y. Gold and S. Moran:
Estimating Topological Change in Fully Connected Mobile Networks - A Least Upper Bound on the Worst Case
- CS0322
E. Kanotoriwitz and H. Laor:
Automatic Generation of Useful Syntax Error Messages
- CS0324
Micha Hofri and Sami Kamhi:
A Stochastic Analysis of the NFD Bin Packing Algorithm
- CS0326
J.A. Makowsky and M.Y. Vardi:
On the Expressive Power of Data Dependencies
- CS0327
Shay Kutten:
A Unified Approach to the Construction of Efficient Distributed Leader Finding Algorithms
- CS0328
I. Chlamtac and S. Kutten:
An Efficient Broadcast Protocol Embedded in Multi-Hop Radio Networks
- CS0329
J.A. Makowsky:
Why Horn Formulas Matter in Computer Science: Initial Structures and Generic Examples
- CS0330
Shmuel Katz and Oded Shmueli:
Cooperative Distributed Algorithms for Dynamic Cycle Prevention
- CS0331
S. Even, O. Goldreich and A. Lempel:
A randomized protocol for signing contracts
- CS0332
G. Talilienfeld and N. Francez:
Proof Rules for Communication Abstractions
- CS0333
A. Israeli and Y. Shiloach:
An Improved Maximal Matching Parallel Algorithm
- CS0334
E. Korach, S. Moran and S. Zaks:
The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors
- CS0335
A. Israeli and A. Itai:
A Fast and Simple Randomized Parallel Algorithm for Maximal Matching
- CS0336
R.M. Roth and G. Seroussi:
On Generator Matrices Of MDS Codes
- CS0337
O. Shmueli , S. Tsur , and H. Zfira:
Rule Supporting in Prolog
- CS0338
I. Gold and H. Boral:
The Power of the Private Workspace Model
- CS0339
A Israeli and Y. Shiloach:
Sparse-Matrix Multiplication: a Simple and Efficient Parallel Algorithm
- CS0340
S. Porat and N. Francez:
Fairness in Context-Free Grammars under Canonical Derivations
- CS0341
S. Moran:
An Inprovement of an Algorithm for Construction of Edge Disjoint Branchings
- CS0342
A. Mendelson and G.M. Silberman:
The "Moving-Target" Cache - A New Approach to Prefetching
- CS0343
Yoav Raz:
On the Nonclosure of the EOL Class Under Erasing Homomorphism
- CS0344
Ron M. and Gadiel Seroussi:
On Cyclic MDS Codes of Length q Over GF(g)
- CS0345
S. Moran , M. Snir and U. Manber:
Applications of Ramsey's Theorem to Decision Trees Complexity
- CS0346
Moshe Israeli:
Numerical Simulation of Thermocapillar Convection in a Rapidly Rotating Liquid Cylinder
- CS0347
William F. Ford and Avram Sidi:
An Algorithm for a Generalization of the Richardson Extrapolation Process
- CS0348
Zvi Rosberg:
A Hybrid Access Method in Multiple Access Channel
- CS0349
P. Erdos, N. Linial and S. Moran:
Extremal Problems on Permutations Under Cyclic Equivalence
To the main CS technical reports page