- S. Moran, Efficiently Approximable Problems: Characterization and Examples, TR#135, Department of Computer Science, Technion, Israel (1979).
- S. Moran, The Complexity of Approximation Algorithms for a Generalized Clique Problem, TR, Faculty of Mathematics, Technion, Israel (1978).
- O. Ibarra and S. Moran, On the Power of Control Statements in Reducing the Number of Arithmetic Operations Needed to Compute Algebraic Functions, TR#81-10, Department of Computer Science, University of Minnesota (1981).
- S. Moran, Probabilistic Versus Nondeterministic Algorithms under Relativization, TR#81-13, Department of Computer Science, University of Minnesota (1981).
- S. Moran, An Optimization Problem in Geometry with Application to Communication in Networks with Mobile Nodes, TR#233, Department of Computer Science, Technion, Israel (1981).
- S. Moran, On the Optimal Packing of Circles in Convex Figures, TR#241, Department of Computer Science, Technion, Israel (1982).
- E. Korach, S. Moran and S. Zaks, Finding a Minimal Spanning Tree can be Harder Than finding a Spanning Tree in a Distributed Network, TR #294, Department of Computer Science, Technion, Haifa, Israel, October 1983.
- S. Moran, A Ramsey-Theorem Based Technique For Proving Lower Bounds on Decisions Trees, TR#313, Department of Computer Science, Technion, Israel (1984).
- S. Moran, An Improvement of an Algorithm for Construction of Edge Disjoint Branchings, TR #341, Dept. of Computer Science, Technion, Israel (1984).
- S. Moran, On the Cost of Reducing the Interaction in Interactive Proof Protocols, TR#437, Department of Computer Science, Technion, Israel (1986).