1985 CS Technical Reports
- CS0350
A. Ginzburg and M. Yoeli:
Reducibility of Syncrhonization Structures
- CS0351
M. Yoeli and A.Ginzburg:
On Parallel Programming Primitives
- CS0352
E. Schieber and S. Moran:
Parallel Algorithm for Finding Maximum Bipartite Matching and Maximum Flow in 0-1 Networks
- CS0353
I. Chlamtac and O. Ganz:
Design and Analysis of Very High Speed Network Architectures
- CS0354
L. Shrira and O. Goldreich:
Electing a Leader in the Presence of Faults: A Ring as a Special Case
- CS0355
L. Shrira and O. Goldreich:
Consultation in the Presence of Faults: Two Lower Bounds
- CS0356
Z. Shmuely:
Composite Diffie-Hellman Public-Key Generating Systems are Hard to Break
- CS0357
Y. Mond and Y. Raz:
Concurrency Control in B+ Trees Databases Using Preparatory Operations
- CS0358
I. Gold, O. Shmueli and M. Hofri:
The Private Workspace Model Feasibility and Applications to 2PL Performance Improvements
- CS0359
Azaria Paz:
Some Aspects of H.W Lenstra's Integer Programming Algorithm
- CS0360
Ephraim Korach and Michal Penn:
Tight Integral Duality Gap in the Chinese Postman Problem
- CS0361
L. Shrira and M. Rodeh:
Methodological Construction of Reliable Distributed Algorithms
- CS0362
S. Moran:
Communication versus Computation in Fault Tolerant Broadcast Protocols
- CS0363
I. Chlamtac and A. Lerner:
A Link Allocation Protocol for Mobile Multi-Hop Radio Networks
- CS0364
G. Seroussi and R.M Roth:
On MDS Extensions of Generalized Reed-Solomon Codes
- CS0365
T. Etzion:
On the Distribution of De Bruijn CR-Sequences
- CS0366
T. Etzion:
An Algorithm for Generating Shift-Register Cycles
- CS0367
S. Porat and N. Francez:
Fairness in Term Rewriting Systems
- CS0368
A. Lustig and O. Shmueli:
Hypergraph Covering Algorithms for Relational Query Processing
- CS0369
N. Francez, O. Grumberg, S. Katz, A. Pnueli:
Proving Termination of Prolog Programs
- CS0370
O. Shmueli, S. Tsur, H. Zfira, R. Ever-Hadani:
Dynamic Rule Support in Prolog
- CS0371
L. Shrira and N. Francez:
A Program Transformation Regarded as a Proof Transformation
- CS0372
M. Yoeli:
A Net Model of Communicating Systems
- CS0373
O. Grestel and S. Zaks:
On the Message Complexity and Bit Complexity of Distributed Sorting
- CS0374
Micha Hofri:
Queueing Systems with a Procrastinating Server
- CS0375
Micha Hofri:
An M/G/1 Queue with Vacations and a Threshold
- CS0376
Micha Hofri:
Two Queues and One Server with Threshlod Switching
- CS0377
E.G. Coffman, Jr. and M. Hofri:
Queueing Analyses of Secondary Storage Devices
- CS0378
Z. Harpaz and S. Zaks:
On the Cost of Sense of Direction in Distributed Networks
- CS0379
E. Korach, S. Kutten, S. Moran:
A Modular Technique for the Design of Efficient Distributed Leader Finding Algorithms
- CS0380
S. Katz and O. Shmueli:
Cooperative Distributed Algorithms for Dynamic Cycle Prevention
- CS0381
Micha Hofri, Zvi Rosberg:
Optimally Controlled CCD Shift Registers (Optimal Interception nn a Recurrent Trajectory)
- CS0382
O. Gerstel. Z. Harpaz, R. Rinat:
A Pumping Lemma for Monotonous Super-Nets Languages
- CS0383
Y. Mansour and S. Zaks:
On the Bit Complexity of Distributed Computations in a Undirectional Ring with a Leader
- CS0384
A. Sidi and M. Israeli:
Numerical Quadrature Methods for Integrals of Singular Periodic Functions and their Application to Singular and Weakly Singular Integral Equations
- CS0385
Aviv Lustig and Oded Shmueli:
Acyclic Hypergraph Projections and Relationships to Cirrcular-Arc Graphs
- CS0386
Ouri Wolfson:
Overhead of Locking Protocols in a Distributed Database
- CS0387
Ouri Wolfson:
Concurent Execution of Syntatically Identical Transactions
- CS0388
R. Gerth and L. Shrira:
Proving Noninteraction: an Optimized Approach
- CS0389
S. Moran, M. Shalom and S. Zaks:
A 1.44 ... NlogN Algorithm for Distributed Leader-Finding in Bidirectional Rings of Processors
- CS0390
R. Rinat ; N. Francez ; O. Grumberg:
Infinite trees, markings and well foundedness
- CS0391
Avram Sidi:
Extrapolation Methods for Divergent Oscillatory Infinie Integrals that are Defined in the Sense of Summability
- CS0392
J. Makowsky, V.M. Markowitz and N. Rotics:
Entity-Relationship Consistency for Relational Schemas
- CSnonm
L. Shrira and M. Rodeh:
Methodological Construction of Reliable Distributed Algorithms
To the main CS technical reports page