Browse

ftp://cs.nyu.edu (229)

	ftp://cs.nyu.edu/pub/tech-reports/tr539.ps.Z, 19910215 The APRAM { The Rounds Complexity Measure and the Explicit Costs of Synchronization Richard Cole Ofer Zajicek New York University
	ftp://cs.nyu.edu/pub/tech-reports/tr546.ps.Z, 19910215 An Asynchronous Parallel Algorithm for Undirected Graph Connectivity Richard Cole Ofer Zajicek New York University
	ftp://cs.nyu.edu/pub/tech-reports/tr512.ps.Z, 19910215 Tight bounds on the complexity of the Boyer-Moore string matching algorithm Richard Coley
	ftp://cs.nyu.edu/pub/tech-reports/tr548.ps.Z, 19910301 Randomized Parallel Algorithms for Trapezoidal Diagrams Kenneth L. Clarkson AT&T Bell Labs Richard Cole Courant Institute New York University Robert E. Tarjany Princeton University and NEC Research Institute
	ftp://cs.nyu.edu/pub/tech-reports/tr547-R244.ps.Z, 19910311 Some Constructions in Rings of Differential Polynomials Giovanni Gallo and Bhubaneswar Mishra Courant Institute of Mathematical Sciences New York University, NY USA. March 11, 1991 Introduction In the recent years, motivated by the success of various algorithms and techniques in computational algebraic
	ftp://cs.nyu.edu/pub/tech-reports/tr549-R245.ps.Z, 19910319 SINGULARITY DETECTION AND PROCESSING WITH WAVELETS Stephane Mallat and Wen Liang Hwang Courant Institute of Mathematical Sciences New York University, New York, NY 10012 Technical Report March 1991
	ftp://cs.nyu.edu/pub/tech-reports/tr542-U170.ps.Z, 19910408 A Compiler-Assisted Approach to SPMD Execution Ron Cytron Jim Lipkisy Edith Schonbergz
	ftp://cs.nyu.edu/pub/tech-reports/tr486-U167.ps.Z, 19910409 <=(P ) P P:
	ftp://cs.nyu.edu/pub/tech-reports/tr557.ps.Z, 19910411 On the Detection of Robust Curves Richard Cole Courant Institute New York University Uzi Vishkiny University of Maryland & Tel Aviv University April 11, 1991
	ftp://cs.nyu.edu/pub/tech-reports/tr553.ps.Z, 19910418 References Bourdon, O. and G. Medioni. Object recognition using geometric hashing on the Connection Machine". In Proceedings of the International Conference on Patern Recognition, pages 59600, Atlantic City, June 1990. Chin, R. and C. Dyer. Model-based recognition in robot vision". ACM
	ftp://cs.nyu.edu/pub/tech-reports/tr552-2.ps.Z, 19910419 Chapter 3 LALR(k) Lookahead Sets with Varying-Length Strings Perhaps the most important reason for using LALR(k) grammars is that they allow the user to express certain syntactic constructs in a more intuitive manner. To motivate the importance of this observation, consider the grammar of Figure 3.1(a).
	ftp://cs.nyu.edu/pub/tech-reports/tr552-1.ps.Z, 19910419 A Practical method for Constructing Efficient LALR(k) Parsers with Automatic Error Recovery Philippe Charles May 1991 A dissertation in the Department of Computer Science submitted to the faculty of the Graduate School of Arts and Science in partial fulfillment of the requirements for the degree of
	ftp://cs.nyu.edu/pub/tech-reports/tr552-3.ps.Z, 19910419 Chapter 4 LALR(k) Parser and Error Recovery 4.1 Overview 4.1.1 The Parsing Framework An LR parsing configuration has two components: a state stack and the remaining input tokens. This method assumes a framework in which the parser maintains a state stack, denoted state stack, and an input buffer
	ftp://cs.nyu.edu/pub/tech-reports/tr552-4.ps.Z, 19910419 Chapter 5 Table Optimization and Generation In general, one of the main objectives that must be achieved in generating parsing tables is that they must be time- and space-efficient. In addition, if the resulting parser must recover from input errors, the tables generated must retain enough important
	ftp://cs.nyu.edu/pub/tech-reports/tr552-5.ps.Z, 19910419 Appendix E Error Recovery Examples Erroneous Pascal and Ada programs were processed with the error recovery method de- scribed in this thesis. The first Pascal program was designed to demonstrate the effective- ness of the scope recovery. The second program was constructed from some interesting examples
	ftp://cs.nyu.edu/pub/tech-reports/tr558-R246.ps.Z, 19910430 On-Line Schedulers for Overloaded Real-time Systems G. Koren y B. Mishra y A. Raghunathan z D. Shasha y
	ftp://cs.nyu.edu/pub/tech-reports/tr554.ps.Z, 19910503 References Chin, R. and C. Dyer. Model-Based Recognition in Robot Vision". ACM Computing Surveys, 18(1):6708, March 1986. Hummel, R. and H. Wolfson. Affine Invariant Matching". In Proceedings of the DARPA Image Understanding Workshop, April 1988. Huttenlocher, D. P. and S. Ullman.
	ftp://cs.nyu.edu/pub/tech-reports/tr243-U109.ps.Z, 19910524 Note On The AKS Sorting Network (Expository note) by Richard Cole Colm O 'Du nlaing Ultracomputer Research Laboratory Courant Institute of Mathematical Sciences 715 Broadway, 10th Floor New York, NY 10003 Ultracomputer Note #109 Computer Science Department Technical Report #243 This work was supported
	ftp://cs.nyu.edu/pub/tech-reports/tr222-U102.ps.Z, 19910524 Parallel Ear Decomposition Search (EDS) And ST-Numbering In Graphs by Yael Maon 1 Baruch Schieber 1 , 3 Uzi Vishkin 1 , 2 , 3 Ultracomputer Research Laboratory Courant Institute of Mathematical Sciences 715 Broadway, 10th Floor New York, NY 10003 Ultracomputer Note #102 Computer Science Department
	ftp://cs.nyu.edu/pub/tech-reports/tr223-U103.ps.Z, 19910524 Tight Comparison Bounds On The Complexity Of Parallel Sorting by Yossi Azar1 Uzi Vishkin2 Ultracomputer Research Laboratory Courant Institute of Mathematical Sciences 715 Broadway, 10th Floor New York, NY 10003 Ultracomputer Note #103 Computer Science Department Technical Report #223 February, 1986 1
	ftp://cs.nyu.edu/pub/tech-reports/tr221-U101.ps.Z, 19910524 Efficient Parallel And Serial Approximate String Matching by Gad M. Landau1, 3 Uzi Vishkin2, 3 Ultracomputer Note #101 Computer Science Department Technical Report #221 February, 1986 1 Department of Computer Science, School of Mathematical Sciences, Tel Aviv University 2 Department of Computer Science,
	ftp://cs.nyu.edu/pub/tech-reports/tr242-U108.ps.Z, 19910524 The Accelerated Centroid Decomposition Technique For Optimal Parallel Tree Evaluation In Logarithmic Time by Richard Cole Uzi Vishkin Ultracomputer Note #108 Computer Science Department Technical Report #242 September, 1986 Courant Institute. This research was supported in part by NSF grant DCR-84-01633
	ftp://cs.nyu.edu/pub/tech-reports/tr569-R250.ps.Z, 19910618 Applications and Analysis of Probabilistic Techniques Prasad V. Tetali October 1991 A dissertation in the Department of Computer Science submitted to the faculty of the Graduate School of Arts and Science in partial fulfillment of the requirements for the degree of Doctor of Philosophy at New York
	ftp://cs.nyu.edu/pub/tech-reports/tr573.ps.Z, 19910801 Online Algorithms for Finger Searching Richard Cole Arvind Raghunathan y August 1, 1991
	ftp://cs.nyu.edu/pub/tech-reports/tr574.ps.Z, 19910821 The Expected Advantage of Asynchrony Richard Cole New York University Ofer Zajiceky Transarc Corporation
	ftp://cs.nyu.edu/pub/tech-reports/tr585.ps.Z, 19910923 BIBLIOGRAPHY 202 June 1987. Edith Schonberg and Edmond Schonberg. Highly Parallel Ada Ada on an Ultracomputer. In Ada in Use: Proceedings of the Ada International Conference, 1985. Special edition of Ada Letters, 5(2), September 1985. Dennis Shasha and Marc Snir. Efficient and Correct
	ftp://cs.nyu.edu/pub/tech-reports/tr589-R256.ps.Z, 19911125 A miniaturized active vision system Benjamin B. Bederson yz Richard S. Wallace y Eric L. Schwartz yzx yVision Applications, Inc. 611 Broadway #714 New York, NY 10012 zCourant Institute of Mathematical Sciences New York University 251 Mercer Street New York, NY 10012 xComputational Neuroscience
	ftp://cs.nyu.edu/pub/tech-reports/tr588-R255.ps.Z, 19911125 Space-variant Image Processing Richard S. Wallace y Ping-Wen Ong yz Benjamin B. Bederson yz Eric L. Schwartz yzx yVision Applications, Inc. 611 Broadway #714 New York, NY 10012 zCourant Institute of Mathematical Sciences New York University 251 Mercer Street New York, NY 10012 xComputational
	ftp://cs.nyu.edu/pub/tech-reports/tr601-R264.ps.Z, 19920416 A Miniature Pan-Tilt Actuator: the Spherical Pointing Motor Benjamin B. Bederson yz Richard S. Wallace z Eric L. Schwartz yzx yCourant Institute of Mathematical Sciences New York University 251 Mercer Street New York, NY 10012 zVision Applications, Inc. 611 Broadway #714 New York, NY 10012
	ftp://cs.nyu.edu/pub/tech-reports/tr607.ps.Z, 19920522 Submitted 5/18/92 to the SIAM Journal on Matrix Analysis and Applications GMRES/CR and Arnoldi/Lanczos as Matrix Approximation Problems Anne Greenbaum* Courant Institute of Mathematical Sciences 251 Mercer St. New York, NY 10012 greenbau@cims.nyu.edu Lloyd N. Trefetheny Department of Computer Science
	ftp://cs.nyu.edu/pub/tech-reports/tr612-R267.ps.Z, 19920715 REFERENCES 28 Out In ! In ! Out ! Out ! In In Articulation Point Articulation Point Figure 13: Impossibility of trifurcation. Christoph M Hoffmann. Geometric and Solid Modeling: An Introduction. Morgan Kaufmann Publishers, Inc., San Mateo, California, 94403, 1989. Robert A. Hummel and S.W.
	ftp://cs.nyu.edu/pub/tech-reports/tr611-R233.1.ps.Z, 19921016 A Miniature Space-Variant Active Vision System: Cortex-I Benjamin B. Bederson June 1992 A dissertation in the Department of Computer Science submitted to the faculty of the Graduate School of Arts and Sciences in partial fulfillment of the requirements for the degree of Doctor of Philosophy at New York
	ftp://cs.nyu.edu/pub/tech-reports/tr611-R266.2.ps.Z, 19921016 Chapter 5 Results 5.1 System architecture Cortex-I consists of a camera, actuator, camera driver, motor driver, video interface, telephone interface, and processors. The three processors communicate via high-speed serial interface. The flow of information between the modules (Figure 5.1) starts with
	ftp://cs.nyu.edu/pub/tech-reports/tr616.ps.Z, 19921029 Domain Decomposition Algorithms for the p-version Finite Element Method for Elliptic Problems Luca F. Pavarino Courant Institute of Mathematical Sciences New York University September 1992 A dissertation in the Department of Mathematics Submitted to the Faculty of the Graduate School of Arts and
	ftp://cs.nyu.edu/pub/tech-reports/tr624.ps.Z, 19930224 A Hybrid Algorithm for Optimizing Eigenvalues of Symmetric Definite Pencils Jean-Pierre A. Haeberly and Michael L. Overtony NYU Computer Science Dept. Technical Report 624 February 1993
	ftp://cs.nyu.edu/pub/tech-reports/tr625.ps.Z, 19930302 Using Line Invariants for Object Recognition by Geometric Hashing Frank Chee-Da Tsai Robotics Research Laboratory, Courant Institute of Mathematical Sciences, New York University 715 Broadway, 12FL New York, N.Y. 10003 tsai@robust.nyu.edu Technical Report No. 0625 Prepared January 1993; Revised February
	ftp://cs.nyu.edu/pub/tech-reports/tr630.ps.Z, 19930402 The Cell Programming Language 32 C.H. Waddington. Principles of Development and Differentiation. Macmillan Company, New York, 1966. The Cell Programming Language 31 Eric Mjolsness, David H. Sharp, and John Reinitz. A connectionist model of development. JTB, 152:429{453, 1991. P.C. Newell. Aggregation
	ftp://cs.nyu.edu/pub/tech-reports/tr632.ps.Z, 19930414 Highly Efficient Dictionary Matching in Parallel S. Muthukrishnany K. Palemz
	ftp://cs.nyu.edu/pub/tech-reports/tr633.ps.Z, 19930415 REFERENCES 32 Goldberg, editors, Neural Networks in Robotics, pages 34774. Kluwer Academic Publishers, 1992. Carl Weiman and George Chaikin. Logarithmic spiral grids for image processing and display. Computer Graphics and Image Processing, 11, 1979. Carl F. R. Weiman. 3-d sensing with polar
	ftp://cs.nyu.edu/pub/tech-reports/tr634.ps.Z, 19930415 REFERENCES 9 Takeo Kanade and Donald Schmitz. Development of cmu direct drive arm II. In Proceedings of the American Control Conference, pages 7039, June 1985. K. M. Lee, G. Vachtsevanos, and C.K. Kwan. Development of a spherical stepper motor wrist. In Proceedings of the 1988 IEEE
	ftp://cs.nyu.edu/pub/tech-reports/tr629.ps.Z, 19930416 TWO-LEVEL SCHWARZ METHODS FOR NONCONFORMING FINITE ELEMENTS AND DISCONTINUOUS COEFFICIENTS MARCUS SARKIS
	ftp://cs.nyu.edu/pub/tech-reports/tr636.ps.Z, 19930517 Voice-bandwidth visual communication through logmaps: The Telecortex Richard S. Wallace Benjamin B. Bederson Eric L. Schwartz Courant Institute of Bell Communications Cognitive and Mathematical Sciences Research Neural Systems New York University Morristown, NJ Boston University New York, NY Boston, MA
	ftp://cs.nyu.edu/pub/tech-reports/tr637.ps.Z, 19930518 Knowledge Preconditions for Plans Ernest Davis New York University New York, New York May 18, 1993
	ftp://cs.nyu.edu/pub/tech-reports/tr635.ps.Z, 19930519 A Language for Semantic Analysis Technical Report 635 May 1993 Jiazhen Cai New York University Department of Computer Science Courant Institute of Mathematical Science 251 Mercer Street, New York, NY 10012 A Language for Semantic Analysis Jiazhen Cai * New York University/Courant Institute New York, NY
	ftp://cs.nyu.edu/pub/tech-reports/tr638.ps.Z, 19930614 SCHWARZ ANALYSIS OF ITERATIVE SUBSTRUCTURING ALGORITHMS FOR ELLIPTIC PROBLEMS IN THREE DIMENSIONS MAKSYMILIAN DRYJA , BARRY F. SMITHy AND OLOF B. WIDLUNDz June 1, 1993 Dedicated to Professor Seymour Parter on the occasion of his sixty fifth birthday.
	ftp://cs.nyu.edu/pub/tech-reports/tr640.ps.Z, 19930628 A Probabilistic Approach to Geometric Hashing using Line Features Frank Chee-Da Tsai Robotics Research Laboratory, Courant Institute of Mathematical Sciences, New York University 715 Broadway, 12FL New York, N.Y. 10003 tsai@robust.nyu.edu Technical Report No. 640 June 1993
	ftp://cs.nyu.edu/pub/tech-reports/tr643.ps.Z, 19930805 82 NYU EDUCATIONAL ROBOT T. Tarn, A. Bejczy, and X. Yuan. Control of Two Coordinated Robots. In Proceedings of the IEEE International Conference on Robotics and Automation, pages 11931202, 1986. J.C. Trinkle, J.M. Abel, and R.P. Paul. Enveloping, Frictionless, Planar Grasping. In Proceedings
	ftp://cs.nyu.edu/pub/tech-reports/tr644-1.ps.Z, 19930810 BIBLIOGRAPHY 153 Joseph E. Stoy. Denotational Semantics: The Scotttrachey Approach to Programming Language Theory, volume 1 of The MIT Press Series in Computer Science. The MIT Press, 1977. Robert Endre Tarjan. Amortized computational complexity. SIAM Journal on Algebraic and Discrete
	ftp://cs.nyu.edu/pub/tech-reports/tr641.ps.Z, 19930810 Characterization of Self-Similar Multifractals with Wavelet Maxima Wen-Liang Hwang and Stephane Mallat 1 Technical Report 641 July 1993 Courant Institute of Mathematical Sciences Computer Science Department New York University 251 Mercer Street New York, NY 10012, USA
	ftp://cs.nyu.edu/pub/tech-reports/tr644-3.ps.Z, 19930810 108 CHAPTER 5. FULLY PERSISTENT ARRAYS FOR FUNCTIONAL PROGRAMS in Appendix B. Four sets of timing are shown: 1) where array updating is always done destructively, 2) where the fragmented shallow binding scheme is used, 3) where the shallow binding scheme is used, and 4) where the whole array is copied
	ftp://cs.nyu.edu/pub/tech-reports/tr644-2.ps.Z, 19930810 106 CHAPTER 5. FULLY PERSISTENT ARRAYS FOR FUNCTIONAL PROGRAMS Figure 5.5: Trace graphs of the read sequences of four programs. Note. The X{axis is for the step of the read sequence, and the Y{axis is for the distance between the current root node and the node to be read. Due to the large number of
	ftp://cs.nyu.edu/pub/tech-reports/tr619.ps.Z, 19930810 Matching Pursuit With Time-Frequency Dictionaries St ephane Mallat 1 and Zhifeng Zhang Technical Report 619 October 1992, revised in June 1993 To appear in IEEE Transactions in Signal Processing, in December 1993 Courant Institute of Mathematical Sciences Computer Science Department New York University
	ftp://cs.nyu.edu/pub/tech-reports/tr645.ps.Z, 19930823 Norms of Functions of Matrices Anne Greenbaum August, 1993
	ftp://cs.nyu.edu/pub/tech-reports/tr647.ps.Z, 19930922 Appendix 45 Theorem 5.21 Let U be a feasible augmented graph, with the blocks of BPQ-bridges: B1, B2, . . ., Bl. Then U does not have a pair of interlacing bights, if for all i (1 <= i <= l) UBi has no pair of interlacing bights. proof. Assume to the contrary. Then there exists a feasible U-Fragment
	ftp://cs.nyu.edu/pub/tech-reports/tr646.ps.Z, 19930922 Acknowledgement 31 N.P. Jouppi. Derivation of Signal Flow Direction in MOS VLSI. IEEE Trans. on Computer Aided Design of Integrated Circuits and Systems, CAD-6(3):48090, May 1987. K.J. Lee, R. Gupta, and M.A. Breuer. An Algorithmic Method for Assigning Signal Flow Directions to MOS
	ftp://cs.nyu.edu/pub/tech-reports/tr649.ps.Z, 19931015 Iterative Solution of Elliptic Finite Element Problems on Partially Refined Meshes and the Effect of Using Inexact Solvers Hsuanjen Cheng Courant Institute of Mathematical Sciences New York University October, 1993 A dissertation in the Department of Mathematics submitted to the faculty of the Graduate
	ftp://cs.nyu.edu/pub/tech-reports/tr650.ps.Z, 19931028 Section 4 Conclusion 37 M.F. Singer. Liuvillian Solutions of nth Order Linear Differential Equations," Am. J. Math., 1981. M.F. Singer. An Outline of Differential Galois Theory," Computer Algebra and Differential Equations, Academic Press, 1988. M.F. Singer. Formal Solutions of
	ftp://cs.nyu.edu/pub/tech-reports/tr653.ps.Z, 19931105 NYU Educational Robotics Project: A Pedagogic Overview B. Mishra, M. Antoniotti, F. Hansen and R. Wallace Robotics and Manufacturing Laboratory, Courant Institute of Mathematical Sciences, New York University, New York, NY 10012-1185. November 5, 1993 This report was partly supported by an NSF Grant #
	ftp://cs.nyu.edu/pub/tech-reports/tr651.ps.Z, 19931110 Miniature Direct Drive Rotary Actuators II: Eye, Finger and Leg Richard S. Wallace Courant Institute of Mathematical Sciences New York University
	ftp://cs.nyu.edu/pub/tech-reports/tr652.ps.Z, 19931110 Feedback Control of Miniature Direct Drive Devices David Max Richard S. Wallace Courant Institute of Mathematical Sciences New York University New York, NY
	ftp://cs.nyu.edu/pub/tech-reports/tr086-U100.ps.Z, 19940308 An Overview of the NYU Ultracomputer Project by Allan Gottlieb Ultracomputer Note #100 July, 1986 Revised: October 1986 Revised: April 1987 Revised: October 1987 This work was supported in part by the Applied Mathematical Sciences Program of the US Department of Energy under contract DE-AC02-76ER03077
	ftp://cs.nyu.edu/pub/tech-reports/tr654.ps.Z, 19940310 MULTILEVEL SCHWARZ METHODS WITH PARTIAL REFINEMENT HSUANJEN CHENG
	ftp://cs.nyu.edu/pub/tech-reports/tr661.ps.Z, 19940315 A POLYLOGARITHMIC BOUND FOR AN ITERATIVE SUBSTRUCTURING METHOD FOR SPECTRAL ELEMENTS IN THREE DIMENSIONS LUCA F. PAVARINO AND OLOF B. WIDLUNDy
	ftp://cs.nyu.edu/pub/tech-reports/tr658_fig.ps.Z, 19940316 -1 -0.8 -0.6 -0.4 -0.2 0.2 0.4 0.6 0.8 1 -1 -0.8 -0.6 -0.4 -0.2 0.2 0.4 0.6 0.8 1
	ftp://cs.nyu.edu/pub/tech-reports/tr658.ps.Z, 19940316 Stability Theory for Dissipatively Perturbed Hamiltonian Systems* John H. Maddocksy and Michael L. Overtonz March 1994
	ftp://cs.nyu.edu/pub/tech-reports/tr555.ps.Z, 19940317 Comparing Three Approaches to Transformational Programming \| Preliminary Version \| Konstantin L aufer Courant Institute of Mathematical Sciences New York University 715 Broadway, 7th floor New York, New York 10003, USA laufer@cs.nyu.edu April 22, 1991
	ftp://cs.nyu.edu/pub/tech-reports/tr590.ps.Z, 19940317 Axiomatizing Qualitative Process Theory Ernest Davis Courant Institute New York, New York March 17, 1994
	ftp://cs.nyu.edu/pub/tech-reports/tr529.ps.Z, 19940317 SUBSTRUCTURING METHODS FOR PARABOLIC PROBLEMS Maksymilian Dryja 1
	ftp://cs.nyu.edu/pub/tech-reports/tr571.ps.Z, 19940317 Efficient Algorithms for Cyclic Scheduling Franco Gasperoni gasperon@cs.nyu.edu Courant Institute of Mathematical Sciences 251 Mercer Street, New York, NY 10012 Uwe Schwiegelshohn uwe@watson.ibm.com IBM T.J. Watson Research Center P.O. Box 218, Yorktown Heights, NY 10598
	ftp://cs.nyu.edu/pub/tech-reports/tr581.ps.Z, 19940317 SOME SCHWARZ METHODS FOR SYMMETRIC AND NONSYMMETRIC ELLIPTIC PROBLEMS OLOF B. WIDLUND
	ftp://cs.nyu.edu/pub/tech-reports/tr519.ps.Z, 19940317 A DOMAIN DECOMPOSITION ALGORITHM FOR ELLIPTIC PROBLEMS IN THREE DIMENSIONS BARRY F. SMITH Running Title: A Domain Decomposition Algorithm for Three Dimensions Summary. Most domain decomposition algorithms have been developed for problems in two dimensions. One reason for this is the difficulty in
	ftp://cs.nyu.edu/pub/tech-reports/tr586.ps.Z, 19940317 On Shape Optimizing the Ratio of the First Two Eigenvalues of the Laplacian J.-P. Haeberly September 30, 1991
	ftp://cs.nyu.edu/pub/tech-reports/tr597.ps.Z, 19940317 Semantic Analyses for Storage Management Optimizations in Functional Language Implementations by Young Gil Park A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy Department of Computer Science New York University September 1991 Approved : Benjamin
	ftp://cs.nyu.edu/pub/tech-reports/tr583.ps.Z, 19940317 DOMAIN DECOMPOSITION ALGORITHMS FOR THE BIHARMONIC DIRICHLET PROBLEM XUEJUN ZHANG
	ftp://cs.nyu.edu/pub/tech-reports/tr498.ps.Z, 19940317 Performance of Shared Memory in a Parallel Computer Kevin Donovan March 1994 Abstract Suppose that in a single memory cycle, n independent random accesses are made to m separate memory modules, with each access equally likely to go to any of the memories. Let Lavg then represent the expected value of
	ftp://cs.nyu.edu/pub/tech-reports/tr568.ps.Z, 19940317 On the Subdifferentiability of Functions of a Matrix Spectrum II: Subdifferential Formulas James V. Burke and Michael L. Overtony
	ftp://cs.nyu.edu/pub/tech-reports/tr595.ps.Z, 19940317 MULTIPLICATIVE SCHWARZ ALGORITHMS FOR SOME NONSYMMETRIC AND INDEFINITE PROBLEMS XIAO-CHUAN CAI AND OLOF B. WIDLUND y
	ftp://cs.nyu.edu/pub/tech-reports/tr506.ps.Z, 19940317 Domain Decomposition Algorithms for Indefinite Elliptic Problems Xiao-Chuan Cai Olof B. Widlund y
	ftp://cs.nyu.edu/pub/tech-reports/tr567.ps.Z, 19940317 On the Subdifferentiability of Functions of a Matrix Spectrum I: Mathematical Foundations James V. Burke and Michael L. Overtony
	ftp://cs.nyu.edu/pub/tech-reports/tr518.ps.Z, 19940317 Dag Representation and Optimization of Rewriting Ke Li Courant Institute New York University 251 Mercer Street New York, NY 10012 U.S.A. E-mail: like@cs.nyu.edu
	ftp://cs.nyu.edu/pub/tech-reports/tr533.ps.Z, 19940317 On a Conjecture of Micha Perles Nagabhushana Prabhu1 Courant Institute of Mathematical Sciences 251 Mercer Street New York, NY 10012 March 17, 1994 1Supported in part by NSA grant MDA 904-89-H-2030, ONR grant N00014-85-K-0046 and by NSF grants CCR-8901484, CCR-8902221 and CCR-8906949.
	ftp://cs.nyu.edu/pub/tech-reports/tr489.ps.Z, 19940317 A Program Analysis Tool for Evaluating the Ada Compiler Validation Suite y Deborah Rennels New York University Edmond Schonberg New York University January 10, 1990
	ftp://cs.nyu.edu/pub/tech-reports/tr570.ps.Z, 19940317 Additive Schwarz Methods for Elliptic Finite Element Problems in Three Dimensions Maksymilian Dryja and Olof B. Widlund Technical Report 570 June 1991 1 ADDITIVE SCHWARZ METHODS FOR ELLIPTIC FINITE ELEMENT PROBLEMS IN THREE DIMENSIONS Maksymilian Dryja and Olof B. Widlundy
	ftp://cs.nyu.edu/pub/tech-reports/tr582.ps.Z, 19940317 MULTILEVEL ADDITIVE SCHWARZ METHODS XUEJUN ZHANG
	ftp://cs.nyu.edu/pub/tech-reports/tr562.ps.Z, 19940317 Title page done by someone else 1 DECOMPOSITION AND FICTITIOUS DOMAINS METHODS FOR ELLIPTIC BOUNDARY VALUE PROBLEMS S. V. Nepomnyaschikh1
	ftp://cs.nyu.edu/pub/tech-reports/tr523.ps.Z, 19940317 Execution of Regular DO Loops on Asynchronous Multiprocessors1 Pei Ouyang2 Computer Science Department Courant Institute of Mathematical Sciences New York University New York, NY 10012-1185
	ftp://cs.nyu.edu/pub/tech-reports/tr507.ps.Z, 19940317 Multilevel Additive Methods for Elliptic Finite Element Problems Maksymilian Dryja Olof B. Widlund y
	ftp://cs.nyu.edu/pub/tech-reports/tr510.ps.Z, 19940317 ON THE OPTIMAL DESIGN OF COLUMNS AGAINST BUCKLING Steven J. Coxy and Michael L. Overtonz Final Version for SIAM J. Math. Anal. y Mathematical Sciences Department, Rice University, Houston, TX 77251. This author's research was supported by Defense Advanced Research Projects Agency Contract
	ftp://cs.nyu.edu/pub/tech-reports/tr556.ps.Z, 19940317 Programming with Structures, Functions, and Objects \| Preliminary Version \| Fritz Henglein DIKU University of Copenhagen Universitetsparken 1 DK-2100 Copenhagen Denmark henglein@diku.dk Konstantin L aufer Courant Institute of Mathematical Sciences New York University 715 Broadway, 7th floor New York, NY
	ftp://cs.nyu.edu/pub/tech-reports/tr485.ps.Z, 19940317 VARIATIONAL ANALYSIS OF SOME CONJUGATE GRADIENT METHODS DANIEL B. SZYLD AND OLOF B. WIDLUNDy
	ftp://cs.nyu.edu/pub/tech-reports/tr579.ps.Z, 19940317 Differential Properties of Eigenvalues James V. Burke and Michael L. Overton y NYU Computer Science Department Technical Report No. 579 September 1991
	ftp://cs.nyu.edu/pub/tech-reports/tr659.ps.Z, 19940317 A New Primal-Dual Interior-Point Method for Semidefinite Programming Farid Alizadehy Jean-Pierre A. Haeberlyz Michael L. Overtonx
	ftp://cs.nyu.edu/pub/tech-reports/tr660.ps.Z, 19940317 Optimizing Eigenvalues of Symmetric Definite Pencils1 Jean-Pierre A. Haeberly Department of Mathematics Fordham University Bronx, NY 10458 718{817{3224 haeberly@murray.fordham.edu Michael L. Overton Computer Science Department Courant Institute of Mathematical Sciences New York University 251 Mercer
	ftp://cs.nyu.edu/pub/tech-reports/tr566.ps.Z, 19940317 Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices M. L. Overton1 and R. S. Womersley2 June 1991 Submitted to Math Programming
	ftp://cs.nyu.edu/pub/tech-reports/tr587.ps.Z, 19940317 New Theoretical and Computational Results For Regular Languages Chia-Hsiang Chang and Robert Paige email: changch@cs.nyu.edu, paige@cs.nyu.edu New York University/Courant Institute 251 Mercer St. New York, NY 10012 October 14 1991
	ftp://cs.nyu.edu/pub/tech-reports/tr531.ps.Z, 19940317 Cutting a Polytope William Jockusch1 Department of Mathematics MIT, Cambridge MA 02139 and Nagabhushana Prabhu2 Courant Institute of Mathematical Sciences 251 Mercer Street New York, NY 10012 May 15, 1990 1Supported by an NSF Graduate Fellowship 2Supported in part by NSA grant MDA 904-89-H-2030 and NSF
	ftp://cs.nyu.edu/pub/tech-reports/tr520.ps.Z, 19940317 Stable Perturbations of Nonsymmetric Matrices James V. Burke and Michael L. Overton June 1991 Final version for Linear Algebra and its Applications
	ftp://cs.nyu.edu/pub/tech-reports/tr584.ps.Z, 19940317 Studies in Domain Decomposition: Multi-level Methods and the Biharmonic Dirichlet Problem Xuejun Zhang September, 1991
	ftp://cs.nyu.edu/pub/tech-reports/tr505.ps.Z, 19940317 Large-Scale Optimization of Eigenvalues Michael L. Overton Courant Institute of Mathematical Sciences New York University June 1991 Final Version for SIAM J. Optimization
	ftp://cs.nyu.edu/pub/tech-reports/tr561.ps.Z, 19940317 Amortized Complexity of Data Structures Rajamani Sundar October 1991 A dissertation in the Department of Computer Science submitted to the faculty of the Graduate School of Arts and Science in partial fulfillment of the requirements for the degree of Doctor of Philosophy at New York University. Approved
	ftp://cs.nyu.edu/pub/tech-reports/tr532.ps.Z, 19940317 On Triangulations of the 3-ball and the Solid Torus Geza Bohus Department of Mathematics Rutgers University New Brunswick, NJ 08903 William Jockusch1 Department of Mathematics MIT Cambridge, MA 02319 Carl Lee21 Department of Mathematics University of Kentucky Lexington, Kentucky 40506 and Nagabhushana
	ftp://cs.nyu.edu/pub/tech-reports/tr606.ps.Z, 19940318 DOMAIN DECOMPOSITION ALGORITHMS WITH SMALL OVERLAP MAKSYMILIAN DRYJA AND OLOF B. WIDLUND y
	ftp://cs.nyu.edu/pub/tech-reports/tr620.ps.Z, 19940318 Backward Analysis for Higher{Order Functions Using Inverse Images Tyng{Ruey Chuang Benjamin Goldberg Department of Computer Science New York University February 1991
	ftp://cs.nyu.edu/pub/tech-reports/tr602.ps.Z, 19940318 An O (mlogn)O (mlogn)-Time Algorithm for the Maximal Planar Subgraph Problem Jiazhen Cai 1 Courant Institute, NYU New York, NY 10012 Xiaofeng Han Department of Computer Science Princeton University Princeton, NJ 08544 Robert E. Tarjan 2 Department of Computer Science and NEC Research Institute Princeton
	ftp://cs.nyu.edu/pub/tech-reports/tr608.ps.Z, 19940318 Matrices that Generate the Same Krylov Residual Spaces Anne Greenbaum Zdenek Strakosy May, 1992
	ftp://cs.nyu.edu/pub/tech-reports/tr639.ps.Z, 19940318 Then, the effective value density (i.e, the value achieved divided by the period's length) obtained by the clairvoyant scheduler between tl and tl+1 is at least k (k 1)n(k 1n 1) times bigger than the effective value density obtained by the on-line scheduler for the same period. proof. Suppose T1; T2; Tm
	ftp://cs.nyu.edu/pub/tech-reports/tr604.ps.Z, 19940318 More Efficient Bottom-Up Multi-Pattern Matching in Trees 1 J. Cai 2 and R. Paige 3 and R. Tarjan 4 Dept. of Computer Science Dept. of Computer Science and NEC Research Institute NYU/Courant Institute Princeton University 4 Independence Way New York, NY 10012 Princeton, NJ 08540 Princeton, NJ 08544
	ftp://cs.nyu.edu/pub/tech-reports/tr609.ps.Z, 19940318 Multiset Discrimination - a Method for Implementing Programming Language Systems Without Hashing 1 Jiazhen Cai 2 and Robert Paige 3 New York University/ Courant Institute New York, NY 10012
	ftp://cs.nyu.edu/pub/tech-reports/tr614.ps.Z, 19940318 SOME SCHWARZ ALGORITHMS FOR THE P-VERSION FINITE ELEMENT METHOD LUCA F. PAVARINO
	ftp://cs.nyu.edu/pub/tech-reports/tr603.ps.Z, 19940318 Counting Embeddings of Planar Graphs Using DFS Trees 1 Jiazhen Cai Courant Institute, NYU New York, NY 10012
	ftp://cs.nyu.edu/pub/tech-reports/tr626.ps.Z, 19940318 SCHWARZ METHODS OF NEUMANN-NEUMANN TYPE FOR THREE-DIMENSIONAL ELLIPTIC FINITE ELEMENT PROBLEMS MAKSYMILIAN DRYJA AND OLOF B. WIDLUND y
	ftp://cs.nyu.edu/pub/tech-reports/tr662.ps.Z, 19940331 MULTILEVEL SCHWARZ METHODS FOR ELLIPTIC PROBLEMS WITH DISCONTINUOUS COEFFICIENTS IN THREE DIMENSIONS MAKSYMILIAN DRYJA , MARCUS SARKISy , AND OLOF B. WIDLUNDz March 30, 1994 Abstract. Multilevel Schwarz methods are developed for a conforming finite element approximation of second order elliptic
	ftp://cs.nyu.edu/pub/tech-reports/tr657.ps.Z, 19940524 Adaptive Time-Frequency Approximations with Matching Pursuits Geoffrey Davis, 1 St ephane Mallat, 2 and Zhifeng Zhang Courant Institute of Mathematical Sciences Computer Science Department New York University 251 Mercer Street New York, NY 10012, USA
	ftp://cs.nyu.edu/pub/tech-reports/tr648.ps.Z, 19940524 ITERATIVE SUBSTRUCTURING METHODS FOR SPECTRAL ELEMENTS IN THREE DIMENSIONS LUCA F. PAVARINO AND OLOF B. WIDLUNDy October 19, 1993 Abstract. Iterative substructuring methods form an important family of domain decomposition algorithms for elliptic finite element problems. The p-version finite element
	ftp://cs.nyu.edu/pub/tech-reports/tr622-1.ps.Z, 19940524 Polymorphic Type Inference and Abstract Data Types by Konstantin L ufer A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy Department of Computer Science New York University July, 1992 Approved Professor Benjamin F. Goldberg Research Advisor
	ftp://cs.nyu.edu/pub/tech-reports/tr628.ps.Z, 19940524 The Complexity of Resolvent Resolved Giovanni Gallo Dipartimento di Matematica Universit a di Catania Catania, Italy Bud Mishra Courant Institute, NYU 719 Broadway, Room 1220 New York, N.Y. 10003, USA March 18, 1993
	ftp://cs.nyu.edu/pub/tech-reports/tr622-2.ps.Z, 19940524 65 4 An Extension of ML with a Dotless Dot Notation In this chapter, we describe a extension of our language that allows more flexible use of existential types. Following notations used in actual pro- gramming languages, this extension assumes the same representation type each time a value of
	ftp://cs.nyu.edu/pub/tech-reports/tr504-R230.ps.Z, 19940525 Stabbing and ray shooting in 3 dimensional space1 Marco Pellegrini Department of Computer Science Courant Institute of Mathematical Sciences New York University May 25, 1994 1Research partially supported by Eni and Enidata within the AXL project, and by NSF grant CCR- 8901484.
	ftp://cs.nyu.edu/pub/tech-reports/457-503.ps.Z, 19940525 Recent Technical Report List July 1989 - April 1990 New York University Courant Institute of Mathematical Sciences Computer Science Department 457-R204 MULTIFINGER GRASPS FOR FINE MANIPULATION OF SMOOTH OBJECTS G. Lafferriere, July 1989 We give rigorous proofs of the existence of two and three finger
	ftp://cs.nyu.edu/pub/tech-reports/tr565.ps.Z, 19940525 Lucid Representations Ernest Davis Courant Institute New York, NY May 25, 1994
	ftp://cs.nyu.edu/pub/tech-reports/tr517.ps.Z, 19940525 Domain Decomposition Algorithms for the Partial Differential Equations of Linear Elasticity Barry F. Smith Technical Report 517 Courant Institute of Mathematical Sciences September 1990 This work was supported in part by the National Science Foundation under grant NSF-CCR-8903003 and in part by the
	ftp://cs.nyu.edu/pub/tech-reports/tr541.ps.Z, 19940525 The Kinematics of Cutting Solid Objects Ernest Davis Courant Institute New York, New York May 25, 1994
	ftp://cs.nyu.edu/pub/tech-reports/504-557.ps.Z, 19940525 Recent Technical Report List May 1990{April 1991 New York University Courant Institute of Mathematical Sciences Computer Science Department 504-R230 STABBING AND RAY SHOOTING IN 3-DIMENSIONAL SPACE M. Pellegrini, May 1990 In this paper we consider the following problems: given a set T of triangles in
	ftp://cs.nyu.edu/pub/tech-reports/tr572.ps.Z, 19940525 An Optimal Scheduling Algorithm with a Competitive Factor for Real-Time Systems Gilad Koreny Dennis Shashay July 29, 1991
	ftp://cs.nyu.edu/pub/tech-reports/tr615.ps.Z, 19940525 SOME RECENT RESULTS ON SCHWARZ TYPE DOMAIN DECOMPOSITION ALGORITHMS MAKSYMILIAN DRYJA AND OLOF B. WIDLUND y
	ftp://cs.nyu.edu/pub/tech-reports/431-456.ps.Z, 19940525 Recent Technical Report List February 1989 - June 1989 New York University Courant Institute of Mathematical Sciences Computer Science Department 431 OPTIMAL PRECONDITIONERS OF A GIVEN SPARSITY PATTERN A. Greenbaum, G. Rodrigue, February 1989 We consider the problem of finding the symmetric positive
	ftp://cs.nyu.edu/pub/tech-reports/410-430.ps.Z, 19940525 Recent Technical Report List November 1988 - February 1989 New York University Courant Institute of Mathematical Sciences Computer Science Department 396 HIERARCHICAL CONTROL SYSTEM D. Clark, February 1989; also RR 167 Servo loops are widely used in robot control programs. The Hierarchical Control
	ftp://cs.nyu.edu/pub/tech-reports/tr534.ps.Z, 19940525 Physical Idealization as Plausible Inference Ernest Davis Courant Institute New York, New York May 25, 1994
	ftp://cs.nyu.edu/pub/tech-reports/tr514.ps.Z, 19940525 Beyond Fail-Stop: Wait-Free Serializability and Resiliency in the Presence of Slow-Down Failures Dennis Shasha John Turek May 25, 1994
	ftp://cs.nyu.edu/pub/tech-reports/tr663.ps.Z, 19940525 ITERATIVE SUBSTRUCTURING METHODS FOR SPECTRAL ELEMENTS: PROBLEMS IN THREE DIMENSIONS BASED ON NUMERICAL QUADRATURE LUCA F. PAVARINO AND OLOF B. WIDLUNDy May 24, 1994 Abstract. Iterative substructuring methods form an important family of domain decomposition algorithms for elliptic finite element
	ftp://cs.nyu.edu/pub/tech-reports/tr580.ps.Z, 19940525 An Additive Schwarz Method for the p-version Finite Element Method Luca F. Pavarino May 25, 1994 Courant Institute of Mathematical Science, 251 Mercer Street, New York, NY 10012. This work was supported in part by the Applied Math. Sci. Program of the U.S. Department of Energy under contract
	ftp://cs.nyu.edu/pub/tech-reports/tr610.ps.Z, 19940525 HESFCN \| A FORTRAN Package of Hessian Subroutines for Testing Nonlinear Optimization Software Victoria Z. Averbukh (averbukh@acf9.nyu.edu) Samuel Figueroa (figueroa@cs.nyu.edu) Tamar Schlick (schlick@acfclu.nyu.edu) Courant Institute of Mathematical Sciences New York University 251 Mercer Street New
	ftp://cs.nyu.edu/pub/tech-reports/tr621.ps.Z, 19940525 Statistical Approach to Affine Invariant Matching with Line Features 1 Frank Chee-Da Tsai Robotics Research Laboratory, Courant Institute of Mathematical Sciences, New York University 715 Broadway, 12FL New York, N.Y. 10003
	ftp://cs.nyu.edu/pub/tech-reports/tr664.ps.Z, 19940531 Conceptual and Pragmatic Tools for Design and Control of Manufacturing Systems Petri Nets and Ramadge-Wonham Discrete Event Systems Marco Antoniotti Robotics Lab Courant Institute of Mathematical Science New York University marcoxa@cs.nyu.edu July 14, 1993 Contents 1 Introduction 1 1.1 Manufacturing
	ftp://cs.nyu.edu/pub/tech-reports/558.ps.Z, 19940531 Recent Technical Report List May 1991{ New York University Courant Institute of Mathematical Sciences Computer Science Department 558-R246 ON-LINE SCHEDULERS FOR OVERLOADED REAL-TIME SYSTEMS G. Koren, B. Mishra, A. Raghunathan, D. Shasha, May 1991 There are several scheduling algorithms proposed for
	ftp://cs.nyu.edu/pub/tech-reports/tr665.ps.Z, 19940601 Cursor Stereo Stephen Gomory, Richard Wallace Department of Computer Science Courant Institute of Mathematical Sciences New York University New York, New York 10012 Technical Report #0665
	ftp://cs.nyu.edu/pub/tech-reports/558-658.ps.Z, 19940601 Recent Technical Report List May 1991{ New York University Courant Institute of Mathematical Sciences Computer Science Department 558-R246 ON-LINE SCHEDULERS FOR OVERLOADED REAL-TIME SYSTEMS G. Koren, B. Mishra, A. Raghunathan, D. Shasha, May 1991 There are several scheduling algorithms proposed for
	ftp://cs.nyu.edu/pub/tech-reports/tr503.ps.Z, 19940602 TREE LOCKING ON CHANGING TREES Vladimir Lanin and Dennis Shasha Courant Institute of Mathematical Sciences, New York University lanin@csd2.nyu.edu, shasha@nyu.edu
	ftp://cs.nyu.edu/pub/tech-reports/tr666.ps.Z, 19940809 Branching Continuous Time and the Semantics of Continuous Action Ernest Davis New York University 251 Mercer St. New York, New York DAVISE@CS.NYU.EDU July 7, 1994
	ftp://cs.nyu.edu/pub/tech-reports/tr667.ps.Z, 19940818 Representing Control in Parallel Applicative Programming Chi Yao A Dissertation Submitted in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy Department of Computer Science New York University September 1994 Approved: Benjamin Goldberg, Research Advisor ii c Copyright by
	ftp://cs.nyu.edu/pub/tech-reports/tr668.ps.Z, 19940825 A direct-drive hand: Design, Modeling and Control Marc Ebner and Richard S. Wallace June 30, 1994 Technical Report No. 668 Department of Computer Science Courant Institute of Mathematical Sciences New York University 1 Contents 1 Introduction 4 1.1 What is direct drive : : : : : : : : : : : : : : : : :
	ftp://cs.nyu.edu/pub/tech-reports/tr669.ps.Z, 19940907 Scaling Direct Drive Robots Richard S. Wallace J.M. Selig Courant Institute of Mathematical Sciences School of Elec. Electronic & Info. Eng. New York University South Bank University New York, NY 10012 U.S.A. London SE1 0AA, U.K.
	ftp://cs.nyu.edu/pub/tech-reports/tr670.ps.Z, 19940908 Approximate Euclidean Shortest Path in 3-Space Joonsoo Choi J urgen Selleny Chee-Keng Yapz Courant Institute of Mathematical Sciences New York University
	ftp://cs.nyu.edu/pub/tech-reports/659.ps, 19940922 Recent Technical Report List March 1994{ New York University Courant Institute of Mathematical Sciences Computer Science Department 659 A New Primal-Dual Interior-Dual Interior-Point Method for Semidefinite Programming F. Alizadeh, J.P. Haeberly, M. Overton Semidefinite programming (SDP) is a convex
	ftp://cs.nyu.edu/pub/tech-reports/tr671.ps.Z, 19940922 Schwarz Preconditioners for Elliptic Problems with Discontinuous Coefficients Using Conforming and Non-Conforming Elements Marcus V. Sarkis Martins Courant Institute of Mathematical Sciences New York University September 1994 A dissertation in the Department of Mathematics Submitted to the Faculty of
	ftp://cs.nyu.edu/pub/tech-reports/tr672.ps, 19941019 Planning Paths of Minimal Curvature J urgen Sellen Courant Institute of Mathematical Sciences New York University
	ftp://cs.nyu.edu/pub/tech-reports/tr675.ps.Z, 19941116 Discrete Event Models + Temporal Logic = Supervisory Controller: Automatic Synthesis of Locomotion Controllers Marco Antoniotti Bud Mishra Robotics Laboratory Courant Institute of Mathematical Sciences New York University 719 Broadway New York, NY, 10003, U.S.A. marcoxa@cs.nyu.edu mishra@nyu.edu
	ftp://cs.nyu.edu/pub/tech-reports/tr674.ps.Z, 19941116 Automatic Synthesis Algorithms for Supervisory Controllers (Preliminary Report) Marco Antoniotti Bud Mishra Robotics Laboratory Courant Institute of Mathematical Sciences New York University 719 Broadway New York, NY, 10003, U.S.A. marcoxa@cs.nyu.edu mishra@nyu.edu
	ftp://cs.nyu.edu/pub/tech-reports/tr676.ps.gz, 19950405 AN OPTIMAL PRECONDITIONER FOR A CLASS OF SADDLE POINT PROBLEMS WITH A PENALTY TERM AXEL KLAWONN
	ftp://cs.nyu.edu/pub/tech-reports/tr677.ps.gz, 19950406 NEW ESTIMATES FOR RITZ VECTORS ANDREW V. KNYAZEV
	ftp://cs.nyu.edu/pub/tech-reports/tr678-2.ps.gz, 19950407 4 4 44 1 1 1 1 2 2 2 2 3 3 3 3 Even Odd Odd Odd y+1 x+1 z+1 Figure 12: The correspondence between codes of neighboring tetrahedra. An even 8-cell" (top left), where A1 is vertex 000, is adjacent to six odd 8-cells", where A1 is vertex 001. The four neighbors of each of the tetrahedra will be found
	ftp://cs.nyu.edu/pub/tech-reports/tr678-3.ps.gz, 19950407 Figure 19: Visualization of the triangular mesh for the model of Fig. 18. 39 Figure 20: Cortical surface of the brain for a normal individual (31K vertices and 62K triangles), extracted from a 256 by 256 by 130 MR scan. Before simplification, the original number of triangles was 370K. Some important
	ftp://cs.nyu.edu/pub/tech-reports/tr678-4.ps.gz, 19950407 Figure 21: Surface of the cranium for a Crouzon syndrome (58K vertices and 120K triangles) extracted from a 256 by 256 by 135 CT scan. Before simplification, the original number of triangles was 1460K (12 times compressed). The maximum error bound is 1.0 millimeter. Sharp ridges appear in red, and
	ftp://cs.nyu.edu/pub/tech-reports/tr678-1.ps.gz, 19950407 The Wrapper Algorithm for Surface Extraction in Volumetric Data Andre Gu eziec Courant Institute of Mathematical Sciences and New York University Medical Center, New York University e-mail: gueziec@cs.nyu.edu Robert Hummel Courant Institute of Mathematical Sciences and New York University e-mail:
	ftp://cs.nyu.edu/pub/tech-reports/tr679.ps.gz, 19950410 Report on NSF Workshop on Manufacturing and Computational Geometry Chee Yap Department of Computer Science Courant Institute, New York University 251, Mercer Street New York, NY 10012 January 10, 1995
	ftp://cs.nyu.edu/pub/tech-reports/tr680.ps.gz, 19950410 REFERENCES 31 3. contrary : if their virtual coefficient is strictly negative, .e. s0 s00 < 0. An ensemble of screws is known as a screw system, and is defined by a set of n <= 6 independent basis screws. The order of a screw system is equal to the number of basis screws required to define it; such a
	ftp://cs.nyu.edu/pub/tech-reports/tr682.ps.gz, 19950425 Computing limit loads by minimizing a sum of norms Knud D. Andersen Edmund Christianseny Michael L. Overtonz October 17, 1994
	ftp://cs.nyu.edu/pub/tech-reports/tr681.ps.gz, 19950425 Complementarity and Nondegeneracy in Semidefinite Programming Farid Alizadehy Jean-Pierre A. Haeberlyz Michael L. Overtonx March 1995 Submitted to Math. Programming
	ftp://cs.nyu.edu/pub/tech-reports/tr686.ps.gz, 19950502 Double hashing is computable and randomizable with universal hash functions Jeanette P. Schmidt Alan Siegel Department of Computer Science Department of Computer Science Polytechnic University Courant Institute 333 Jay Street 251 Mercer Street Brooklyn, NY 11201 N.Y.C., NY 10012
	ftp://cs.nyu.edu/pub/tech-reports/tr684.ps.gz, 19950502 On universal classes of extremely random constant time hash functions and their time-space tradeoff Alan Siegel Courant Institute New York University New York, NY 10012
	ftp://cs.nyu.edu/pub/tech-reports/tr687.ps.gz, 19950502 Closed hashing is computable and optimally randomizable with universal hash functions Alan Siegel Jeanette P. Schmidt Department of Computer Science Department of Computer Science Courant Institute Polytechnic University 251 Mercer Street 333 Jay Street N.Y.C., NY 10012 Brooklyn, NY 11201
	ftp://cs.nyu.edu/pub/tech-reports/tr683.ps.gz, 19950502 AN OPTIMAL PRECONDITIONER FOR A CLASS OF SADDLE POINT PROBLEMS WITH A PENALTY TERM, PART II: GENERAL THEORY AXEL KLAWONN April 1995 Abstract. Iterative methods are considered for saddle point problems with a penalty term. A positive definite preconditioner is constructed and it is proved that the
	ftp://cs.nyu.edu/pub/tech-reports/tr685.ps.gz, 19950502 Toward a usable theory of Chernoff Bounds for heterogeneous and partially dependent random variables Alan Siegel Courant Institute
	ftp://cs.nyu.edu/pub/tech-reports/tr689.ps.gz, 19950504 Knowledge Representation as Domains Alexei Yu. Muravitsky Department of Computer Science Courant Institute of Mathematical Sciences 251 Mercer Street New York, New York 10012 Internet: mrvtskya@acf4.nyu.edu August 21, 1994
	ftp://cs.nyu.edu/pub/tech-reports/tr691.ps.gz, 19950504 Some Knowledge Transformers: Infons and Constraints Alexei Yu. Muravitsky Department of Computer Science Courant Institute of Mathematical Sciences 251 Mercer Street New York, New York 10012 Internet: mrvtskya@acf4.nyu.edu April 12, 1995 The goal of this paper is twofold. First, it is to present a
	ftp://cs.nyu.edu/pub/tech-reports/tr688.ps.gz, 19950504 On the First Degree Entailment of Two 3-Valued Logics Alexei Yu. Muravitsky Department of Computer Science Courant Institute of Mathematical Sciences 251 Mercer Street New York, New York 10012 Internet: mrvtskya@acf4.nyu.edu April 12, 1995
	ftp://cs.nyu.edu/pub/tech-reports/tr690.ps.gz, 19950504 A Framework for Knowledge-Based Systems Alexei Yu. Muravitsky Department of Computer Science Courant Institute of Mathematical Sciences 251 Mercer Street New York, New York 10012 Internet: mrvtskya@acf4.nyu.edu
	ftp://cs.nyu.edu/pub/tech-reports/tr693.ps.gz, 19950505 A Perspective Of New Foundations For Knowledge Maintenance Systems: Research Program y Alexei Yu. Muravitsky Courant Institute of Mathematical Sciences 251 Mercer Street New York, New York 10012-1185 Internet: mrvtskya@acf4.nyu.edu
	ftp://cs.nyu.edu/pub/tech-reports/tr692.ps.gz, 19950505 A knowledge representation based on the Belnap's four-valued logic Yuri Kaluzhny Department of Mathematics The Hebrew University of Jerusalem Jerusalem 91904, Israel Email: kyuri@cs.huji.ac.il Alexei Yu. Muravitsky Department of Computer Science Courant Institute of Mathematical Sciences 251 Mercer
	ftp://cs.nyu.edu/pub/tech-reports/tr695.ps.gz, 19950530 Dirichlet problem for the Schr odinger operator in a half-space with boundary data of arbitrary growth at infinity Alexander I. Kheyfits Courant Institute of Mathematical Sciences/New York University 251 Mercer Street, New York, NY 10012-1185
	ftp://cs.nyu.edu/pub/tech-reports/tr694.ps.gz, 19950531 Logic of Information Knowledge Alexei Yu. Muravitsky Department of Computer Science Courant Institute of Mathematical Sciences 251 Mercer Street New York, New York 10012 Internet: mrvtskya@acf4.nyu.edu
	ftp://cs.nyu.edu/pub/tech-reports/tr698.ps.gz, 19950801 Combining Register Allocation and Instruction Scheduling (Technical Summary) Rajeev Motwani1 Stanford University Krishna V. Palem2 New York University Vivek Sarkar3 IBM Software Solutions Division Salem Reyen4 New York University Technical Report, Courant Institute, TR 698, July 1995 1Permanent address:
	ftp://cs.nyu.edu/pub/tech-reports/tr699.ps.gz, 19950801 Run-time versus Compile-time Instruction Scheduling in Superscalar (RISC) Processors: Performance and Tradeoffs Allen Leung1, Krishna V. Palem2, Cristian Ungureanu3
	ftp://cs.nyu.edu/pub/tech-reports/tr701.ps.gz, 19950808 On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof Richard Cole Courant Institute, New York University
	ftp://cs.nyu.edu/pub/tech-reports/tr700.ps.gz, 19950808 On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block Sequences Richard Cole; Bud Mishra, Jeanette Schmidt, Alan Siegel Courant Institute, New York University; Polytechnic University; Ecole Normale Sup erieure
	ftp://cs.nyu.edu/pub/tech-reports/tr703.ps.gz, 19950920 Approximations of Shape and Configuration Space Ernest Davis New York University 251 Mercer St. New York, New York DAVISE@CS.NYU.EDU September 15, 1995
	ftp://cs.nyu.edu/pub/tech-reports/tr704.ps.gz, 19950921 DIAGONAL EDGE PRECONDITIONERS IN p-VERSION AND SPECTRAL ELEMENT METHODS MARIO A. CASARIN
	ftp://cs.nyu.edu/pub/tech-reports/tr705.ps.gz, 19950921 QUASI-OPTIMAL SCHWARZ METHODS FOR THE CONFORMING SPECTRAL ELEMENT DISCRETIZATION MARIO A. CASARIN
	ftp://cs.nyu.edu/pub/tech-reports/tr706.ps.gz, 19950927 Approximation and Abstraction in Solid Object Kinematics Ernest Davis New York University 251 Mercer St. New York, New York DAVISE@CS.NYU.EDU September 26, 1995
	ftp://cs.nyu.edu/pub/tech-reports/tr655.ps.gz, 19951026 1 Pscheme: Extending Continuations to Express Control and Synchronization in a Parallel LISP Chi Yao Benjamin Goldberg Department of Computer Science1 Courant Institute of Mathematical Sciences New York University
	ftp://cs.nyu.edu/pub/tech-reports/tr707.ps.gz, 19951103 The Supervisor Synthesis Problem for Unrestricted CTL is NP-complete Marco Antoniottiy Bud Mishraz November 1995 y International Computer Science Institute Berkeley, CA, USA marcoxa@icsi.berkeley.edu z Courant Institute of Mathematical Sciences New York University New York, NY, USA mishra@cs.nyu.edu
	ftp://cs.nyu.edu/pub/tech-reports/tr710.ps.gz, 19951116 On the Lidskii-Vishik-Lyusternik Perturbation Theory for Eigenvalues of Matrices with Arbitrary Jordan Structure J. Moro J. V. Burkey M. L. Overtonz Submitted to SIAM J. Matrix Anal. Appl. Dedicated to V. B. Lidskii and M. I. Vishik on the respective occasions of their 70th and 75th birthdays.
	ftp://cs.nyu.edu/pub/tech-reports/tr709.ps.gz, 19951116 NEW YORK UNIVERSITY, TECH REPORT, NOVEMBER 1995 1 Three Finger Optimal Planar Grasp Bud Mishra, Marek Teichmann
	ftp://cs.nyu.edu/pub/tech-reports/tr708.ps.gz, 19951116 An API for Choreographing Data Accesses Elizabeth A. M. Shrivery Courant Institute of Mathematical Sciences New York University Leonard F. Wisniewskiz Department of Computer Science Dartmouth College November 8, 1995
	ftp://cs.nyu.edu/pub/tech-reports/tr712.ps.gz, 19951214 A HIERARCHICAL PRECONDITIONER FOR THE MORTAR FINITE ELEMENT METHOD MARIO A. CASARIN AND OLOF B. WIDLUNDy
	ftp://cs.nyu.edu/pub/tech-reports/tr711.ps.gz, 19951214 The average case complexity of multilevel syllogistic Jim Cox, Lars Ericson, and Bud Mishra
	ftp://cs.nyu.edu/pub/tech-reports/tr713.ps.gz, 19951221 COMPUTATIONAL REAL ALGEBRAIC GEOMETRY Bhubaneswar Mishra INTRODUCTION Computational real algebraic geometry studies various algorithmic questions dealing with the real solutions of a system of equalities, inequalities, and inequations of polynomials over the real numbers. This emerging field is largely
	ftp://cs.nyu.edu/pub/tech-reports/tr714.ps.gz, 19951221 A Highly Expressive Language of Spatial Constraints Ernest Davis Courant Institute New York, New York December 19, 1995
	ftp://cs.nyu.edu/pub/tech-reports/tr715.ps.gz, 19960111 Skip-Over: Algorithms and Complexity for Overloaded Systems that Allow Skips Gilad Koren Dennis Shasha Computer Science Institute Courant Institute Bar-Ilan University New York University Ramat-Gan, 52900 Israel New York, NY 10012 January 10, 1996
	ftp://cs.nyu.edu/pub/tech-reports/tr716.ps.gz, 19960315 Angewandte Mathematik Preconditioners for Indefinite Problems Inaugural-Dissertation zur Erlangung des Doktorgrades der Naturwissenschaften im Fachbereich Mathematik der Mathematisch-Naturwissenschaftlichen Fakult at der Westf alischen Wilhelms{Universit at M unster vorgelegt von Axel Klawonn a Westf
	ftp://cs.nyu.edu/pub/tech-reports/tr719.ps.gz, 19960510 NYU Reactive Gripper: An Implementation Marek Teichmann and Bud Mishra1
	ftp://cs.nyu.edu/pub/tech-reports/tr720.ps.gz, 19960531 A Model and Solution to the DNA flipping string problem Davi Geiger and Laxmi Parida Courant Institute, Dept. of Computer Science New York University 251 Mercer street New York, NY 10012-1185 geiger@cs.nyu.edu parida@cs.nyu.edu
	ftp://cs.nyu.edu/pub/tech-reports/tr721.ps.gz, 19960531 Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results Farid Alizadehy Jean-Pierre A. Haeberlyz Michael L. Overtonx May 31, 1996
	ftp://cs.nyu.edu/pub/tech-reports/tr717.ps.gz, 19960703 Schwarz Preconditioners for Spectral and Mortar Finite Element Methods with Applications to Incompressible Fluids Mario A. Casarin Jr. Courant Institute of Mathematical Sciences New York University March 1996 A dissertation in the Department of Mathematics Submitted to the Faculty of the Graduate School
	ftp://cs.nyu.edu/pub/tech-reports/tr722.ps.gz, 19960723 A Note on Scheduling Algorithms for Processors with Lookahead Cristian Ungureanu New York University June 1996 1 Introduction Many superscalar processors designed today are able to dynamically schedule instructions. Dynamic scheduling means that a processor is able to analyze a portion of the
	ftp://cs.nyu.edu/pub/tech-reports/tr723.ps.gz, 19960726 Highly Efficient Instruction Scheduling of Real- time Programs on RISC Processors Allen Leung Courant Institute of Mathematical Sciences leunga@cs.nyu.edu Krishna V. Palem Courant Institute of Mathematical Sciences palem@cs.nyu.edu Amir Pnueli The Weizmann Institute of Science amir@wisdom.weizmann.ac.il
	ftp://cs.nyu.edu/pub/tech-reports/tr725.ps.gz, 19960809 Building a Fast Double-Dummy Bridge Solver Ming-Sheng Chang { PhD student Department of Computer Science Courant Institute of Mathematics Sciences New York University changm@cs.nyu.edu August 1, 1996
	ftp://cs.nyu.edu/pub/tech-reports/tr724.ps.gz, 19960809 Two Heuristics for the Steiner Tree Problem Derek R. Dreyer Michael L. Overton August 8, 1996
	ftp://cs.nyu.edu/pub/tech-reports/tr718.ps.gz, 19961017 CoRReT: A Constraint Based Environment for Rapid Prototyping Real Time Programs Krishna V. Palem Courant Institute of Mathematical Sciences, NYU
	ftp://cs.nyu.edu/pub/tech-reports/tr726.ps.gz, 19961114 SOME NUMERICAL RESULTS USING AN ADDITIVE SCHWARZ METHOD FOR MAXWELL'S EQUATIONS ANDREA TOSELLI
	ftp://cs.nyu.edu/pub/tech-reports/tr727.ps.gz, 19961205 Hierarchically Split Cube Forests for Decision Support: description and tuned design Theodore Johnson Dennis Shashay
	ftp://cs.nyu.edu/pub/tech-reports/tr730.ps.gz, 19961218 An O(n log n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees Richard Coley Martin Farachz Ramesh Hariharanx Teresa Przytycka{ Mikkel Thorup k
	ftp://cs.nyu.edu/pub/tech-reports/tr728.ps.gz, 19961218 Formal Models of Distributed Memory Management Cristian Ungureanu and Benjamin Goldberg Department of Computer Science New York University email: fungurean,goldbergg@cs.nyu.edu
	ftp://cs.nyu.edu/pub/tech-reports/tr731.ps.gz, 19961218 Tree Pattern Matching and Subset Matching in Randomized O(n log3 m) Time Richard Cole Ramesh Hariharany
	ftp://cs.nyu.edu/pub/tech-reports/tr729.ps.gz, 19961218 PLinda User Manual Thomas Brown Karpjoo Jeong Bin Li Suren Talla Peter Wyckoff Dennis Shasha Courant Institute of Mathematical Sciences New York University 251 Mercer Street New York, NY 10012 December 13, 1996 Contents 1 Introduction 1 2 Parallel Programming 2 2.1 Process creation : : : : : : : : : : :
	ftp://cs.nyu.edu/pub/tech-reports/tr732.ps.gz, 19970212 The On-Line K-Server Problem Aris Floratos and Ravi Boppana Courant Institute of Mathematical Sciences, NYU
	ftp://cs.nyu.edu/pub/tech-reports/tr734.ps.gz, 19970331 SDPPACK USER'S GUIDE VERSION :8 BETA F. ALIZADEH, J.{P. HAEBERLY, M. V. NAYAKKANKUPPAM, AND M. L. OVERTON
	ftp://cs.nyu.edu/pub/tech-reports/tr733.ps.gz, 19970331 On the Singular Limit of the Quantum-Classical Molecular Dynamics Model Folkmar A. Bornemann Courant Institute of Mathematical Sciences 251 Mercer St New York NY 10012, USA e-mail: bornemann@na-net.ornl.gov Christof Sch utte Konrad-Zuse-Zentrum Takustr. 7 14195 Berlin, Germany e-mail: schuette@zib.de
	ftp://cs.nyu.edu/pub/tech-reports/tr735.ps.gz, 19970521 ITERATIVE SUBSTRUCTURING PRECONDITIONERS FOR MORTAR ELEMENT METHODS IN TWO DIMENSIONS YVES ACHDOU , YVON MADAYy , AND OLOF B. WIDLUNDz
	ftp://cs.nyu.edu/pub/tech-reports/tr737.ps.gz, 19970702 SDPPACK USER'S GUIDE VERSION :9 BETA FOR MATLAB 5.0 June 25, 1997 FARID ALIZADEH, JEAN-PIERRE A. HAEBERLY, MADHU V. NAYAKKANKUPPAM, MICHAEL L. OVERTON, AND STEFAN SCHMIETA
	ftp://cs.nyu.edu/pub/tech-reports/tr736.ps.gz, 19970702 OVERLAPPING SCHWARZ METHODS FOR MAXWELL'S EQUATIONS IN THREE DIMENSIONS ANDREA TOSELLI
	ftp://cs.nyu.edu/pub/tech-reports/tr738.ps.gz, 19970910 The Naive Physics Perplex Ernest Davis Courant Institute New York University July 23, 1997
	ftp://cs.nyu.edu/pub/tech-reports/tr741.ps.gz, 19970910 1 Junctions: Detection, Classification and Reconstruction Laxmi Parida, Davi Geiger, Robert Hummel, parida@cs.nyu.edu, geiger@cs.nyu.edu, hummel@cs.nyu.edu
	ftp://cs.nyu.edu/pub/tech-reports/tr739.ps.gz, 19970910 Inapproximability of Flip-Cut, Shift-Cut and other problems from Optical Mapping Laxmi Parida August 14, 1997
	ftp://cs.nyu.edu/pub/tech-reports/tr740.ps.gz, 19970910 A Uniform Framework for Ordered Restriction Map Problems Laxmi Parida August 14, 1997
	ftp://cs.nyu.edu/pub/tech-reports/tr745.ps.gz, 19971010 Smile consistency - A Memory Consistency Model with User Definable High Level Synchronization Primitives Churngwei Chu Peter Piatko Department of Computer Science New York University 715 Broadway 7th Floor New York, NY 10003 email: chu@cs.nyu.edu, piatko@cs.nyu.edu
	ftp://cs.nyu.edu/pub/tech-reports/tr744.ps.gz, 19971010 ITERATIVE SUBSTRUCTURING METHODS FOR SPECTRAL ELEMENT DISCRETIZATIONS OF ELLIPTIC SYSTEMS. I: COMPRESSIBLE LINEAR ELASTICITY LUCA F. PAVARINO AND OLOF B. WIDLUND y September 27, 1997 Abstract. An iterative substructuring method for the system of linear elasticity in three dimensions is introduced and
	ftp://cs.nyu.edu/pub/tech-reports/tr742.ps.gz, 19971010 Pincer-Search: A New Algorithm for Discovering the Maximum Frequent Set Dao-I Lin New York University Zvi M. Kedemy New York University September 11, 1997
	ftp://cs.nyu.edu/pub/tech-reports/tr746.ps.gz, 19971030 OVERLAPPING SCHWARZ METHODS FOR VECTOR VALUED ELLIPTIC PROBLEMS IN THREE DIMENSIONS RALF HIPTMAIR AND ANDREA TOSELLIy
	ftp://cs.nyu.edu/pub/tech-reports/tr747.ps.gz, 19971030 ITERATIVE SUBSTRUCTURING METHODS FOR SPECTRAL ELEMENT DISCRETIZATIONS OF ELLIPTIC SYSTEMS IN THREE DIMENSIONS. LUCA F. PAVARINO AND OLOF B. WIDLUNDy October 28, 1997 Abstract. Spectral element methods are considered for symmetric elliptic systems of second-order partial differential equations, such as
	ftp://cs.nyu.edu/pub/tech-reports/tr748.ps.gz, 19971202 KnittingFactory: An Infrastructure for Distributed Web Applications TR 1997 748 A. Baratloo, M. Karaul, H. Karl, and Z. M. Kedem Department of Computer Science Courant Institute of Mathematical Sciences New York University November 13, 1997
	ftp://cs.nyu.edu/pub/tech-reports/tr751.ps.gz, 19971205 Adaptive Mixed Hybrid and Macro-Hybrid Finite Element Methods Ronald H.W.Hoppe1 and Barbara I. Wohlmuth2
	ftp://cs.nyu.edu/pub/tech-reports/tr743.ps.gz, 19971208 Iterative Substructuring Algorithms for the p-version Finite Element Method for Elliptic Problems Ion Bic>=a Courant Institute of Mathematical Sciences New York University September 1997 A dissertation in the Department of Mathematics Submitted to the Faculty of the Graduate School of Arts and Sciences
	ftp://cs.nyu.edu/pub/tech-reports/tr752.ps.gz, 19971215 WebSeAl: Web Server Allocation Mehmet Karaul Dept. of Computer Science New York University karaul@cs.nyu.edu Yannis A. Korilis Bell Labs Lucent Technologies yannisk@bell-labs.com Ariel Orda Dept. of Electrical Engineering Technion ariel@ee.technion.ac.il
	ftp://cs.nyu.edu/pub/tech-reports/tr753.ps.gz, 19971215 OVERLAPPING SCHWARZ ALGORITHMS FOR SOLVING HELMHOLTZ'S EQUATION XIAO-CHUAN CAI , MARIO A. CASARIN, JR. y , FRANK W. ELLIOTT, JR. z , AND OLOF B. WIDLUND x 1. Introduction. In this paper, we give a progress report on the development of a new family of domain decomposition methods for the solution of
	ftp://cs.nyu.edu/pub/tech-reports/tr750.ps.gz, 19971219 The coupling of mixed and conforming finite element discretizations Christian Wieners1 and Barbara I. Wohlmuth2 1 Introduction In this paper, we introduce and analyze a special mortar finite element method. We restrict ourselves to the case of two disjoint subdomains, and use RaviartThomas finite
	ftp://cs.nyu.edu/pub/tech-reports/tr749.ps.gz, 19971219 HIERARCHICAL A POSTERIORI ERROR ESTIMATORS FOR MORTAR FINITE ELEMENT METHODS WITH LAGRANGE MULTIPLIERS BARBARA I. WOHLMUTH
	ftp://cs.nyu.edu/pub/tech-reports/tr754.ps.gz, 19971219 Order of Magnitude Comparisons of Distance Ernest Davis Courant Institute New York, New York December 17, 1997
	ftp://cs.nyu.edu/pub/tech-reports/tr755.ps.gz, 19980109 ITERATIVE SUBSTRUCTURING METHODS FOR SPECTRAL ELEMENT DISCRETIZATIONS OF ELLIPTIC SYSTEMS. II: MIXED METHODS FOR LINEAR ELASTICITY AND STOKES FLOW LUCA F. PAVARINO AND OLOF B. WIDLUND y December 30, 1997 Abstract. Iterative substructuring methods are introduced and analyzed for saddle point problems