- CS0393
S. Porat and N. Francez:
*Full-Commutation and Fair-Termination in Equational (and Combined) Term-Rewriting Systems* - CS0394
M.L. Tiornkin and J.A. Makowsky:
*Decidability Questions for Finite Probabilistic Propositional Dynamic Logic* - CS0395
J.A. Makowsky and I. Sain:
*On the Equivalence of Weak Second Order and Non-Standard Time Semantics for Various Program Verification Systems* - CS0396
G. Seroussi and N.H. Bshoty:
*Vectors Sets for Exhaustive Testing of Logic Circuits* - CS0397
I. Chalamtac and A. Lerner:
*Fair Algorithms for Maximal Link Activation in Multi-Hop Radio Networks* - CS0398
Yacov Yacoby:
*On proving privacy in multiuser systems* - CS0399
Y. Sagiv and O. Shmueli:
*Solving Queries by Tree Projections* - CS0400
W.F. Ford and A. Sidi:
*Recursive Algorithms for Vector Extrapolation Methods* - CS0401
E. Korach and M. Makowitz:
*Algorithm for Distributed Spanning Tree Construction in Dynamic Networks* - CS0402
E. Korach, S. Onn , D. Rotem:
*A Method for Linearly Solving Combinatorial Optimization and Reliability Problems on Series Parallel Distributed Network* - CS0403
Shmuel Katz:
*Temorary Stability in Parallel Programs* - CS0404
M. Hofri and K.W. Ross:
*On The Optimal Control of Two Queues with Server Setup Times and Its Analysis* - CS0405
Yoav Raz:
*A Precise Definition of RRA - a Reshaped Relational Algebra which Follows Natural Language Constructs* - CS0406
A. Zehavi and A. Itai:
*Three Tree Connectivity* - CS0407
A. Itai and Y. Raz:
*The Number of Buffers Required for Sequential Processing of a Disk File* - CS0408
S. Moran and Y. Wolfstahl:
*An Extended Impossibility Result for Asynchronous Complete Networks* - CS0409
R. Bar-Yehuda and S. Kutten:
*Fault Tolerant-Leader Election with Termination Detection, in General Undirected Networks (Extended Abstract)* - CS0410
Yoav Raz:
*Supporting Natural Language Interfaces for Relational Databases using RRA - a Reshaped Relational Algebra* - CS0411
Ofer Imanuel and Yoav Raz:
*The Errol System* - CS0412
V.M. Markiwitz and J.A. Makowsky:
*Unifying Entity-Relationship and Universal Relation Approaches to User Interfaces* - CS0413
V.M. Markowitz:
*Unifying Entity-relationship and Universal Relation Approaches to User Interfaces* - CS0414
I. Chlamtac and O. Ganz:
*Frequency-Time Controlled Multichannel Networks for High-Speed Communication* - CS0415
I. Chlamtac, O. Ganz and. Z. Koren:
*Prioritized Demand Assignment Protocols and their Evaluation* - CS0416
Ouri Wolfson:
*The Virtues of Locking by Sxmbolic Names* - CS0417
Michael Kaminski and Azaria Paz:
*Computing the Hermite Normal form on an Integral Matrix* - CS0418
Michael Kaminski:
*An Algorithm for Polynomial Multiplication which does not Depend on the Ring Constants* - CS0419
Michael Kaminski:
*Probabilistic Algorithms in Integer and Polynomial Arithmetic* - CS0420
Oded Shmueli:
*Decidability and expressiveness aspects of logic queries* - CS0421
Yoav Raz:
*The Relational Algebric Operator NOT* - CS0422
Y. Mansour and S. Zaks:
*On the Bit Complexity of Distributed Computations in a Ring with a Leader* - CS0423
E. Korach, S. Moran and S. Zaks:
*Tight Lower and Upper Bounds for Some Distributed Algorithms for a Complete Network of Processors* - CS0424
Ouri Wolfson:
*A New Characterization of Distrlbuted Deadlock in Database* - CS0425
Ouri Wolfson:
*The Performance of Locking Protocols in Distributed Databases (Revised Version)* - CS0426
Israel Gold:
*The Private Workspace Model of Concurrency Control: Theory and Practice* - CS0427
Eram Gery and Yoav Raz:
*Evaluating Linear-Recursive Logic Queries Against Cyclic Relations* - CS0428
Y.I. Gold and S. Moran:
*A CORRECTION ALGORITHM FOR TOKEN PASSING SEQUENCES IN MOBILE COMMUNICATION NETWORKS* - CS0429
G.M. Benedek and A. Paz:
*The Combinatorial Complexity of Some Problems Connected with Linear Diophantine Equations* - CS0430
S. Kutten, Y. Wolfstahl and S. Zaks:
*Optimal Distributed t-Resilient Election in Complete Networks* - CS0431
Shay Kutten:
*Stepwise Construction of an Efficient Distributed Traversing Algorithm for General Strongly Connected Directed Graphs (or: Traversing One Way Streets* - CS0432
Shay Kutten:
*Optimal Fault-Tolerant Distributed Spanning Tree Weak Construction in General Networks* - CS0433
R.M. Roth and A. Lempe1:
*On the Algebraic Variance of Linear Transformations and Its Applications to Algebraic Codes* - CS0434
R.M. Roth and A. Lempel:
*Tiling Codes in Hamming Schems* - CS0435
A. Ban and J.A. Makowsky:
*Musician - A Music Processing and Synthesis System* - CS0436
Michael Yoeli:
*Specification and Verification of Asynchronous Circuits* - CS0437
Shlomo Moran:
*On The Cost of Reducing the Interaction in Interactive Proof Protocols* - CS0438
Shlomo Moran:
*Generalized Lower Bounds Derived from Hastad's Main Lemma* - CS0439
E. Korach and S. Onn:
*New Model for Distributed Networks to Improve Complexity with Linear Applications to Multicommodity Flows and Rooting in Series Parallel Graphs* - CS0440
E. Korach and M. Penn:
*Total Dual Integrality of Covers of Odd Circuits and NP-Hardness of the Negative Cut Problem* - CS0441
A. Segall and O. Wolfson:
*Transaction Commitment at Minimal Communication Cost* - CS0442
V.M. Markowitz and J.A. Makowsky:
*Inoremental Restructuring of Relational Schemas*