%A Micha Hofri
%T Disk scheduling: FCFS vs. SSTF revisited
%R Technical Report 123
%I Department of Computer Science, TECHNION - Israel Institute of Technology
%D March 1978
%P 23

%A O. Goldreich
%T Sending certified mail using oblivious transfer and a threshold scheme
%R Technical Report 325
%I Department of Computer Science, TECHNION - Israel Institute of Technology
%D 1984

%A J. A. Makowsky
%A M. Y. Vardi
%T On the expressive power of data dependencies
%R Technical Report 326
%I Department of Computer Science, TECHNION - Israel Institute of Technology
%D 1984

%A S. Katz
%A O. Shmueli
%T Cooperative distributed algorithms for dynamic cycle prevention
%R Technical Report 330
%I Department of Computer Science, TECHNION - Israel Institute of Technology
%D 1984
%K Cooperation among operations
%K Distributed invariants
%K Graph searching
%K Program development

%A S. Even
%A O. Goldreich
%A A. Lempel
%T A randomized protocol for signing contracts
%R Technical Report 331
%I Department of Computer Science, TECHNION - Israel Institute of Technology
%D 1984
%K Certified electronic mail
%K Cryptographic protocols
%K Flipping a coin
%K Oblivious transfer
%K Public key cryptosystems

%A G. Taubenfeld
%A N. Francez
%T Proof rules for communication abstractions
%R Technical Report 332
%I Department of Computer Science, TECHNION - Israel Institute of Technology
%D 1984
%K Concurrent programming
%K Deadlock
%K Invariants
%K Program verification
%K Scripts

%A A. Israeli
%A Y. Shiloach
%T An improved maximal matching parallel algorithm
%R Technical Report 333
%I Department of Computer Science, TECHNION - Israel Institute of Technology
%D 1984

%A E. Korach
%A S. Moran
%A S. Zaks
%T The optimality of distributed constructions of minimum weight
and degree restricted spanning trees in a complete network of processors
%R Technical Report 334
%I Department of Computer Science, TECHNION - Israel Institute of Technology
%D 1984

%A A. Israeli
%A A. Itai
%T A fast and simple randomized parallel algorithm for maximal
matching
%R Technical Report 335
%I Department of Computer Science, TECHNION - Israel Institute of Technology
%D 1984

%A O. Shmueli
%A S. Tsur
%A H. Zfira
%T Rule supporting in PROLOG
%R Technical Report 337
%I Department of Computer Science, TECHNION - Israel Institute of Technology
%D 1984

%A S. Moran
%T An improvement of an algorithm for construction of edge disjoint branchings
%R Technical Report 341
%I Department of Computer Science, TECHNION - Israel Institute of Technology
%D 1984

%A S. Moran
%A M. Snir
%A U. Manber
%T Applications of Ramsey's theorem to decision trees complexity
%R Technical Report 345
%I Department of Computer Science, TECHNION - Israel Institute of Technology
%D 1984
%K Computational complexity
%K Lower bounds

%A P. Erdos
%A N. Linial
%A S. Moran
%T Extremal problems on permutations under cyclic equivalence
%R Technical Report 349
%I Department of Computer Science, TECHNION - Israel Institute of Technology
%D 1984