Browse

ftp://ftp.wisdom.weizmann.ac.il (124)

	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps93/93-15.ps.Z, 19940426 Random walks on regular and irregular graphs Don Coppersmith Uriel Feige y James Shearer z April 26, 1994
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps93/93-01.ps.Z, 19940426 Derandomized Graph Products Preliminary Version Uriel Feige David Zuckermany April 26, 1994
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps93/93-07.ps.Z, 19940426 Generating Low-Degree 2-Spanners Guy Kortsarz David Peleg y April 14, 1993
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps93/93-08.ps.Z, 19940426 A tight upper bound on the cover time for random walks on graphs Uriel Feige April 26, 1994
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps93/93-19.ps.Z, 19940426 A Tight Lower Bound on the Cover Time for Random Walks on Graphs (Preliminary version) Uriel Feige April 26, 1994
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps93/93-20.ps.Z, 19940426 Collecting Coupons on Trees, and the Analysis of Random Walks (Preliminary version) Uriel Feige April 26, 1994
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps93/93-02.ps.Z, 19940426 Embedding Techniques for Distributed Dictionaries Karni Gilon (Ziegler) David Peleg y February 18, 1993
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps93/93-03.ps.Z, 19940426 Compact Deterministic Distributed Dictionaries Karni Gilon (Ziegler) David Peleg y February 18, 1993
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps94/94-06.ps.Z, 19940427 On the Theory of Interconnection Networks for Parallel Computers Eli Upfal Department of Applied Mathematics The Weizmann Institute of Science Rehovot, Israel and IBM Almaden Research Center San Jose, California
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps94/94-07.ps.Z, 19940428 Crumbling Walls: A Class of High Availability Quorum Systems David Peleg Avishai Wooly March 7, 1994
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps93/93-13.ps.Z, 19940428 Generation of Natural-Looking 3D Shapes by Simulated Evolution Florin Manolache1;2 and Shimon Edelman1 1 The Weizmann Institute of Science, Department of Applied Mathematics, Rehovot 76100, Israel 2 University Al. I. Cuza", Faculty of Physics, Department of Electronics, Iasi 6600, Romania Running head:
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps93/93-04.ps.Z, 19940428 On the Structural Simplicity of Machines and Languages Yael Moscowitz Ehud Shapiro Department of Applied Mathematics and Computer Science The Weizmann Institute of Science Rehovot 76100, Israel E-mail: yaels@wisdom.weizmann.ac.il, udi@wisdom.weizmann.ac.il February 1993
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps93/93-09.ps.Z, 19940428 Representation with receptive fields: gearing up for recognition Yair Weiss Dept. of Brain and Cognitive Sciences MIT E15-384C Cambridge, MA 02139 yweiss@media.mit.edu Shimon Edelman Dept. of Applied Mathematics and Computer Science The Weizmann Institute of Science Rehovot 76100, Israel
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps94/94-02.ps.Z, 19940428 Representation of similarity in 3D object discrimination Shimon Edelman Dept. of Applied Mathematics and Computer Science The Weizmann Institute of Science Rehovot 76100 Israel edelman@wisdom.weizmann.ac.il
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps93/93-10.ps.Z, 19940428 Representation, Similarity, and the Chorus of Prototypes Shimon Edelman Dept. of Applied Mathematics and Computer Science The Weizmann Institute of Science Rehovot 76100, Israel Internet: edelman@wisdom.weizmann.ac.il December 22, 1993
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps93/93-18.ps.Z, 19940428 Randomized Routing With Shorter Paths Eli Upfal Sergio Felepriny Marc Snirz February 28, 1993
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps93/abs93.ps.Z, 19940428 THE WEIZMANN INSTITUTE OF SCIENCE DEPARTMENT OF APPLIED MATHEMATICS AND COMPUTER SCIENCE POB 26, 76100 REHOVOT ISRAEL April 26, 1994 List of Abstracts \| 1993 Technical Reports Following are abstracts of the technical reports in Computer Science at the Weizmann Institute during the year 1993. Reports can
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps94/94-05.ps.Z, 19940428 the electronic journal of combinatorics 1 (1994) 13 Conversely, assume that G has an even kernel K of size A <= jKj <= C. None of the vertices labeled p can be labeled, for otherwise we would already have a kernel of size >= 39m + 6n + 3 > C. Now suppose that at most one of the ignition buses is marked,
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps93/93-05.ps.Z, 19940428 A Theory of Wormhole Routing in Parallel Computers Sergio Felperin Prabhakar Raghavan y Eli Upfal z November 21, 1993
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps93/93-17.ps.Z, 19940428 The Availability of Quorum Systems David Peleg Avishai Wooly November 11, 1993
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps93/93-22.ps.Z, 19940428 Spatial Context in Recognition Moshe Bar Shimon Ullman Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot 76100, Israel. December 18, 1993
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps93/93-21.ps.Z, 19940511 Face Recognition: the Problem of Compensating for Changes in Illumination Direction Yael Adini, Yael Moses, and Shimon Ullman Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot 76100, Israel. e-mail: yael@wisdom.weizmann.ac.il May 9, 1994
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps93/93-14.ps.Z, 19940511 Generalization to Novel Images in Upright and Inverted Faces Yael Moses Shimon Ullman Shimon Edelman Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot 76100, Israel. May 10, 1994
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps94/94-10.ps.Z, 19940518 Distance Metric between 3D Models and 2D Images for Recognition and Classification Ronen Basri Dept. of Applied Math The Weizmann Inst. of Science Rehovot 76100, Israel Internet: ronen@wisdom.weizmann.ac.il Daphna Weinshally Institute of Computer Science The Hebrew University of Jerusalem 91904
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps93/93-16.ps.Z, 19940519 Randomized Graph Drawing with Heavy-Duty Preprocessing David Harel and Meir Sardas Dept. of Applied Mathematics and Computer Science The Weizmann Institute of Science, Rehovot, Israel fharel,meirsg@wisdom.weizmann.ac.IL May 19, 1994
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps93/93-11.ps.Z, 19940519 Optimal File Sharing in Distributed Networks Moni Naory Ron M. Rothz
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps93/93-12.ps.Z, 19940519 Efficient Cryptographic Schemes Provably as Secure as Subset Sum Russell Impagliazzo Department of Computer Science University of California at San Diego La Jolla, CA 92093 USA Moni Naor Department of Applied Math and Computer Science Weizmann Institute Rehovot 76100, Israel July 7, 1993
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps94/94-09.ps.Z, 19940519 Complexity Results for Multi-Pebble Automata and their Logics Noa Globerman and David Harely
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps94/94-04.ps.Z, 19940519 Learning to Grasp Using Visual Information Ishay Kamon, Tamar Flash, Shimon Edelman Dept. of Applied Mathematics and Computer Science The Weizmann Institute of Science Rehovot 76100, Israel Internet: ishay@isaac.cs.technion.ac.il tamar@wisdom.weizmann.ac.il edelman@wisdom.weizmann.ac.il May 18, 1994
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps93/93-06.ps.Z, 19940519 0in 1.05 1 How much can hardware help routing Extended Abstract Allan Borodin Prabhakar Raghavany Baruch Schieber y Eli Upfalz April 21, 1994
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps94/94-03.ps.Z, 19940519 Tiny Families of Functions with Random Properties: A Quality{Size Trade{off for Hashing (Preliminary Version) Oded Goldreich Department of Applied Mathematics and Computer Science Weizmann Institute of Science Rehovot, Israel. Avi Wigdersony Institute for Computer Science Hebrew University Jerusalem,
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps94/94-01.ps.Z, 19940522 3D Distance Metric for Pose Estimation and Object Recognition from 2D Projections Yacov Hel-Or The Weizmann Institute of Science Dept. of Applied Mathematics and Computer Science Rehovot 76100, ISRAEL email:toky@wisdom.weizmann.ac.il
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps94/94-11.ps.Z, 19940602 Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions Noga Alon y Moni Naor z
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps94/94-13.ps.Z, 19940609 Observations on Hot Potato Routing Uriel Feige June 9, 1994
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps94/94-14.ps.Z, 19940619 Visual Cryptography Moni Naor and Adi Shamir Department of Applied Math and Computer Science, Weizmann Institute, Rehovot 76100, Israel. e-mail: fnaor,shamirg@wisdom.weizmann.ac.il
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps94/94-15.ps.Z, 19940831 More on Nonregular PDL: Expressive Power, Finite Models, Fibonacci Programs David Harel and Eli Singerman Dept. of Applied Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot, ISRAEL August 22, 1994
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps94/94-16.ps.Z, 19940831 SCENIC TRAILS ASCENDING FROM SEA-LEVEL NIM TO ALPINE CHESS1 Aviezri S. Fraenkel Department of Applied Mathematics and Computer Science Weizmann Institute of Science Rehovot 76100, Israel fraenkel@wisdom.weizmann.ac.il
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps94/94-17.ps.Z, 19940901 The Weizmann Workshop on Probabilistic Proof Systems January 10-13, 1994 Uriel Feige Shafi Goldwasser (Editors)
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps94/94-12.ps.Z, 19940901 Localization and Homing using Combinations of Model Views Ronen Basri Dept. of Applied Math The Weizmann Institute of Science Rehovot 76100, Israel Internet: ronen@wisdom.weizmann.ac.il Ehud Rivliny Computer Science Dept. Technion Haifa 32000, Israel Internet: ehudr@cs.technion.ac.il
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps94/94-18.ps.Z, 19940919 Error Correcting Codes and Combinatorial Games Aviezri S. Fraenkel Department of Applied Mathematics & Computer Science The Weizmann Institute of Science Rehovot 76100, Israel Email: fraenkel@wisdom.weizmann.ac.il
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps94/94-19.ps.Z, 19941003 Paraperspective Affine Ronen Basri Dept. of Applied Math The Weizmann Institute of Science Rehovot 76100, Israel ronen@wisdom.weizmann.ac.il
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps94/94-22.ps.Z, 19941027 An Approximation Algorithm for Minimum-Cost Network Design Yishay Mansour David Peleg y October 27, 1994
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps94/94-23.ps.Z, 19941124 How Many Squares Must a Binary Sequence Contain Aviezri S. Fraenkel1 and R. Jamie Simpson2
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps94/94-25.ps.Z, 19941227 Computational Experience with Approximation Algorithms for the Set Covering Problem Tal Grossman Avishai Wooly December 27, 1994
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps94/94-21.ps.Z, 19950104 A High-School Program in Computer Science Judith Gal-Ezer Catriel Beeriy David Harelz Amiram Yehudaix
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps95/95-02.ps.Z, 19950126 Generalization from a single view in face recognition Maria Lando Shimon Edelmany Department of Applied Mathematics and Computer Science The Weizmann Institute of Science Rehovot 76100, Israel y edelman@wisdom.weizmann.ac.il January 25, 1995
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps95/95-03.ps.Z, 19950131 The Load, Capacity and Availability of Quorum Systems Moni Naory Avishai Woolz January 22, 1995
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps95/95-04.ps.Z, 19950201 Rigorous Time/Space Tradeoffs for Inverting Functions Amos Fiaty Moni Naor z
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps95/95-05.ps.Z, 19950212 Local Computations on Static and Dynamic Graphs Alain Mayery Moni Naor z Larry Stockmeyer x
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps95/95-06.ps.Z, 19950226 Balanced Allocations (Extended abstract) Y. Azar A. Z. Brodery A. R. Karliny E. Upfalz
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps95/95-01.ps.Z, 19950226 Explorations of shape space Florin Cutzu and Shimon Edelman Dept. of Applied Mathematics and Computer Science The Weizmann Institute of Science Rehovot 76100, Israel florin@wisdom.weizmann.ac.il, edelman@wisdom.weizmann.ac.il January 27, 1995
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps95/95-08.ps.Z, 19950226 Efficient Routing in All-Optical Networks Prabhakar Raghavan Eli Upfaly
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps95/95-07.ps.Z, 19950226 The worst-case running time of the random simplex algorithm is exponential in the height Andrei Z. Broder1;2 Martin E. Dyer2;3 Alan M. Frieze2;4 Prabhakar Raghavan2;5 Eli Upfal6 February 26, 1995
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps95/95-09.ps.Z, 19950309 The Weizmann Institute of Science Department of Applied Mathematics and Computer Science P.O.B. 26, Rehovot, 76100, Israel FAX: +972-8-344-122 E-mail: zasl@wisdom.weizmann.ac.il Multiscale Algorithm for Atmospheric Data Assimilation Part I. Multiscale Iterative Process Achi BRANDT and Leonid Yu.
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps95/95-12.ps.Z, 19950328 The Power of Small Coalitions in Graphs D. Peleg March 28, 1995
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps95/95-10.ps.Z, 19950329 Bandwidth Allocation with Preemption Amotz Bar-Noyy Ran Canettiz Shay Kutten Yishay Mansourx Baruch Schieber March 28, 1995
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps95/95-13.ps.Z, 19950330 OBDD's LTL MC Model Checking of Linear TL, Using OBDD's Y. Kesten A. Pnueli L. Raviv Weizmann Institute of Sciencesy January 22, 1995
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps95/95-14.ps.Z, 19950403 Quantifying Knowledge Complexity Oded Goldreichy Erez Petrankz March 30, 1995
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps94/94-24.ps.Z, 19950406 Fault-Local Distributed Mending Shay Kutten David Peleg y November 28, 1994
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps95/95-11.ps.Z, 19950409 On Similarity to Prototypes in 3D Object Representation Sharon Duvdevani-Bar Shimon Edelman Dept. of Applied Mathematics and Computer Science The Weizmann Institute of Science Rehovot 76100, Israel @wisdom.weizmann.ac.il April 9, 1995
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps95/95-15.ps.Z, 19950427 Recognition by Prototypes Ronen Basri Dept. of Applied Math The Weizmann Institute of Science Rehovot 76100, Israel e-mail: ronen@wisdom.weizmann.ac.il
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps95/95-17.ps.Z, 19950514 The Hardness of Minimum Capacity Network Design David Peleg y and Herzl Regev z May 11, 1995
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps95/95-18.ps.Z, 19950530 Stochastic Contention Resolution With Short Delays Prabhakar Raghavan Eli Upfaly May 30, 1995
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps95/95-19.ps.Z, 19950614 Access Control and Signatures via Quorum Secret Sharing Moni Naor Avishai Wooly June 5, 1995
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps94/94-08.ps.Z, 19950625 Towards a Theory of Recursive Structures David Harel Dept. of Applied Mathematics and Computer Science The Weizmann Institute of Science, Rehovot, Israel harel@wisdom.weizmann.ac.il
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps95/95-20.ps.Z, 19950706 Pricing via Processing or Combatting Junk Mail Cynthia Dwork Moni Naor y
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps95/95-21.ps.Z, 19950727 Knowledge, Timed Precedence and Clocks Yoram Mosesy Ben Bloomz July 27, 1995
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps95/95-22.ps.Z, 19950727 The Weight of the Greedy Graph Spanner Herzl Regev July 15, 1995
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps95/95-23.ps.Z, 19950821 Synthesizers and Their Application to the Parallel Construction of Pseudo-Random Functions Moni Naor y Omer Reingold y
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps95/95-25.ps.Z, 19950823 Information Retrieval from Annotated Texts with Applications to Hypertexts Aviezri S. Fraenkel Dept. of Applied Math. & CS The Weizmann Institute of Science Rehovot 76100, Israel Shmuel T. Klein Dept. of Math. & CS Bar Ilan University Ramat-Gan 52900, Israel August 23, 1995
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps95/95-26.ps.Z, 19950906 MORE ON COUNTING SEQUENCES Victor Bronstein and Aviezri S. Fraenkel This note can be viewed as a logical continuation of our previous Note published earlier in the Monthly . We shall repeat here, briefly, its main results to make the reading easier. A counting sequence S is a sequence of sequences
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps95/95-28.ps.Z, 19950906 An Efficient Existentially Unforgeable Signature Scheme and its Applications Cynthia Dwork Moni Naor y
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps95/95-27.ps.Z, 19950906 Non-Malleable Cryptography Danny Dolev Cynthia Dworky Moni Naorz
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps95/95-29.ps.Z, 19950928 Receptive Fields for Vision: from Hyperacuity to Object Recognition Shimon Edelman Dept. of Applied Mathematics and Computer Science The Weizmann Institute of Science Rehovot 76100, ISRAEL http://eris.wisdom.weizmann.ac.il/~edelman September 28, 1995
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps95/95-30.ps.Z, 19951017 Defaults and Relevance in Model Based Reasoning Roni Khardony Dan Rothz September 29, 1995
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps95/95-32.ps.Z, 19951106 Error reduction by parallel repetition { the state of the art (Preliminary version) Uriel Feige November 5, 1995
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps95/95-33.ps.Z, 19951203 Recognition Using Region Correspondences Ronen Basri Department of Applied Math. The Weizmann Inst. of Science Rehovot, 76100, Israel ronen@wisdom.weizmann.ac.il David Jacobs NEC Research Institute 4 Independence Way Princeton, NJ 08540, USA dwj@research.nj.nec.com
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps95/95-34.ps.Z, 19951205 On limited versus polynomial nondeterminism Uriel Feige Joe Kiliany December 5, 1995
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps94/abs94.ps, 19951212 THE WEIZMANN INSTITUTE OF SCIENCE DEPARTMENT OF APPLIED MATHEMATICS AND COMPUTER SCIENCE POB 26, 76100 REHOVOT ISRAEL December 12, 1995 List of Abstracts \| 1994 Technical Reports Following are abstracts of the technical reports in Computer Science at the Weizmann Institute during the first half of the
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps95/95-16.ps.Z, 19960101 On Graphs of Large Girth Herzl Regev y April 11, 1995
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps96/96-01.ps.Z, 19960102 A Stuttering-Robust Temporal Logic with Next" but without Previous" Monica Marcus and Amir Pnueli Weizmann Institute of Sciencey January 1, 1996
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps96/96-02.ps.Z, 19960111 Optimal Availability Quorum Systems: Theory and Practice Yair Amir Avishai Wooly January 9, 1996
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps96/96-03.ps.Z, 19960310 Perfect Zero-Knowledge Arguments for NP Using any One-Way Permutation Moni Naory Rafail Ostrovskyz Ramarathnam Venkatesanx Moti Yung{ March 8, 1996
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps95/abs95.ps, 19960314 THE WEIZMANN INSTITUTE OF SCIENCE DEPARTMENT OF APPLIED MATHEMATICS AND COMPUTER SCIENCE POB 26, 76100 REHOVOT ISRAEL March 14, 1996 List of Abstracts \| 1995 Technical Reports Following are abstracts of the technical reports in Computer Science at the Weizmann Institute as they appear during the year
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps96/96-05.ps.Z, 19960331 Similarity-based Word Sense Disambiguation Yael Karov and Shimon Edelman Dept. of Applied Mathematics and Computer Science The Weizmann Institute of Science Rehovot 76100, Israel @wisdom.weizmann.ac.il March 31, 1996
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps96/96-06.ps.Z, 19960505 More about Recursive Structures: Descriptive Complexity and Zero-One Laws Tirza Hirst David Harely
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps96/96-07.ps.Z, 19960522 On Combinatorial Game Theory Foundations with Applications to Digraph Kernels Aviezri S. Fraenkel Department of Applied Mathematics and Computer Science Weizmann Institute of Science Rehovot 76100, Israel fraenkel@wisdom.weizmann.ac.il http://www.wisdom.weizmann.ac.il/ fraenkel/fraenkel.html
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps96/96-09.ps.Z, 19960716 Constancy and Similarity Ronen Basri Department of Applied Math. The Weizmann Inst. of Science Rehovot, 76100, Israel ronen@wisdom.weizmann.ac.il David Jacobs NEC Research Institute 4 Independence Way Princeton, NJ 08540, USA dwj@research.nj.nec.com
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps96/96-08.ps.Z, 19960721 Representation is Representation of Similarities Shimon Edelman Dept. of Applied Mathematics and Computer Science The Weizmann Institute of Science Rehovot 76100, Israel edelman@wisdom.weizmann.ac.il
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps96/96-10.ps.Z, 19960805 On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited (Preliminary Version) Moni Naor Omer Reingold y
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps96/96-11.ps.Z, 19960808 Graph Immunity Against Local Influence D. Peleg
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps96/96-12.ps.Z, 19960901 Local Majority Voting, Small Coalitions and Controlling Monopolies in Graphs: A Review D. Peleg y August 30, 1996
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps96/96-13.ps.Z, 19960917 Extracting Salient Curves from Images: An Analysis of the Saliency Network T. D. Alter MIT AI Laboratory 545 Technology Square, Room 751 Cambridge, MA 02139, USA tda@ai.mit.edu Ronen Basri Department of Applied Math. The Weizmann Inst. of Science Rehovot, 76100, Israel ronen@wisdom.weizmann.ac.il
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps96/abs96.ps, 19960917 THE WEIZMANN INSTITUTE OF SCIENCE DEPARTMENT OF APPLIED MATHEMATICS AND COMPUTER SCIENCE POB 26, 76100 REHOVOT ISRAEL September 17, 1996 List of Abstracts \| 1996 Technical Reports Following are abstracts of the technical reports in Computer Science at the Weizmann Institute as they appear during the
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps96/96-14.ps.Z, 19961013 An extension of Kaczmarz's projections method with relaxation parameter to inconsistent and rank defficient least-squares problems Constantin Popa Department of Applied Mathematics and Computer Science e-mail : constant@wisdom.weizmann.ac.il October 13, 1996 1
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps96/96-15.ps.Z, 19961015 Adjoining to Wythoff 's Game its P-positions as Moves Aviezri S. Fraenkel1 and Michal Ozery2
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps96/96-17.ps.Z, 19961016 1 NUMERICAL EXPERIMENTS WITH PRECONDITIONING BY GRAM MATRIX APPROXIMATION FOR NON-LINEAR ELLIPTIC EQUATIONS Gheoghe Juncu) and Constantin Popa) ) POLITEHNICA University Bucharest, Catedra de Inginerie Chimica Polizu 1 78126 Bucharest, Romania,e-mail: juncu@cael.pub.ro **)The Weizmann Institute of
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps96/96-18.ps.Z, 19961024 Extensions of block-projections methods with relaxation parameters to inconsistent and rank-defficient least-squares problems Constantin Popa Department of Applied Mathematics and Computer Science e-mail : constant@wisdom.weizmann.ac.il October 24, 1996 1
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps95/95-24.ps.Z, 19961028 An Algorithm for Straight-Line Drawing of Planar Graphs David Harel and Meir Sardasy Dept. of Applied Mathematics and Computer Science The Weizmann Institute of Science, Rehovot, Israel
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps96/96-16.ps.Z, 19961119 What (else) should CS educators know Judith Gal-Ezer David Harely
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps96/96-19.ps.Z, 19961210 Succesive orthogonal projections for exact computation of minimal norm solution of inconsistent and rank-defficient least-squares problems Constantin Popa Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science,Rehovot 76100,Israel email : constant@wisdom.weizmann.ac.il
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps96/96-20.ps.Z, 19961212 On Weak Circular Squares in Binary Words Aviezri S. Fraenkel1 and Jamie Simpson2
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps96/96-21.ps.Z, 19970105 GASP{II: A Geometric Algorithm Animation System for an Electronic Classroom Maria Shneerson and Ayellet Tal Department of Applied Mathematics and Computer Science The Weizmann Institute of Science Rehovot, Israel, 76100
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps95/95-31.ps.Z, 19970119 The STATEMATE Semantics of Statecharts David Harely and Amnon Naamadz October 1995; revised July 1996 ACM Trans. Soft. Eng. Method. 5:4 (Oct. 1996)
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps94/94-20.ps.Z, 19970211 Executable Object Modeling with Statecharts David Harel Eran Geryy Revised February, 1997. To appear in IEEE Computer (Early version in Proc. 18th Int. Conf. Soft. Eng., IEEE Press, March 1996, pp. 246{257.)
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps97/97-01.ps.Z, 19970330 On the Complexity of Verifying Concurrent Transition Systems David Harel1 and Orna Kupferman2 and Moshe Y. Vardi3 1 Department of Applied Math. & Computer Science, The Weizmann Institute, Rehovot 76100, Israel. Email: harel@wisdom.weizmann.ac.il 2 EECS Department, UC Berkeley, Berkeley CA 94720-1770,
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps97/97-04.ps.Z, 19970417 Characterization of the solutions set of least-squares problems by an extension of Kaczmarz's projections method Constantin Popa, Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science,Rehovot 76100,Israel email:constant@wisdom.weizmann.ac.il April 17, 1997 1
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps97/97-05.ps.Z, 19970429 Mesh independence principle for nonlinear equations on Hilbert spaces by preconditioning Constantin Popa, Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science,Rehovot 76100,Israel email:constant@wisdom.weizmann.ac.il April 29, 1997 1
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps97/97-06.ps.Z, 19970430 On the use of interactive proofs for formal program verification Uri Feige and Kobbi Nissim y Department of Computer Science and Applied Math The Weizmann Institute Rehovot 76100 Israel April 30, 1997
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps97/97-08.ps.Z, 19970603 Computation Paths Logic: An Expressive, yet Elementary, Process Logic David Harel and Eli Singerman Dept. of Applied Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot, ISRAEL
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps97/97-09.ps.Z, 19970701 Block-projections algorithms with blocks containing mutually orthogonal rows and columns Constantin Popa Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science,76100 Rehovot,Israel, e-mail : constant@wisdom.weizmann.ac.il July 1, 1997 1
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps97/97-10.ps.Z, 19970713 Polylogarithmic Approximation for Minimum Communication Spanning Trees David Peleg
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps97/97-11.ps.Z, 19970715 Preconditioned Kaczmarz-Extended algorithm with relaxation parameters Constantin Popa Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science,76100 Rehovot,Israel, e-mail : constant@wisdom.weizmann.ac.il July 15, 1997 1
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps97/97-12.ps.Z, 19970727 Protein Folding, Spin Glass and Computational Complexity1 Aviezri S. Fraenkel2
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps97/97-07.ps.Z, 19970807 How Many Squares Can a String Contain Aviezri S. Fraenkel1 and Jamie Simpson2
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps97/97-15.ps.Z, 19970903 On the Algorithmics of Higraphs Ornit Grossman and David Harely Dept. of Applied Mathematics and Computer Science The Weizmann Institute of Science, Rehovot, Israel
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps97/97-16.ps.Z, 19970908 On the densest k-subgraph problem Uriel Feige and Michael Seltser Department of Applied Math and Computer Science The Weizmann Institute Rehovot, Israel September 8, 1997
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps97/97-18.ps.Z, 19970910 Efficient Determination of Shape from Multiple Images Containing Partial Information Ronen Basri Department of Applied Math. The Weizmann Institute of Science Rehovot, 76100, Israel ronen@wisdom.weizmann.ac.il Adam Grove and David Jacobs NEC Research Institute 4 Independence Way Princeton, NJ 08540, USA
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps97/97-17.ps.Z, 19970910 When Is It Possible to Identify 3D Objects from Single Images Using Class Constraints Ronen Basri and Yael Moses Dept. of Applied Math The Weizmann Inst. of Science Rehovot, 76100, Israel Category: Object Recognition and Indexing
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps97/97-19.ps.Z, 19971106 Completion Energies and Scale Eitan Sharon, Achi Brandt , Ronen Basriy Dept. of Applied Math The Weizmann Inst. of Science Rehovot, 76100, Israel November 6, 1997
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps97/97-20.ps.Z, 19971111 How Far Can Nim in Disguise be Stretched Uri Blass Electrical Engineering Tel Aviv University Ramat Aviv 61391, Israel Aviezri S. Fraenkel Applied Mathematics and Computer Science Weizmann Institute of Science Rehovot 76100, Israel Romina Guelman Institute of Mathematics Hebrew University of Jerusalem
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps97/97-21.ps.Z, 19971119 The Exact Number of Squares in Fibonacci Words Aviezri S. Fraenkel1 and Jamie Simpson2
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps97/97-23.ps.Z, 19980111 Proximity-Preserving Labeling Schemes David Peleg December 4, 1997
	ftp://ftp.wisdom.weizmann.ac.il/pub/CSreports/reps97/97-24.ps.Z, 19980125 Verifying Out-of-Order Executions W. Dammy A. Pnueliz June 4, 1997