1988 CS Technical Reports
This is a partial list of scanned reports. Other reports are not yet scanned
- CS0486
S. Moran. I. Newman and Y. Wolfstahl:
Approxtmation Algorithms for Covering Graph by Vertex-Disjoint Paths of Maxulum Toal Weight
- CS0487
M. Tiomkin and M. Kaminski:
Nonmonotonic Default Modal Logics
- CS0488
Tuvi Etzion:
On Pseudo-random Arrays Constructed from Patterns with Distinct Differences
- CS0489
Tuvi Etzion:
On the Shffle-Exchange Network as a Permutations Generator
- CS0490
Ron M. Roth and Abraham Lempel:
On MDS Codes via Cauchy Matrices
- CS0491
Micha Hofri:
Reduced State-Spaoe Heuristics for Symmetric Markovian Queueing Systems
- CS0492
G. Taubenfeld, S. Katz and S. Moran:
Impossibility Results in the Presence of Multiple Faulty Processes
- CS0493
L. Babai and S. Moran:
Proving Properties of Interactive Proofs by a Generalized Counting Technique
- CS0494
O. Goldreich, R. Krawczyk and M. Luby:
On the Existence of Pseudo-Random Generators
- CS0495
J. Malka, S. Moran and S. Zaks:
Analysis of a Distributed Scheduler for Communication Networks
- CS0496
Michael Tiomkin:
Probabilistic Termination Versus Fair Termination
- CS0497
D. Speinwald, A. Lempel and J. Ziv:
Compression of Pictures by Finite State Encoders
- CS0498
O. Goldreich, S. Micali and A. Wigderson:
Proofs that Yield Nothing But their Validity or All Languages in NP Have Zero-Knowledge Proofs
- CS0499
R. Renous, G.M. Silberman, I. Spillinger:
Whistle - A Workbench for Test Generation using a High Level Design Description
- CS0500
S. Even and O. Goldreich:
The Deadlock Problem in Computing and Communications Systems - An Annotated Bibliography
- CS0501
Shlomo Moran and Yaron Wolfstahl:
Optimal Covering of Cacti By Vertex-Disjoint Paths
- CS0502
P. Erdos, I. Koren, S. Moran, G.M. Silberman and S. Zaks:
Minimum-Diameter Cyclic Arrangements in Mapping Data Flow Graphs onto VLSI Arrays
- CS0503
G.M. Silberman and I. Spillinger:
Riddle: A Foundation for Test Generation on a High Level Design Description
- CS0504
Ameen Abu-Hanna and Yaron Gold:
An Integrated, Deep-Shallow Expert System for Multi-Level Diagnosis of Dynamic Systems
- CS0505
Shmuel Katz and Doron Peled:
Interleaving Set Temporal Logic
- CS0506
Gadi Taubenfeld:
Impossibility Results for Decision Protocols (Revised Version of TR 1445)
- CS0507
Oded Goldreich:
Towards a Theory of Average Case Complexity (A Survey)
- CS0508
E. Korach and Z. Ostfeld:
On the Possibilities of DFS Tree Constructions: Sequential and Parallel Algorithms
- CS0509
R.M. Roth and A. Lempel:
A Construction of Non-GRS MDS Codes
- CS0510
Avram Sidi:
Quantitative and Constructive Aspects of the Generalized Koenig's and De Montessus's Theorems for Pade Approximants
- CS0511
Tuvi Etzion:
Construction of Error-Correcting DC Free Block Codes
- CS0512
S. Even and S. Rajsbaum:
Unison in Distributed Networks
- CS0513
A. Lavie, A. Itai, .U. Ornan and M. Rimon:
On the Applicabtlity of Two Level Morphology to the Inflection of Hebrew Verbs
- CS0514
Stephen Cook and Gloria Kissin:
Energy Bounds on Parity
- CS0515
E. Korach and Z. Ostfeld:
DFS Tree Construction: Algorithms and Characterizations (Extended Version of TR #470)
- CS0516
Ouri Wolfson:
Logic Programs and a New Approach to Parallelism
- CS0517
G. Taubenfeld, S. Katz and S. Moran:
Initial Failures In Distributed Computations
- CS0518
D. Goldfeld and T. Etzion:
UPP Graphs And UMFA Networks - Architecture for Parallel Systems
- CS0519
E. Korach and Z. Ostfeld:
Hamiltonian and Degree Restricted DFS Trees
- CS0520
E. Korach and Z. Ostfeld:
Recognition of DFS Trees: Sequential and Parallel Algorithms with Refined Verifications
- CS0521
E. Korach and M. Penn:
Tight Integral Duality Gap in the Chinese Postman Problem
- CS0522
S. Even and S. Rajsbaum:
Lack of Global Clock Does Not Slow Down the Computation in Distributed Networks
- CS0523
Simona Cohen and Ouri Wolfson:
Why' Single Paaallelization Strategy is Not Enough in Knowledge Bases
- CS0524
M. Hofri and H. Shachnai:
Self-Organizing Lists and Independent References - A Statistical Synergy
- CS0525
H.L. Bodlaender, S. Moran and M.F. Warmuth:
The Distribured Bit Complexity of the Ring: From the Anonymous to the Non-Nnonymous Case
- CS0526
E. Kantorowitz and O. Sudrsky:
Tile Adaptable User Interface
- CS0527
Micha Hofri:
Analyzing a Packet Switch as a Non-Conservative Exhaustive-Service Polling System I: Cycle-Time and Capacity Analysis
- CS0528
R. Bar-Yehuda and T. Etzion:
Connectlons Between Two Cycles - A New Design of Dense Processor Inteaconnection Networks
- CS0529
Avram Sidi:
On Extensions of the Power Method for Normal Operators
- CS0530
Avram Sidi:
On a Generalization of the Richardson Extrapolation Process
- CS0531
Oded Goldreich:
Towards a Theory of Average Case Complexity
- CS0532
I. Reicher and M. Yoe1i:
Net-Based Modeling of Communicating Parallel Processes With Applications to VLSI Design
- CS0533
Hugo Krawczyk:
How to Predict Congruential Generators
To the main CS technical reports page