Browse

ftp://ftp.cs.technion.ac.il (127)

	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1992/cis9217.ps.Z, 19930527 Technion - Israel Institute of Technology Computer Science Department Learning of Resource Allocation Strategies for Game Playing 1 by Shaul Markovitch and Yaron Sella CIS Report #9219 November 1992 (revised May 1993) 1To appear in the Proceedings of IJCAI, 1993 Learning of Resource Allocation
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/cs785.ps.Z, 19931026 Oracles and Quantifiers J.A. Makowsky and Y.B. Pnueli Department of Computer Science Technion - Israel Institute of Technology, Haifa, Israel e{mail: janos@cs.technion.ac.il, yachin@csc.cs.technion.ac.il September 1993 And he shall stand before Eleazar the priest, who shall ask counsel for him after the
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/cs784.ps.Z, 19931026 Optimal Spanners in Partial k{Trees J.A. Makowsky Department of Computer Science Technion{Israel Institute of Technology Haifa, Israel janos@cs.technion.ac.il U. Rotics IBM Scientific Center Haifa, Israel rotics@HAIFASC3.VNET.IBM.COM October 1993
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/cs786.ps.Z, 19931028 A Taxonomy of Proof Systems Oded Goldreich Computer Science Department Technion, Haifa, Israel. October 24, 1993
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/cs775.ps.Z, 19931028 Tiny Families of Mixing Functions Oded Goldreich Computer Science Department Technion Haifa, Israel. Avi Wigdersony Institute for Computer Science Hebrew University Jerusalem, Israel. May 1993
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/cis9312.ps.Z, 19940113 Accessibility in 5-Axis G. Elber 20 G. Elber. Free Form Surface Analysis using a Hybrid of Symbolic and Numeric Computation. Ph.D. thesis, University of Utah, Computer Science Department, 1992. T. W. Sederberg and S. R. Barry. Freeform Deformation of Solid Geometric Models. Computer Graphics,
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/cis9324.ps.Z, 19940113 Sym. and Num. Comp. in Crv. Int. G. Elber 16 G. Elber and E. Cohen. Error Bounded Variable Distance Offset Operator for Free Form Curves and Surfaces. International Journal of Computational Geometry and Applications, Vol. 1., No. 1, pp 67-78, March 1991. G. Elber and E. Cohen. Error Bounded
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/cis9332.ps.Z, 19940113 Line Illustrations G. Elber 18 Algorithm 4 Input: M, A Model; Gi, Probability of Instantiation; ~V , unit vector in the direction of linear motion; L and D, length and distance of generated lines; Lp and Dp, length and distance perturbation of generated lines; Output: D, An object to enhance to speed
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/cs797.ps.Z, 19940124 Rectilinear Planar Drawings with Few Bends in Each Edge S. Even and G. Granot Computer Science Department Technion, Israel Inst. of Tech. Haifa 32000, ISRAEL even@cs.technion.ac.il gil@cs.technion.ac.il
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/cs762.ps.Z, 19940206 A New Proof of The Retiming Lemma and Applications (Preliminary Version) Guy Even Technion November 17, 1993
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/cis9315.ps.Z, 19940206 Shortening Three Dimensional Curves via Two Dimensional Flows Ron Kimmel Department of Electrical Engineering Technion-Israel Institute of Technology Haifa, Israel 32000 Guillermo Sapiro Lab. for Information and Decision Systems Massachusetts Institute of Technology Cambridge, Mass. 02139
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/cs779.ps.Z, 19940206 Optimal File Sharing in Distributed Networks Moni Naory Ron M. Rothz
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/cs783.ps.Z, 19940206 High-Order Spectral-Null Codes: Constructions and Bounds Ron M. Roth Computer Science Department Technion \| Israel Institute of Technology Haifa 32000, Israel Paul H. Siegel IBM Research Division Almaden Research Center 650 Harry Road San Jose, CA 95120 Alexander Vardy* IBM Research Division Almaden
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/cis9328.ps.Z, 19940206 On Projective Invariant Smoothing and Evolutions of Planar Curves and Polygons Alfred M. Bruckstein Doron Shakedy
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/cis9314.ps.Z, 19940206 Vincent, L., Exact Euclidean Distance Function by Chain Propagation," IEEE CVPR, May 1991. Yanowitz, S.D., and Bruckstein, A.M., A New Method for Image Segmentation," Computer Vision, Graphics, and Image Processing, Vol. 46, pp. 82-95, 1989. Figure Captions Figure 1 Subixel distance map of
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/cs770.ps.Z, 19940206 TECHNION TECHNICAL REPORT, MARCH 1993) Arabic formatting with ditroff/ffortid JOHNY SROUJI ( uj y u, i 'bexq ipe 'b) AND DANIEL BERRY (k q f BN, ixa l`ipc) Computer Science Department Technion Haifa 32000 Israel SUMMARY This paper describes an Arabic formatting system that is able to format multilingual
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/cs776.ps.Z, 19940206 Construction of Encoders with Small Decoding Look-Ahead for Input-Constrained Channels Jonathan J. Ashley Brian H. Marcus Ron M. Rothy
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/cis9319.ps.Z, 19940206 Kimmel Bruckstein 14 4. a. When propagating an equal height contour with respect to ^l on P l, the underlying image which specifies the propagation velocity shifts in time with a constant velocity of sin . b. The constant velocity of the shifting image may be converted to a constant shifting of the
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/cs787.ps.Z, 19940206 Spectral-Null Codes and Null Spaces of Hadamard Submatrices Ron M. Roth Computer Science Department Technion \| Israel Institute of Technology Haifa 32000, Israel. e-mail: ronny@cs.technion.ac.il
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/cs763.ps.Z, 19940206 A Real-Time Systolic Integer Multiplier Guy Even Technion November 15, 1993
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/cs780.ps.Z, 19940206 Lee-Metric BCH Codes and their Application to Constrained and Partial-Response Channels Ron M. Roth Paul H. Siegely
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/lpcr9313.ps.Z, 19940206 Sec. A 24 S. Rajsbaum and M. Sidi, On the Average of Synchronized Programs in Distributed Networks, 4nd International Workshop on DISTRIBUTED ALGORITHMS, 1990. A. Segall, Distributed Network Protocols, IEEE Transactions on Information Theory, vol. IT-29, no. 1, January 1983. S. R.
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/cis9325.ps.Z, 19940206 On Symmetry Axes and Boundary Curves Doron Shaked Alfred M. Brucksteiny
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/lpcr9301.ps.Z, 19940206 Sec. 5 27 R. G. Gallager, P. A. Humblet and P. M. Spira, A Distributed Algorithm for MinimumWeight Spanning Trees, ACM Transactions on Programming Languages and Systems, Vol. 5, No. 1, 1983, pages 66-77. E. Korach, G. Tel and S. Zaks, Optimal Synchronization of ABD Networks, Technical
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/cis9326.ps.Z, 19940209 Exploiting Temporal Coherence in Animation Rendering A Survey Oded Sudarsky 1 Introduction Animation is the creation of the illusion of motion by displaying images in rapid succession\| typically 25 or 30 frames per second. The na ve way to produce an animation sequence is to render and record each frame
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/cs757.ps.Z, 19940209 The 3-Edge-Components and a Structural Description of 3-Edge-Cuts in a Graph Yefim Dinitz y Department of Computer Science Technion Haifa 32000, Israel e-mail: dinitz@cs.technion.ac.il
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/cs794.ps.Z, 19940209 On the Complexity of Direct Caching Y. Hollander A. Itai Computer Science Dept. Technion, Haifa, Israel January 27, 1994
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/cis9318.ps.Z, 19940209 Technion - Israel Institute of Technology Computer Science Department Learning Models of Opponent's Strategy in Game Playing by David Carmel and Shaul Markovitch CIS Report #9318 (Revised Version of CIS Report #9305) June 1993 Learning Models of Opponent's Strategy in Game Playing David Carmel and Shaul
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/cs9322.ps.Z, 19940209 Sec. 6 13 D. Peleg and J.D. Ullman, An Optimal Synchronizer for the Hypercube, SIAM Journal on COMPUTING Vol 18, No. 4, pp. 740-747, August 1989. D. Peleg and E. Upfal, A Trade-off between Space and Efficiency for Routing Tables, Journal of the ACM, Vol. 36, No. 3, July 1989, pp. 510-530.
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/cs755.ps.Z, 19940209 Asynchronous Secure Computation Ran Canettiy Department of Computer Science Technion \| Israel Institute of Technology Haifa, Israel February 7, 1994
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/cs796.ps.Z, 19940209 Closed Schedulers: Constructions and Applications to Consensus Protocols Ronit Lubitch Shlomo Moran Dept. of Computer Science Technion \| Israel January, 1994
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/cs798.ps.Z, 19940209 Designing the Virtual Path Layout in ATM Networks I. Cidon1 , O. Gerstel2 and S. Zaks2 1 IBM T.J. Watson Research Center Yorktown Heights, NY 10598 E-mail: cidon@watson.ibm.com 2 Computer Science Dept. Technion, Haifa 32000, Israel E-mail: orig,zaks@cs.technion.ac.il
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/cs799.ps.Z, 19940217 A Parallelizable Incomplete LU -type Preconditioner for the Solution of Sparse Linear Systems Yair Shapira, Avram Sidi and Moshe Israeli February 9, 1994
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/lpcr9317.ps.Z, 19940508 INTERLACING PROPERTIES OF TRIDIAGONAL SYMMETRIC MATRICES WITH APPLIACTIONS TO PARALLEL COMPUTING ILAN BAR-ON
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/lpcr9318.ps.Z, 19940508 PARALLEL COMPUTATION OF THE SPECTRUM OF A SYMMETRIC TRIDIAGONAL MATRIX ILAN BAR-ON
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/cis9402.ps.Z, 19940508 Technion - Israel Institute of Technology Computer Science Department The M Algorithm: Incorporating Opponent Models into Adversary Search by David Carmel and Shaul Markovitch CIS Report #9402 March 1994 The M Algorithm: Incorporating Opponent Models into Adversary Search David Carmel and Shaul
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/cis9301.ps.Z, 19940508 Finding Shortest Paths on Surfaces Ron Kimmel Arnon Amir y Alfred M. Bruckstein y
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/cis9404.ps.Z, 19940508 Ruled Mill G. Elber and R. Fish 17 Plate 3 Final machined examples of the centrifugal compressor. The air flow tunnels in this part were machined using the piecewise ruled surface side milling technique and with a conical tool. Ruled Mill G. Elber and R. Fish 16 Plate 1 Final machined examples of the
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/lpcr9305.ps.Z, 19940508 Hot Potato Worm Routing via Store-and-Forward Packet Routing Ilan Newman y Assaf Schuster z
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/cs771.ps.Z, 19940508 An easy planarity test for unflippable modules Shmuel Zaks Department of Computer Science Technion, Haifa, Israel March 2, 1994
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/cs817.ps.Z, 19940508 An Improvement of Davies' Attack on DES Eli Biham Alex Biryukovy
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/cs789.ps.Z, 19940508 Lower bounds for sampling algorithms for estimating the average Ran Canetti Guy Even Oded Goldreich Technion \| Israel Institute of Technology Department of Computer Science Haifa, Israel February 21, 1994
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/cs811.ps.Z, 19940508 Online Learning versus Offline Learning Shai Ben-David Eyal Kushilevitzy Yishay Mansourz April 13, 1994
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/lpcr9403.PS.gz, 19940508 Derivative Evaluation Function Learning Using Genetic Operators David H. Lorenzy Shaul Markovitchz Department of Computer Science, Technion\|Israel Institute of Technology, Technion City, Haifa , ISRAEL 32000 LPCR Report #9403
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/cs774.ps.Z, 19940508 Maintaining the 4-Edge-Connected Components of a Graph On-Line E. Dinitz y Department of Computer Science Technion Haifa, ISRAEL 32000
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/cs809.ps.Z, 19940508 A MODIFIED ALGEBRAIC MULTIGRID METHOD WITH APPLICATION TO NONSYMMETRIC AND INDEFINITE PARTIAL DIFFERENTIAL EQUATIONS Yair Shapira Computer Science Department, Technion - Israel Institute of Technology, Haifa 32000, Israel. April 3, 1994 SUMMARY A modified algebraic multigrid method for the solution of
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/cs767.ps.Z, 19940508 A Correctness Condition for High-Performance Multiprocessors Hagit Attiyay Roy Friedman Department of Computer Science The Technion Haifa 32000, Israel February 21, 1994 Partially supported by Technion V.P.R.\|B. and G. Greenberg Research Fund (Ottawa). An extended abstract of this work appears in
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/lpcr9404.PS.gz, 19940508 Soop \| A Synthesizer of an Object-Oriented Parser (Preliminary Version) Joseph Gil y David H. Lorenzz The Faculty of Computer Science, Technion\|Israel Institute of Technology, Technion City, Haifa 32000, ISRAEL; LPCR Report #9404 April 1994
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/lpcr9304.ps.Z, 19940508 A Fast and Stable Parallel QR Algorithm for Symmetric Tridiagonal Matrices. Ilan Bar-On Bruno Codenotti yz November 28, 1993
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/cis9327.ps.Z, 19940508 Global Shape from Shading Ron Kimmel Alfred M. Brucksteiny
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/cs805.ps.Z, 19940508 A proof for lack of starvation in DQDB Oran Sharon Dept. of Computer Science Technion, Israel Institute of Technology Haifa, Israel 32000 oran@csc.cs.technion.ac.il
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/cs816.ps.Z, 19940508 How to Strengthen DES Using Existing Hardware Eli Biham Alex Biryukovy May 3, 1994
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/cs766.ps.Z, 19940508 On the Capabilities of Systolic Systems Shimon Even and Ami Litman Computer Science Department, Technion, Haifa, Israel 32000, and Bellcore, 445 South St., Morristown, NJ 07960-1910.
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/cs808.ps.Z, 19940508 A Proof for lack of starvation in DQDB with and without Slot Reuse Oran Sharon Dept. of Computer Science Technion, Israel Institute of Technology Haifa, Israel 32000 oran@csc.cs.technion.ac.il
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/cs765.ps.Z, 19940508 Average and Randomized Complexity of Distributed Problems Nechama Alanberg-Navony Alon Itai Shlomo Moran Computer Science Department Technion, Haifa 32000, Israel April 26, 1994
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/lpcr93016.ps.Z, 19940508 Shared Memory Consistency Conditions for Non-Sequential Execution: Definitions and Programming Strategies Hagit Attiyay Soma Chaudhuriz Roy Friedmany Jennifer L. Welchx February 21, 1994 An extended abstract of this paper is going to appear in Proc. of the 5th ACM Symposium On Parallel Algorithms and
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/cs813.ps.Z, 19940508 On Matsui's Linear Cryptanalysis Eli Biham Computer Science Department Technion - Israel Institute of Technology Haifa 32000, Israel
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/cs807.ps.Z, 19940508 Analyzing Expected Time by Scheduler-Luck Games: Self Stabilizing Leader Election as an Example Shlomi Dolevy Amos Israeliz Shlomo Moranx April 26, 1994
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/cs777.ps.Z, 19940508 A Lower Bound on Wait-Free Counting Shlomo Morany Gadi Taubenfeldz August, 1993
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/cis9403.ps.Z, 19940508 Surface Region Optimization G. Elber 12 G. Elber. Free Form Surface Analysis using a Hybrid of Symbolic and Numeric Computation. Ph.D. thesis, University of Utah, Computer Science Department, 1992. M. Markot and R. L. Magenson. Solutions of Tangential Surface and Curve Intersections. Computer
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/cs820.ps.Z, 19940530 Oracles and Quantifiers J.A. Makowsky1 and Y.B. Pnueli2 1 Department of Computer Science, Technion{Israel Institute of Technology Haifa, Israel (janos@cs.technion.ac.il) 2 Institut f ur Informatik, Freie Universit at Berlin Berlin, Germany (yachin@inf.fu-berlin.de) To appear in Selected Papers from
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/cs819.ps.Z, 19940530 On Average Case Complexity of SAT for Symmetric Distributions Johann Makowsky Faculty of Computer Science Technion\|ITT 32000 Haifa, Israel janos@cs.technion.ac.il Abraham Sharell Laboratoire de Recherche en Informatique Universit e Paris-Sud 91405 Orsay, France sharell@lri.fr April 1994 To appear in
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/cs818.ps.Z, 19940530 Arity vs. Alternation in Second Order Logic J.A. Makowsky Institut f ur Informatik Universit at Bern Bern, Switzerland (janos@cs.technion.ac.il) Y.B. Pnueliy Institut f ur Informatik Freie Universit at Berlin Berlin, Germany (yachin@inf.fu-berlin.de)
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/cs768.ps.Z, 19940531 Computable Quantifiers and Logics over Finite Structures J.A. Makowsky and Y.B. Pnueli Department of Computer Science Technion - Israel Institute of Technology, Haifa, Israel February 1993 To appear in `Quantifiers: Generalizations, extensions and variants of elementary logic', M. Krynicki, M. Mostowski
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/cs821.ps.Z, 19940629 FAST DIAGONALIZATION OF LARGE AND DENSE COMPLEX SYMMETRIC MATRICES, WITH APPLICATIONS TO QUANTUM REACTION DYNAMICS ILAN BAR-ON DEPARTMENT OF COMPUTER SCIENCE VICTOR RYABOY DEPARTMENT OF CHEMISTRY TECHNION, HAIFA 32000, ISRAEL
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/lpcr9409.ps.Z, 19940705 A Parallel System for Rendering Realistic Terrain Image Sequences Gennady Agranov Craig Gotsman y Computer Science Department Technion - Israel Institute of Technology Haifa 32000, Israel
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/cs827.ps.Z, 19940705 On Covering Problems of Codes Moti Frances Ami Litman Department of Computer Science Technion, Haifa 32000, Israel
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/cs826.ps.Z, 19940705 Balancing Communication in Ring-Structured Networks Ami Litman Department of Computer Science The Technion Haifa, Israel Arnold L. Rosenberg Department of Computer Science University of Massachusetts Amherst, Mass., USA
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/lpcr9408.PS.gz, 19940712 Derivative Operators for Preference Predicate Evolution David H. Lorenzy The Faculty of Computer Science, Technion\|Israel Institute of Technology, Technion City, Haifa 32000, ISRAEL; LPCR Report #9408, June 1994.
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/cs782.ps.gz, 19941004 Round output difference input difference p icb key fraction P = (f7g; 0) 1 A = a = 1 1 2 B = f39g b = f7g p = 1=8 1 1/2 3 C = f7g c = f39g p = 1=8 1 1/2 4 1 1 5 f13g f39g p = 1=8 1/2 6 f38g f13g p = 1=8 1 1/2 7 f13g f38; 39g p = 1=8 1/2 8 1 1 9 f13g f38; 39g p = 1=8 1/2 10 f38g f13g p = 1=8 1 1/2 11
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1991/cs708.ps.gz, 19941004 National Bureau of Standards, Data Encryption Standard, U.S. Department of Commerce, FIPS pub. 46, January 1977. of n, if p > 2 40:2 then the number of analyzed plaintexts is two and the complexity of the data analysis phase is 232. However, using about four times as many chosen plaintexts, we can
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1992/cs753.ps.gz, 19941004 New Types of Cryptanalytic Attacks Using Related Keys (Revised version) Eli Biham1 Computer Science Department Technion - Israel Institute of Technology Haifa 32000, Israel
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/cs810.ps.Z, 19941017 CONVERGENCE RATES OF A PARALLELIZABLE MULTIGRID METHOD AND APPLICATIONS TO HIGHLY INDEFINITE HELMHOLTZ EQUATIONS Yair Shapira and Moshe Israeli Computer Science Department, Technion - Israel Institute of Technology, Haifa 32000, Israel. SUMMARY A parallelizable version of the Automatic Multigrid
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/cis9412.ps.Z, 19941017 The Curve Axis Doron Shaked Alfred M. Brucksteiny Center for Intelligent Systems Technion, Haifa 32000, Israel
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/lpcr9306.ps.Z, 19941017 Shared Memory Consistency Conditions for Non-Sequential Execution: Definitions and Programming Strategies Hagit Attiyay Soma Chaudhuriz Roy Friedmany Jennifer L. Welchx October 12, 1994 An extended abstract of this paper is going to appear in Proc. of the 5th ACM Symposium On Parallel Algorithms and
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/cs825.ps.Z, 19941017 TOWARDS AUTOMATIC MULTIGRID ALGORITHMS FOR SPD, NONSYMMETRIC AND INDEFINITE PROBLEMS Yair Shapira, Moshe Israeli and Avram Sidi Computer Science Department, Technion Israel Institute of Technology, Haifa 32000, Israel. SUMMARY A new multigrid algorithm is constructed for the solution of linear systems
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/lpcr9410.ps.Z, 19941017 This article was processed using the LaTEX macro package with LLNCS style the synchronization protocol of at a similar node. However, O(log jV j) bits per link is still considered as a reasonable amount of memory. This amount of memory is much less than the amount of memory needed anyway in order to
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/cs833.ps.gz, 19941017 Cryptanalysis of Multiple Modes of Operation Eli Biham Computer Science Department Technion - Israel Institute of Technology Haifa 32000, Israel
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/lpcr9411.ps.Z, 19941017 Programming DEC-Alpha Based Multiprocessors The Easy Way1 Hagit Attiya Roy Friedman2 Department of Computer Science The Technion Haifa 32000, Israel October 16, 1994 1This research was partially supported by grant No. 92-0233 from the United States-Israel Binational Science Foundation (BSF), Jerusalem,
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/cs831.ps.Z, 19941017 The Layout of Virtual Paths in ATM Networks Israel Cidon1 , Ornan Gerstel2 and Shmuel Zaks3 1 Sun Microsystems Labs, 2550 Garcia Ave., Mountain View, CA 94043 E-mail: cidon@anchor.eng.sun.com 2 Computer Science Dept., Technion, Haifa 32000, Israel E-mail: orig@csc.cs.technion.ac.il 3 Computer Science
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1993/cs769.ps.Z, 19941020 Optimal Upper Bounds for the Error in the Approximants of Continued Fractions Yair Shapira, Avram Sidi and Moshe Israeli October 18, 1994
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/cis9415.ps.Z, 19941121 Polygon Morphing Using a Multiresolution Representation Eli Goldstein Craig Gotsman Department of Computer Science Technion - Israel Institute of Technology Haifa 32000, Israel fgoldy\|gotsmang@cs.technion.ac.il
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/lpcr9402.ps.Z, 19941121 Software Boards via Configurable Objects Joseph Gil y Ricardo Szmit zx Department of Computer Science, Technion\|Israel Institute of Technology, Technion City, Haifa 32000, ISRAEL.
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/cs835.ps.Z, 19941121 Overcoming chip-to-chip delays and clock skews Guy Even Ami Litman y
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/cs837.ps.Z, 19941121 Remarks on the Fourier-Gegenbauer Method L. Vozovoiy, M. Israeliy, A. Averbuchz y Faculty of Computer Science, Technion, Haifa 32000, Israel z School of Mathematical Sciences, Tel Aviv University, Tel Aviv 69978, Israel
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/lcl9410.ps.Z, 19941121 Splitting the Reference Time: Temporal Anaphora and Quantification in DRT - Technical Report Rani Nelken Tel-Aviv University Tel-Aviv 69978, Israel nelken@math.tau.ac.il Nissim Francez Computer Science Department The Technion Haifa 32000, Israel francez@cs.technion.ac.il November 6, 1994
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/cis9416.ps.Z, 19941121 Parallel Adaptive Ray-Tracing Irena Notkin Craig Gotsman Department of Computer Science Technion - Israel Institute of Technology Haifa 32000, Israel fcyrus\|gotsmang@cs.technion.ac.il
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/lpcr9413.ps.Z, 19941121 Rajive Bagrodia. A distributed algorithm to implement the generalized alternative command of csp. In 6th Int. Conf. Distributed Systems, Cambridge, May 1986. Rajive Bagrodia. Process synchronization: Design and performance evaluation of distributed algorithms. IEEE Trans. on Software
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1995/cis9501.ps.Z, 19950102 Ruled Tracing Gershon Elber , Jung-Ju Choi+, and Myung-Soo Kim+ * Department of Computer Science, Technion, IIT, Haifa 32000, Israel + Department of Computer Science, POSTECH, Pohang, 790-784, South Korea January 2, 1995
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/cs781.ps.z, 19950110 Implementing Hybrid Consistency with High-Level Synchronization Operations Roy Friedman Department of Computer Science The Technion Haifa 32000, Israel July 11, 1994 Partially supported by Technion V.P.R. { Argentinian Research Fund and the US-Israel Binational Science Foundation. An extended abstract
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/cis9417.ps.Z, 19950122 Function from Motion Zoran Duric1 Jeffrey Fayman2 Ehud Rivlin2 1Computer Vision Laboratory Center for Automation Research University of Maryland College Park, MD 20742-3275 2Department of Computer Science Israel Institute of Technology { Technion Haifa, Israel
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/lpcr9414.ps.Z, 19950122 Connection Management and Rerouting in ATM Networks Reuven Cohen and Adrian Segall Dept. of Computer Science Technion, Haifa 32000, Israel December 18, 1994
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/cis9419.ps.Z, 19950122 Skew-Symmetry Detection via Invariant Signatures A.M. Bruckstein and D. Shaked Center for Intelligent Systems Technion, IIT, 32000 Haifa, Israel
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1995/cs841.ps.Z, 19950122 The Double Baseline is Rearrangeable Shimon Even1 and Roni Kupershtok2 Computer Science Department Technion, Israel Institute of Technology Haifa, Israel 32000 December 12, 1994
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1995/cs843.ps.Z, 19950125 The t-spanner problem is NP-Complete on Chordal Graphs J.A. Makowsky and U. Rotics Department of Computer Science Technion{Israel Institute of Technology Haifa, Israel fjanos,roticsg@cs.technion.ac.il January 1995
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1995/cs849.ps.gz, 19950216 Logics Capturing Relativized Complexity Classes Uniformly J.A. Makowsky1 and Y.B. Pnueli2 1 Department of Computer Science, Technion{Israel Institute of Technology Haifa, Israel (janos@cs.technion.ac.il) 2 Institut f ur Informatik, Freie Universit at Berlin Berlin, Germany (yachin@inf.fu-berlin.de)
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1995/cs848.ps.gz, 19950216 Incremental Model Checking for Decomposable Structures J.A. MAKOWSKY and E.V. RAVVE Department of Computer Science Technion - Israel Institute of Technology Haifa, Israel e-mail: fcselena,janosg@cs.technion.ac.il Extended Abstract, January 1995 Submitted to MFCS'95
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1995/cs844.ps.gz, 19950219 Incremental Model Checking for Safety Properties on Decomposable Structures J.A. MAKOWSKY and E.V. RAVVE Department of Computer Science Technion - Israel Institute of Technology Haifa, Israel e-mail: fcselena,janosg@cs.technion.ac.il Extended Abstract, January 1995
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1995/cis9505.ps.Z, 19950220 Sensory based motion planning with global proofs Ishay Kamon and Ehud Rivlin email: ishay, ehudr@cs.technion.ac.il February 20, 1995
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1995/cs845.ps.Z, 19950221 Optimal Virtual Path Layout in ATM Networks with Shared Routing Table Switches Ornan Gerstel1, Israel Cidon2 and Shmuel Zaks3 1 Computer Science Dept., Technion, Haifa 32000, Israel E-mail: orig@csc.cs.technion.ac.il 2 Sun Microsystems Labs, 2550 Garcia Ave., Mountain View, CA 94043 E-mail:
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1995/cis9506.ps.Z, 19950226 A Characterization of the Dirichlet Distribution through Global and Local Independence Dan Geiger Computer Science Department Technion, Haifa 32000, Israel dang@cs.technion.ac.il David Heckerman Microsoft Research, Bldg 9S Redmond WA, 98052-6399 heckerma@microsoft.com
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1995/CS834.ps.Z, 19950302 A NEW DIVIDE AND CONQUER PARALLEL ALGORITHM FOR COMPUTING THE EIGENVALUES OF A SYMMETRIC TRIDIAGONAL MATRIX ILAN BAR-ON
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1995/LPCR9501.ps.Z, 19950302 We then form a matrix T (s) i using the extreme rows T (s) i = b(s) i v(s) i y(s) i y(s) i w(s) i b(s) i+1 Similarly, for i = 1, let T (s) 1;0 = X(s 1) 1 T (s 1) 2 B B x2s 1 b(s 1) 2 b(s 1) 2 v(s 1) 2 y(s 1) 2 y(s 1) 2 w(s 1) 2 b(s 1) 3
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/cis9418.ps.Z, 19950308 References 39 Winston, P. H. Learning structural descriptions from examples. In The Psychology of Computer Vision (1975), P. H. Winston, Ed., McGraw-Hill, pp. 157209. Witkin, A. P., and Tenenbaum, J. M. On the role of structure in vision. In Human and Machine Vision, J. Beck, B. Hope, and A.
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1995/cs854.ps.gz, 19950403 Monochromatic Paths and Triangulated Graphs Shimon Even Ami Litman Arnold L. Rosenberg#
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1995/cs855.ps.gz, 19950403 Optimal Mistake Bound Learning is Hard Moti Frances IBM Israel, Science and Technology MATAM, Haifa 31905, Israel Ami Litmany Department of Computer Science Technion, Haifa 32000, Israel
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1995/cs853.ps.gz, 19950403 Computing with Snakes in Directed Networks of Automata Shimon Even, Ami Litman and Peter Winkler**
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1995/cs852.ps.Z, 19950413 Optimal Layouts on a Chain ATM Network Ornan Gerstel Avishai Wooly Shmuel Zaksz
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/cs842.ps.Z, 19950413 A Known Plaintext Attack on the PKZIP Stream Cipher Eli Biham Paul C. Kocher
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1995/cis9510.ps.gz, 19950524 The Active Vision Shell Jeffrey A. Fayman 1 Ehud Rivlin1 Henrik I. Christensen2 1Department of Computer Science Israel Institute of Technology { Technion Haifa, Israel 2Laboratory of Image Analysis, Aalborg University Aalborg East, Denmark
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1995/cis9504.ps.Z, 19950525 CIS 9502 Editor Shaul Markovitch: Proceedings of the 11th Israeli Symposium on Artificial Intelligence", January 1995. CIS 9503 A.M. Bruckstein, E. Rivlin and I. Weiss: Scale Space Local Invariants", February 1995. CIS 9505 I. Kamon and E. Rivlin: Sensory Based Motion Planning with Global Proofs",
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/cs824.ps.Z, 19950606 TWO-LEVEL ANALYSIS OF AUTOMATIC MULTIGRID FOR NON-NORMAL AND INDEFINITE PROBLEMS Yair Shapira Computer Science Department, Technion Israel Institute of Technology, Haifa 32000, Israel. SUMMARY A two-level analysis method for several automatic multigrid methods (implemented with the red-black smoother)
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1995/cis9515.ps.Z, 19950712 Acknowledgements We thank Noga Alon, Estie Arkin, Guy Even, Joe Mitchell, Seffi Naor and Satish Rao for helpful discussions and comments on the topic of this paper. References K. Akeley, P. Haeberli, and D. Burns. C program on SGI machines in /usr/people/4Dgifts/iristools/libgutil/tomesh.c. 1990.
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1995/cs862.ps.Z, 19950716 Computational Complexity and Knowledge Complexity Oded Goldreichy Rafail Ostrovskyz Erez Petrankx July 13, 1995
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1995/cs861.ps.Z, 19950716 M. Jerrum, L. Valiant and V. Vazirani. Random Generation of Combinatorial Structures from a Uniform Distribution. Theoretical Computer Science 43, 169-188 (1986). C. Lund, L. Fortnow, H. Karloff and N. Nisan. Algebraic Methods for Interactive Proof Systems. Proceedings of the 31st Annual IEEE
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1995/cs851.ps.Z, 19950808 COLORING UPDATE METHODS Yair Shapira Computer Science Department, Technion Israel Institute of Technology, Haifa 32000, Israel.
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1994/lpcr9415.ps.Z, 19950816 Dynamic Maintenance of the Virtual Path Layout Ornan Gerstel and Adrian Segall Computer Science Department Technion, Israel Institute of Technology Haifa 32000, Israel E-mail: orig@csc.cs.technion.ac.il, segall@cs.technion.ac.il
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1995/cs865.ps.Z, 19950903 References 10 R. Z. Norman and M. O. Rabin, An algorithm for a Minimum cover of a Graph, Proc. Amer. Math. Soc. 10 (1959) 31519. P. M.Vaidya, Geometry helps in matching, SIAM J. Comput. 18 (1989) 1201225 Bottleneck-Matching September 3, 1995 References 9 L.P. Chew and K. Kedem,
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1995/cs864.ps.Z, 19950903 Parallelizable Approximate Solvers for Recursions Arising in Preconditioning Yair Shapira
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1995/cis9517.ps.Z, 19950913 A New Range-Sensor Based Globally Convergent Navigation Algorithm for Mobile Robots Ishay Kamon Dept. of Computer Science Technion Elon Rimon Dept. of Mechanical Engineering Technion Ehud Rivlin Dept. of Computer Science Technion September 5, 1995
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1995/cis9526.ps.Z, 19951030 To Push or Not to Push - Part II Practical Pushing Planning for Rearrangement Tasks Ohad Ben Shahar Ehud Rivlin Center for Intelligent Systems Department of Computer Science Technion Israel Institute of Technology Haifa, Israel @cs.technion.ac.il
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1995/cis9516.ps.Z, 19951030 To Push or Not to Push - Part I On the Rearrangement of Movable Objects by a Mobile Robot Ohad Ben-Shahar Ehud Rivlin Center of Intelligent Systems Department of Computer Science Technion Israel Institute of Technology Haifa, Israel Email: @cs.technion.ac.il
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1995/cs875.ps.gz, 19951207 Two Practical and Provably Secure Block Ciphers: BEAR and LION Ross Anderson1 and Eli Biham2 1 Cambridge University, England; email rja14@cl.cam.ac.uk 2 Technion, Haifa, Israel; email biham@cs.technion.ac.il
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1995/lpcr9503.ps.Z, 19951225 Apr 1995. Concurrent and Distributed Programming Lab. Computer Science, Technion. PARC SIMULATOR ON WINDOWS-NT by Ayal Itzkovitz Supervised By Dr. Assaf Schuster - 2 - Table Of Contents TABLE OF CONTENTS
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1995/lpcr9506.ps.Z, 19951225 Millepede: Easy Parallel Programming in Available Distributed Environments Roy Friedmanz Maxim Goldiny Ayal Itzkovitzy Assaf Schustery
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1995/lpcr9507.PS.gz, 19960117 Environmental Acquisition \| A New Inheritance Mechanism Joseph Gil David H. Lorenz The Faculty of Computer Science, Technion\|Israel Institute of Technology, Technion City, Haifa 32000, ISRAEL; Email: f yogi j david g @CS.Technion.AC.IL LPCR Report #9507 December 1995
	ftp://ftp.cs.technion.ac.il/pub/Tech_Reports/1996/lowbnd-fin.ps, 19960605 A Lower Bound for Linear Interval Routing (Extended Abstract) T. Eilam, S. Moran and S. Zaks Department of Computer Science Technion, Haifa, Israel