1983 CS Technical Reports
- CS0256
Alon Itai and Zvi Resberg:
A Golden Ratio Control Policy for a Multiple-Access Channel
- CS0257
I. Chlamtac and O. Ganz:
On the Design and Analysis of Multi-User Multi-Channel Systems with Centralized Control
- CS0258
S. Even and O. Goldreich:
DES-Like Functions Can Generate the Alternating Group
- CS0259
Q. Getldreich:
An Approximation Protocol for Signing Contracts
- CS0260
R. Bar-Yehuda and S. Even:
A Local-Ratio Theorm for Approximating the Weighted Vertex Cover Problem
- CS0261
Alon Itai and Michael Rodeh:
Scheduling Transmissions in a Network
- CS0262
V.M. Markowitz and Y. Raz:
Errol: An Entity-Relationship, Role Oriented, Query Language
- CS0263
V.M. Markowitz and Y. Raz:
Modifying the Relational Algebra for Use in Entity-Relationship Environment
- CS0264
Oded Goldreich:
On the Generation Power of q-ary Block Ciphers
- CS0265
D. Gordon, I. Korn and G.M. Silberman:
Embeding Tree Structures in Fault-Tolerant VLSI Hexagonal Array
- CS0266
Micha Hofri:
Stack Algoritms for Collision-Detecting Channels and their Analysis: A Limited Survey
- CS0267
R. Bar-Yehuda and.S. Moran:
An Approximation Problems Related to the Inpependent Set and Vertex Cover Problems
- CS0268
T. Etzion and A. Lempel:
On the Distribution of De Bruijn Sequences of Given Complexity
- CS0269
G. Cohen and A. Lempel:
Linear Intersecting Codes
- CS0270
J.A. Makowsky:
Model Theoretic Issues in Theoretical Computer Science, Part I: Relational Data Bases and Abstract Data Types
- CS0271
Avi Lin:
Modified Strongly Implicit Method
- CS0272
E. Korach, S. Moran and S. Zaks:
O(nlogn) Lower and Upper Bounds For A Class Of Distributed Algorithms for a Complete Network of Processors (Extended Abstract)
- CS0273
I. Chlamtac and M. Eisenger:
Voice/Data Integration on Ethernet: Backoff and Priority Considerations
- CS0274
Imre Ch1amtac and Shay Kutten:
On Broadcasting And Patial Reuse In Radio Networks - Problem Analysis And Design Of Protocols With Provable Properties
- CS0275
S. Even and Q. Goldreich:
On the Power of Cascade Ciphers
- CS0276
S. Even, O. Goldreich and Y. Yacobi:
Electronic Wallet
- CS0277
O. Ganz and I. Chlaintac:
Interconnection System Design Considerations for High Avallability Networks
- CS0278
V.M. Markowitz and Y. Raz:
Rra: A Reshaped Relational Algebra
- CS0279
V.M. Markowitz and Y. Raz:
The Semantics of Errol, an Entity-Relationship, Role Oriented, Query Language
- CS0280
Tuvi Etzion:
On the Distribution of De Bruijn Sequences of Low Complexity
- CS0281
M. Hofri and A. Konheim:
The Analysis of a Finite Quasi-Symmetric Aloha Network with Reservation
- CS0282
I. Chlamtac and W.R. Franta:
Topology Related Arbitration of a Shared Communiction Channel
- CS0283
Irit Boldo and Michael Yoe1i:
Rsducibility of Parallel Control Structures
- CS0284
Baruch Awerbuch and Shimon Even:
A Formal Apprqach to Communication-Network Protocol; Broadcast, As a Case Study
- CS0285
S. Even and O. Goldreich:
On the Security of Multi-Party Ping-Pong Protocols
- CS0286
J.A. Makowsy:
Abstract Embedding Relations
- CS0287
J .A. Makowsky:
Compactness, Embeddings and Definability
- CS0288
Haran Boral and J. DeWitt:
Database Machines: An Idea Whose Time Has Passed. A Critique of the Future of Database Machines
- CS0289
Azaria Paz:
A Geometrical Characterization of Inverse Positive Matrices
- CS0290
Azaria Paz:
A Duality Property for the Set of All Feasible Solutions to an Integer Program
- CS0291
L. Goldin, A.J. Grunwald and E. Kantorowitz:
Inexpensive graphics for real-time motion simulation
- CS0292
Micha Hofri and Zvi Rosberg:
The Golden Ratio Policy Stikes Again OR- On Distributed Protocols For a Multiple-Access Channel with Average Delay Criterion
- CS0293
G. Fayolle, P. Flajo1et, M. Hofri, P. Jacquet:
The Evaluation of Packet Transmission Characteristics in a Multi-Access Collision Detection Channel with Stack Collision Resolution Protocol
- CS0294
E. Korach, S. Moran and S. Zaks:
Finding a Minimum Spanning Tree Can Be Harder Than Finding a Spanning Tree in Distributed Networks
- CS0295
Alon Itai and Avram Zehavi:
Minimal Path-Disconnected Graphs
- CS0296
Azaria Paz:
Some NP-Hard Problems Connected with the Extended Eoclidean-Algorithm for N-Integers
- CS0297
Yaron I. Gold and Shlomo Moran:
Distributed Algorithms for Computing All Internode Distances and for Constructing a Minimum-Weights Spanning Tree in a Fully Connected Broadcast Network
- CS0298
E.Korach, S. Moran and S. Zaks:
Tight Lower and Upper Bounds for Some Distributed Algorithms for a Complete Network of Processors
- CS0299
Nissim Francez and Shaula Yemini:
A Fully Arstract and Composable Inter-Task Communication-Construct
- CS0300
Azaria Paz:
A Generalization of the Cayley Hamilton Theorem
- CS0301
A. Itai and J.A. Makowsky:
Unification as a Complexity Measure for Logic Programming
- CS0302
T. Etzion and A.Lempel:
Construction of De Bruijn Sequences of Minimal Complexity
- CS0303
Avram Sidi:
Evaluation of a Double Cauchy Principal Value Integral That Arises in a Problem Involving the Generation of Instability Waves
- CS0304
Yoav Raz:
Linear Programming Problems with Bounded Variables and a Single Constraint - Solution and Algorithm
- CS0305
M. L. Tiomkin and J. A. Makowsky :
Probabilistic propositional dynamic logic
- CS0306
P.Erdos, S. Moran, S. Zaks, I.Koren and G.M. Silberman:
Mapping Data Flow Graphs on VLSI Processing Arrays
- CS0307
Yoav Raz:
Interactive L Systems with a Fast Local Growth: Deterministic Case
- CS0308
Zvi Rosberg and Don Towsley:
Message Routing to Trasmission Channels with Different Rates
- CS0325
Oded Goldreich:
Sending certified mail using oblivious transfer and a threshold scheme
To the main CS technical reports page