- CS0190
Gabriel M. Silbermam:
*Stack Processing Techniques in Delayed-staging Storage Hierarchies* - CS0191
Gabriel M. Silberman:
*A Procedure of Efficienjly Obtain Fault-ratios in Delayed-staging-storage Hierarchies* - CS0192
Gabriel M. Silberman:
*Delayed-Staging Hierarchy Optimization* - CS0193
Avram Sidi:
*Interpolation at Equidistant Points by a Sum Of Exponential Functions* - CS0194
S. Even and O. Goldreich:
*The Minimum Length Permutation Sequence is NP-hard* - CS0195
Avram Sidi:
*The Numerical Evaluation of Very Oscillatory Infinite Integrals by Extrapolation* - CS0196
Yossi Shiloach and Uzi Vishkin:
*An Efficient Parallel Max-Flow Algorithm* - CS0197
Orna Grumberg, Nissim Francez, Johanny Makowsky and Willem P. de Roever:
*A Proof Rule for Fair Termination of Guarded Gommands* - CS0198
Naphtali Rishe:
*On Formal Semantics of Data Bases* - CS0199
Gabriel M, Silberman:
*Functional Capabilities of Active Memory Units* - CS0200
Avram Sidi and David Levin:
*Rational Approximations from the d-Transformation* - CS0201
Shimon Even and Yacov Yacobi:
*On the Complexity Structure of NP n Conp* - CS0202
O. Goldreich:
*Graph Partition Into Equinumerous Connected Components Is NP-Complete* - CS0203
Micha Hofri:
*On the Number of Bins Required to Pack n Pieces using the Next-Fit Algorithm* - CS0204
Avram Sidi:
*Euler-Mackaurin Expansions for Some Two-Dimensional Integrals with a Line of Singularities in the Domain of Integration* - CS0205
S. Even and O.Golderich:
*The Minimum Legth Generator Sequence Problem Is NP-Hard* - CS0206
G. Seroussi and A.'Lempel:
*On Symmetric Representations of Finite Fields* - CS0207
S.Even* and O. Goldreich:
*Des-like Functions Can Generate the Alternating Group* - CS0208
D.S. Lubinsky and A. Sidi:
*Convergence of Linear and Non-linear Pade Approximants from Series of Orthogonal Polynomials* - CS0209
Moshe Israeli and Marius Ungarish:
*Improvement of Numerical Solution of Boundary Layer Problems by Incorporation of Asymtotic Approximations* - CS0210
Uzi Vishkin:
*Implementation of Simultaneous Memory Address Access in Models That Forbid It* - CS0211
Alon Itai:
*On the Compexity of Contractions* - CS0212
S.Even. and Y. Yacobi:
*NP-Completeness and Convent ional Cryptosystems* - CS0213
S. Even and Y. Yacobi:
*On the Complexity of Problems with Few Solutions* - CS0214
A. Lempel, G. Seroussi and S.Winograd:
*On the Complexity of Multiplication in Finite Fields* - CS0215
D.S. Lubinsky and A. Sidi:
*Convergence of Product Integration Rules for Functions with Interior and Endpoint Singularities over Bounded and Unbounqed Intervals* - CS0216
Tuvi Etzion:
*The Power Of Lambda-labels In Petri Nets* - CS0217
G. Serroussi and A. Lempel:
*On Symmetric Algorithms for Bilinear Forms over Finite Fields* - CS0218
Tuvi Etzion and Michael Yoe1i:
*Super-nets and Their Hierarchy* - CS0219
Zvi Rosberg:
*Optimal Decentralized Control in a Multi-access Channel with Partial Information* - CS0220
Shmuel Zaks:
*A New Algorithm for Generation of* - CS0221
R. Bar-Yehuda and S. Even:
*On Approximating a Vertex Cover for Planar Graphs* - CS0222
Alan L. Selman and Yacov Yacobi:
*The Complexity of Promise Problems* - CS0223
Shlomo Moran:
*An Optimization Problem in Geometry with Application to Communication in Networks with Mobile Nodes* - CS0224
Sara Porat and Michael Yoeli:
*Towards a Hierarcry of Nets* - CS0225
Avram Sidi and D.S. Lubinsky:
*Convergence Of Approximate Inversion of Laplace Transforms using Pade and Rational Approximalions* - CS0226
Tui Etzion and Michael Yoeli.:
*The Hierarchy of Labeled Super-nets* - CS0227
Moshe Israe1i and Marius Ungarish:
*Laminar Compressible Flow between Close Rotating Disks - Asymptotic and Numerical Study* - CS0228
Amir Tomer and Michael Yoeli:
*On the Application of Extended Petri Nets to the Verification of Protocols* - CS0229
Zvi Rosberg:
*A Note on Multiple-access Protocols* - CS0230
S. Even, O. Go1dreich and P. Tong:
*On the NP-Completeness of Certain Network-Testing Problems*