1989 CS Technical Reports
This is a partial list of scanned reports. Other reports are not yet scanned
- CS0534
Avram Sidi:
Comparison of Some Numerical Quadrature Formulas for Weakly Singular Periodic Fredholm Integral Equations
- CS0535
R.M. Roth and A. Lempel:
Application of Circulant Matrices to the Construction and Decoding of Linear Codes
- CS0536
Zvi Rosberg:
Ergodicity of Queueing Networks With Several Customer Classes and Arbitrary Work-Conserving Scheduling
- CS0537
R. Bar-Yehuda, A. Israeli, A. Itai:
Multiple Communication in Multi-Hop Radio Networks
- CS0538
Z. Rosberg and H.R. Gail:
ASTA Implies an M/G/1-Like Load Decomposition for a Server With Vacations
- CS0539
T. Etzion and I. Bar-David:
An Explicit Construction of Euler Cirguits in Shuffle Nets and Related Networks
- CS0540
Avram Sidi:
Application of Vector Extrapolation Methods to Consistent Singular Linear Systems
- CS0541
R. Bar-Yehuda and E. Ben-Chanoch:
Covering Polygons With Squares
- CS0542
M. Israeli and M.J. Shelley:
A Product Integration Method for Vortex Dynamics in Two and Three Dimensions
- CS0543
M. Yoeli and I. Reicher:
Synthesis of Delay-Insensitive Circuits Based on Marked Graphs
- CS0544
O. Goidreich, S. Micali and A. Wigderson:
Proofs That Yield Nothing But Their Validity or All Languages in NP Have Zero-Knowledge Proofs
- CS0545
A. Sidi and W. F. Ford:
Quotient-Difference Type Generalizations of Tile Power Method and Their Analysis
- CS0546
G. Matsliach and O. Shmueli:
Distributing a B+ Tree in a Loosely Coupled Environment
- CS0547
S. Moran and Y. Wo1fstah1:
One-Page Book Embedding Under Vertex Neighborhood Constraints
- CS0548
Ido Dagan and Alon Itai:
Semantic Disambiguation in MT: a Prototype and Its Consequences
- CS0549
A. Boneh and M. Hofri:
The Coupon-Collector Problem Revisited
- CS0550
S. Ben-David, G.M. Benedek and Y. Mansour:
Tile Passive Student is Really Weaker (A Parametrization Scheme for Classifying Models of Learnability)
- CS0551
O. Wolfson and A. Segal:
Communication Cost and Time of Commitment Algorithms
- CS0552
S. Moran and Y. Wolfstahl:
Two-Page Book Embedding of Trees Under Vertex-Neighborhood Constraints
- CS0553
O. Goldreich and H. Krawczyk:
Sparse and Evasive Pseudorandom Distributions
- CS0554
Eya1 Kushilevitz:
Privacy and Communication Complexity
- CS0555
Z. Rosberg and P. Kermani:
Customer Scheduling Under Queueing Constraints
- CS0556
Jacob Ukelson:
A Protocol for Efficient Man-Machine Interfaces (also Research Thesis)
- CS0557
Ida Dagan and Alan Itai:
A Set Expression Based Inheritance System
- CS0558
M. Hofri and Y. Kogan:
Exact and Asymptotic Analysis of Large Multiple-Bus Multiprocessor Systems
- CS0559
E. Korach and A. Tal:
General Vertex Disjoint Paths in Series-Parallel Graphs
- CS0560
R.M. Roth and G.M. Benedek:
Interpolation and Approximation of Light Boolean Functions
- CS0561
S. Rabinovici Cohen and O. Wolfson:
Why A Single Parallelization Strategy is Not Enough in Knowledge Bases
- CS0562
Gyora M. Benedek:
Problems in Computerized Learnability
- CS0563
O. Goldreich, A. Herzberg and Y. Mansour:
Source To Destination Communication in the Presence of Faults
- CS0564
Ouri Wolfson:
Parallel Bottom-Up Evaluation of Datalog Program By Load Sharing
- CS0565
M. Kaminski and A. Sidi:
Solution of an Integer Programming Problem Related to Convergence of Rows of Pade Approximants
- CS0566
R. Canetti, A. Herzberg, B. Pinkas:
Distributed Computing Simulator
- CS0567
R.M. Roth and A. Lempel:
t-Sum Generators of Finite Abelian Groups
- CS0568
Oded Goldreich:
A Uniform Complexity Treatment of Encryption and Zero-Knowledge
- CS0569
A. Rahat, N. Francez, O. Shmueli:
SDP Programmer's Manual and User Guide
- CS0570
O. Goldreich and H. Krawczyk:
On the Composition of Zero-Knowledge Proof Systems
- CS0571
Ouri Wolfson:
The Data Reduction Paradigm for Parallelization in Knowledge Bases
- CS0572
L. Fournier and Z. Rosberg:
Exptected Waiting Times in Cyclic Service Systems Under Priority Disciplines
- CS0573
Oded Goldreich:
Foundations of Cryptography: List of References
- CS0574
Nader H. Bshouty:
On the 2x2 Matrix Multiplication
- CS0575
Nader H. Bshouty:
Multiplicative Complexity of Direct Sum of Quadratic Systems
- CS0576
Nader H. Bshouty:
Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains
- CS0577
Nader H. Bshouty:
Maximal Rank of mXnX(m n-k) Tensors
- CS0578
N.H. Bshouty and G. Seroussi:
Generalizations of the Normal Basis Theorem of Finite Fields
- CS0579
Nader H. Bshouty:
A Lower Bound for Matrix Multiplication
- CS0580
Nader H. Bshouty:
Tile Direct Sum Conjecture in the Straight Line Model
- CS0581
E. Korach. S. Kutten. S. Moran:
A Modular Technique for the Design of Efficient Distributed Leader Finding Algorithms
- CS0582
E. Korach and Z. Ostfe1d:
Recognition of DFS Trees: Sequential and Parallel Algorithms with Refined Verifications
- CS0583
Nader H. Bshouty:
Lower Bounds For the Complexity of Functions in Random Access Machines
- CS0584
Yosefa Goldenberg and Yaron Gold:
An Expert System Prototype for "Textbook Solution" Generation and for Trainee Performance Evaluation In Naval Tactical Trainers
- CS0585
E. Korach, N. Sole1 and A. Tal:
On Disjoint Paths Problems in Graphs With Bounded Tree Width
- CS0586
G. Taubenfeld, S. Katz, and S. Moran:
Impossibility Results in The Presence of Mpltiple Faulty Processes
- CS0587
Y. Reshef and A. Segall:
Reliable Multilink Protocols
- CS0588
D. Cohen and T. Etzion:
Row-Complete Latin Squares Which Are Not Column-Complete
- CS0589
O. Sharon and A. Segall:
Models For Address Distribution and Session Management in Broadcast Networks with Dynamic Addresses
- CS0590
S. Dolev, A. Israeli and S. Moran:
Self Stabilization of Dynamic Systems Assuming Only Read/Write Atomicity
- CS0591
A. Itai, S. Kutten, Y. Wolfstahl, and S. Zaks:
Optimal Distributed t-Resilient Election in Complete Networks
- CS0592
S. Ayoun and Z. Rosberg:
Optimal Routing to Two Parallel Heterogeneous Servers with Resequencing
- CS0593
S. Ben-David and Y. Gafni:
All We Believe Fails in Impossible Worlds: A Possible-World Semantics For a "Knowing At Most" Operator
- CS0594
G. Matsliach and O. Shmueli:
Methods For Distributing A B+ Tree in a Loosely Coupled Environment
- CS0595
R. Bar-Yehuda and Y. Ben-Chanoch:
Covering Polygons With Squares
- CS0596
R. Bar-Yehuda and S. Fogel:
Maximal Sets of K-increasing Subseouences with Applications To Counting Points in Triangles
- CS0597
Y. Reshef and A. Segall:
A Balanced Multilink Protocol
- CS0598
S. Ben-David and S. Shelah:
The Two-Cardinals Transfer Property and Resurrection of Supercompactness
- CS0599
Y. Pnueli, N. Kiryati, A.M. Bruckstein:
Navigating In Moving Influence Fields
- CS0600
R. Cohen and A. Segall:
An Efficient Reliable Ring Protocol
To the main CS technical reports page