1987 CS Technical Reports
- CS0443
Avram Sidi:
A User-Friendly Extrapolation Method for Oscillatory Infinite Integrals
- CS0444
R.M. Roth and G. Seroussi:
Encoding and Decoding of BCH Codes using Light and Short Codewords
- CS0445
Gadi Taubenfeld:
Impossibility Results for Decision Protocols
- CS0446
Hagit Attiya, Nicola Santoro and Shmuel Zaks:
From Rings to Complete Graphs - THETA(nlogn) to THETA(n) Distributed Leader Election
- CS0447
R.M. Roth and A. Lempel:
Composition of Reed-Solomon Codes and Geometric Designs
- CS0448
V.M. Markbwitz and J.A. Makowsky:
Incremental Reorganization of Relational Databases
- CS0449
S. Moran and M.K. Warmuth:
Gap Theorems for Distributed Computation
- CS0450
A. Sidi and J. Bridger:
Convergence and Stability Analyses for Some Vector Extrapolation Methods in the Presence of Defective Iteration Matrices
- CS0451
Micha Hofri:
A Feedback-Less Distributed Broadcast Algorithm for Multihop Radio Networks with Time-Varying Structure
- CS0452
Eran Grey:
The Super-Magic Implementation Method for Datalog Programs
- CS0453
Z. Harpaz and S. Zaks:
Sense of Direction in Complete Distributed Networks
- CS0454
E. Dahlhaus and J.A. Makowsky:
Computable Directory Queries
- CS0455
N. Francez and S. Katz:
Fairness and the Axioms of Control Predicates
- CS0456
S. Katz and D. Peled:
Interleaving Set Temporal Logic
- CS0457
J. A. Makowsky arid I. Sain:
Weak Second Order Characterizations of Various Program Verification Systems
- CS0458
A. Segall and O. Wolfson:
Communication Cost and Time of Commitment Algorithms
- CS0459
O. Goldreich and Y. Mansour:
Interactive Proof Systems: Provers that Never Fail and Random Selection
- CS0460
O. Goldreich:
Randomness, Interactive Proofs and Zero-knowledge (a Survey)
- CS0461
I. Chlamtac, A. Elazar and Y.I. Gold:
Highly Parallel Distributed Algorithm for Shortest Path Routing in Dynamically Reconfigurable Networks
- CS0462
A. Zehavi and A. Itai:
Three Tree-Paths
- CS0463
I. Reicher and M. Yoeli:
Net-Based Modeling and Verification of Asynchronous Circuits
- CS0464
E. Korach and M. Markowitz:
Algorithms for Distributed Spanning Tree Construction in Dynamic Networks
- CS0465
E. Korach:
On the Rank of Edmonds Polytopes
- CS0466
Ouri Wolfson and Avi Si1berschatz:
Distributed Processing Oo Logic Programs
- CS0467
Micha Hofri:
On Searching an Ordered List: Are Two Yardsticks Better than One?
- CS0468
Gyora Benedek and Alon Itai:
Learnability by Fixed Distributions (Extended Abstract)
- CS0469
G.S. Goldszmidt, S. Katz and S. Yemeni:
Interactive Blackbox Debugging for Concurrent Languages
- CS0470
Ephraim Korach and Zvi Ostfeld:
DFS Tree Construction Algorithms and Characterizations (Detailed Abstract)
- CS0471
Shai Ben-David:
The Global Time Assumption and Semantics for Concurrent Systems (Extended Abstract)
- CS0472
S. Moran and Y. Wolfstahl:
Extended Impossibility Results for Asynchronous Complete Network (Revised Version)
- CS0473
A. Milo and O. Wolfson:
Placement of Replicated Data in Computer Networks
- CS0474
Gyora M. Benedek and Alon Itai:
Nonuniform Learnability
- CS0475
Avram Sidi:
Extrapolation vs Projection Methods for Linear Systems of Equations
- CS0476
A. Milo and O. Wolfson:
Communication Cost of Managing Replicated Data (Preliminary Version)
- CS0477
Avram Sidi:
On Rates of Acceleration of Extrapolation Methods for Oscillatory Infinite Integrals
- CS0478
M. Tiomkin:
Proving Unprovability
- CS0479
Y.I. Gold and M.Y. Chen:
Burst Noise and Bit-Error Rate in Direct-Sequence Spread Spectrum Communication Systems
- CS0480
Oded Goldreich:
Zero-Knowledge and the Design of Secure Protocols (an Exposition For Engineers)
- CS0481
G.M. Benedek and A. Paz:
A Probabilistic Euclidean Althorthm that Yields Small Coefficients
- CS0482
O. Wolfson:
Sharing the Load of Logic-Program Evaluation (Preliminary Version)
- CS0483
H. Krawczyk and A. Paz:
The Diophantine Problem of Frobenius: A Close Bound
- CS0484
R. Bar-Yehuda, O. Goldreich and A. Itai:
On the Time-Complexity of Broadcast in Radio Networks: An Exponential Gap Between Determinism and Randomization
- CS0485
O. Biran, S. Moran and S. Zaks:
A Combinational Characterization of the Distributed Tasks which are Solvable in the Presence of One Faulty Processor (Extended Abstract)
To the main CS technical reports page