%A J. Schwartz
%T A Survey of Program Proof Technology
%R Report 001
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Sep 1978

%A M. Sharir
%A A. Pnueli
%T Two Approaches to Interprocedural Data Flow Analysis
%R Report 002
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Sep 1978

%A E. Weyuker
%T Security in Operating Systems; Separating the Roles of Rights
%R Report 003
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Oct 1978

%A J. Schwartz
%T Probabilistic Algorithms for Verification of Polynomial Identities
%R Report 004
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Oct 1978

%A R. Dewar
%T A Note and a Dialog On Aspects of the DOD Com-Language (Ironman)
%R Report 005
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Oct 1978

%A E. Weyuker
%T Translatability and Decidability Questions for Restricted Classes of Program Schemas
%R Report 006
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Oct 1978

%A S. Stolfo
%A M. Harrison
%T Automatic Discovery of Heuristics for Non-deterministic programs
%R Report 007
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Jan 1979

%A E. Weyuker
%A T. Ostrand
%T Theories of Program Testing and the Application of Revealing Domains
%R Report 008
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Feb 1979

%A M. Harrison
%T Micro-Balm - A Programming Language for Microcomputers
%R Report 009
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Jan 1979

%A P. Abrahams
%A L. Clarke
%T Compile-Time Analysis of Data List-Format List Correspondences
%R Report 010
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Feb 1979

%A R. Dewar
%A M. Golumbic
%A C. Goss
%T Micro Spitbol
%R Report 011
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Oct 1979

%A V. Turchin
%T The Language REFAL: The Theory of Compilation and Metasystem Analysis
%R Report 012
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Jan 1980

%A P. Abrahams
%T CIMS PL/I
%R Report 013
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Apr 1980

%A M. Sharir
%T A Strong-Connectivity Algorithm And Its Applications in Data Flow Analysis
%R Report 014
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D May 1979

%A M. Sharir
%T Structural Analysis: A New Approach To Flow Analysis in Optimizing Compilers
%R Report 015
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Oct 1979

%A M. Sharir
%T Some Observations Concerning Differentiation of Set-Theoretic Expressions
%R Report 016
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Jan 1980

%A M. Sharir
%T Application of the Use-Definition Chaining to Attribute-Flow Analysis
%R Report 017
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Jan 1980

%A C. Kruskal
%A E. Weixelbaum
%T A Worst Case Analysis of  Heapsort
%R Report 018
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Nov 1979

%A M. Golumbic
%T Algorithmic Aspects of  Perfect Graphs
%R Report 019
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Jul 1980
%X (OUT OF PRINT)

%A J. Schwartz
%T Internal, external, and pragmatic influences: technical perspectives
in the development of programming languages
%R Report 020
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Jul 1980

%A M. Sharir
%T Algorithm Derivation  by Transformations
%R Report 021
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Oct 1979

%A E. Weyuker
%T Criteria for the Adequacy of Test Data
%R Report 022
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D May 1980

%A S. Rapps
%A E. Weyuker
%T Data Flow Analysis Techniques for Program Test Data  Generation
%R Report 023
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Dec 1981
%O revised

%A A. Gottlieb
%A C. Kruskal
%T Supersaturated Ultracomputer Algorithms
%R Report 024
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Sep 1980
%O also as Ultracomputer Note #11

%A E. Weyuker
%T On Testing Nontestable  Problems
%R Report 025
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Oct 1980

%A R. Dewar
%A S. Merritt
%A M. Sharir
%T Some Modified Algorithms for Dijkstra's Longest Upsequence Problem
%R Report 026
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Oct 1980

%A E. Weyuker
%T Error-Based Testing Strategy
%R Report 027
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Jan 1981

%A A. Gottlieb
%A B. Lubachevsky
%A L. Rudolph
%T Basic Techniques for the Efficienct Coordination of Sequential Processors
%R Report 028
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Dec 1980
%O also as Ultracomputer Note #16

%A A. Gottlieb
%T Washcloth - The Logical  Successor To Soapsuds
%R Report 029
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Dec 1980
%O also as Ultracomputer Note #12

%A A. Gottlieb
%A J. Schwartz
%T Networks and Algorithms for Very Large Scale Parallel Computation
%R Report 030
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Mar 1981
%O also as Ultracomputer Note #25

%A C. Kruskal
%T Supersaturated Paracomputer Algorithms
%R Report 031
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D May 1981
%O also as Ultracomputer Note #26

%A M. Snir
%T Lower Bounds on VLSI Implementations of Communication Networks
%R Report 032
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D May 1981
%O also as Ultracomputer Note #29

%A M. Snir
%T Balancing is Not Always Good
%R Report 033
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Jun 1981

%A A. Walker
%T Syllog: A Knowledge Based Data Management Systems
%R Report 034
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Jun 1981

%A M. Overton
%T A Quadratically Convergent Method for Minimizing a Sum of Euclidean Norms
%R Report 035
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D May 1981

%A B. Lubachevsky
%T Verification of Several Parallel Coordination Programs
Based on Descriptions of their Reachability Sets
%R Report 036
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Jul 1981
%O also as Ultracomputer Note #33

%A E. Schonberg
%A Z. Zhou
%T A New Real-Time Algorithm for the Two-Dimensional Convex Hull Problem
%R Report 037
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Sep 1981

%A G. Golub
%A M. Overton
%T Convergence of a Two-Stage Richardson Iterative Procedure for
Solving Systems of Linear Equations
%R Report 038
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Sep 1981

%A J. Schwartz
%A M. Sharir
%T On the Piano-Movers Problem, I.  Case of a Two-Dimensional
Rigid Polygonal Body Moving Amidst Polygonal Barriers
%R Report 039
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Oct 1981
%O also as Research Note #1

%A A. Gottlieb
%A R. Grishman
%A C. Kruskal
%A K. McAuliffe
%A L. Rudolphe
%A M. Snir
%T The NYU Ultracomputer - A General Purpose Parallel Computer
%R Report 040
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Jul 1981
%O also as Ultracomputer Note #42

%A J.T. Schwartz
%A M. Sharir
%T On the Piano Movers Problem, II. General Techniques for
Computing Topological Properties of Real Algebraic Manifolds
%R Report 041
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Feb 1982
%O also as Research Note #2

%A M. Burke
%A G. Fisher
%T Practical Method for Syntatic Error Diagnosis and Recovery
%R Report 042
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Apr 1982

%A R. Grishman
%A S. Bugong
%T A Preliminary Evaluation of Trace Scheduling for Global Microcode Compaction
%R Report 043
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D May 1982

%A A. Gottlieb
%A R. Grishman
%A C. Kruskal
%A L. Rudolphe
%A K. McAuliffe
%A M. Snir
%T The NYU Ultracomputer - Designing a MIMD Shared Memory
%R Report 044
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Jul 1981
%O also as Ultracomputer Note #40

%A M. Snir
%T On Parallel Searching
%R Report 045
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Jun 1982
%O also as Ultracomputer Note #44

%A M. Snir
%T On The Partitioning of Regular Networks
%R Report 046
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Jul 1982

%A T. Ostrand
%A E. Weyuker
%T Collecting and Categorizing Software Error Data in An Industrial Enviornment
%R Report 047
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Aug 1982

%A P. Spirakis
%T The Effect of Restrictions on Relative Processor Speeds to
Differences in Efficiency between Synchronous and Asynchronous Systems
%R Report 049
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Aug 1982

%A M. Davis
%A E. Weyuker
%T A Formal Notion of Program-Based Test Data
%R Report 050
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Oct 1982

%A C. Kruskal
%A M. Snir
%T Some Results on Multistage Interconnection Networks
%R Report 051
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D May 1982
%O also as Ultracomputer Note #41

%A J. Schwartz
%A M. Sharir
%T On the Piano Movers Problem III. Coordinating the Motion of
Several Independent Bodies: The Special Case of Circular Bodies
Moving Amidst Polygonal Barriers
%R Report 052
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Sep 1982
%O also as Research Note #3

%A C. O'Dunlaing
%A C. Yap
%T The Vornoi Diagram Method of Motion-Planning: I. The Case of A Disc
%R Report 053
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Mar 1982
%O also as Research Note #4

%A O. Shmueli
%A P. Spirakis
%T Concurrency Control Performance Evaluation (A Methodology and an Application to Two Phase Locking)
%R Report 054
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Nov 1982

%A P. Spirakis
%T On the Shadow CPU Approximation for Modelling Priority Scheduling
in Computer Systems
%R Report 055
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Jan 1983

%A M. Sharir
%T Intersecting and Closest-Pair Problems for a Set of Planar Objects
%R Report 056
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Feb 1983
%O also as Research Note #5

%A Y. Perl
%A U. Vishkin
%T Efficient Implementation of a Shifting Algorithm
%R Report 057
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Feb 1983

%A M. Sharir
%A E. Azriel-Sheffi
%T On the Piano Movers Problem IV, Various Decomposable
Two-Dimensional Motion Planning Problems
%R Report 058
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Feb 1983
%O also as Research Note #6

%A J. Hopcroft
%A J. Schwartz
%A M. Sharir
%T Efficient Detection of Intersections Among Spheres
%R Report 059
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Feb 1983
%O also as Research Note #7

%A B. Lubachevsky
%T An Approach to Automating The Verification of Compact Parallel Coordination Programs, I
%R Report 060
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Feb 1983
%O also as Ultracomputer Note #45

%A U. Vishkin
%T On Choice of A Model of Parallel Computation
%R Report 061
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Feb 1983
%O also as Ultracomputer Note #50

%A J. Reif
%A P. Spirakis
%T Optimal Distributed Resource Allocation
%R Report 062
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Feb 1983

%A R. Cole
%T Isomorphism of Strongly Regular Graphs
%R Report 063
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Feb 1983

%A B. Lubachevsky
%T An Approach to Automating the Verification of Compact Parallel Coordination Programs, II.
%R Report 064
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Feb 1983
%O also as Ultracomputer Note #49

%A J. Schwartz
%T Structured Light Sensors for 3-D Robot Vision
%R Report 065
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Mar 1983
%O also as Research Note #8

%A R. Hummel
%A S. Zucker
%T A Gradient Projection Algorithm for Relaxation Methods
%R Report 066
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Mar 1983
%O also as Research Note #9

%A S. Ocken
%A J. Schwartz
%T Precise Implementation of CAD Primitives Using Rational Parametrizations of Standard Surfaces
%R Report 067
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Mar 1983
%O also as Research Note #10

%A R. Hummel
%T A Design Method for Relaxation Labeling Applications
%R Report 068
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Mar 1983
%O also as Research Note #11

%A U. Vishkin
%A R. Tarjan
%T O(log n) and Optimal Parallel Biconnectivity Algorithms
%R Report 069
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Apr 1983
%O also as Ultracomputer Note #51

%A W. Paul
%A U. Vishkin
%A H. Wagner
%T Parallel Computation on 2-3 Trees
%R Report 070
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Apr 1983
%O also as Ultracomputer Note #52

%A U. Vishkin
%T Synchronous Parallel Computation
%R Report 071
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Apr 1983
%O also as Ultracomputer Note #53

%A H. Wigderson
%A U. Vishkin
%T Dynamic Parallel Memories
%R Report 072
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Apr 1983
%O also as Ultracomputer Note #54

%A J. Nocedal
%A M. Overton
%T Numerical Methods for Solving Inverse Eigenvalue Problems
%R Report 074
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Apr 1983

%A C. Bleich
%A M. Overton
%T A Linear-Time Algorithm for the Weighted Median Problem
%R Report 075
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Apr 1983

%A P. Spirakis
%A C. Yap
%T On the Combinatorial Complexity of Motion Coordination
%R Report 076
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Apr 1983
%O also as Research Note #12

%A David Korn
%A Norman Rushfield
%T Washcloth Simulation of Three-Dimensional Weather
%R Report 077
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Apr 1983
%O also as Ultracomputer Note #55

%A U. Vishkin
%T Trade-Offs Between Depth and Width in Parallel Computation
%R Report 078
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Apr 1983
%O also as Ultracomputer Note #56

%A H. Bernstein
%T An Accelerated Bisection Method for the Calculation of
Eigenvalues of a Symmetric Tridiagonal Matrix
%R Report 079
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Jul 1983

%A M. Harrison
%A O. Smith
%T The AMPOS Multiprocessor System: A Computer System for Laboratory Use
%R Report 080
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Jul 1983

%A U. Vishkin
%T Lucid Boxes vs. Black Boxes
%R Report 081
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Jul 1983

%A J. Reif
%A P. Spirakis
%T On the Depth of a Random Graph
%R Report 082
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Jul 1983

%A J. Schwartz
%A M. Sharir
%T On the Piano Movers Problem: V. The Case of a Rod Moving
in Three-Dimensional Space Amidst Polyhedral Obstacles
%R Report 083
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Jul 1983
%O also as Research Note #13

%A NYU Ada Project
%T The Executable Semantics of Ada
%R Report 084
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D 1983

%A NYU Ada Project
%T The Static Semantics of Ada
%R Report 085
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D 1983

%A R. Cole
%A C. Yap
%T Geometric Retrieval Problems
%R Report 087
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Oct 1983

%A R. Cole
%T Searching and Storing Similar Lists
%R Report 088
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Oct 1983

%A U. Vishkin
%A K. Mehlhorn
%T Granularity of Parallel Memories
%R Report 089
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Oct 1983
%O also as Ultracomputer Note #59

%A I. Bar-On
%A U. Vishkin
%T Optimal Parallel Generation of a Computation Tree Form
%R Report 090
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Oct 1983
%O also as Ultracomputer Note #61

%A J. Reif
%A P. Spirakis
%T Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems
%R Report 091
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Oct 1983

%A P. Spirakis
%A C. Yap
%T Strong NP-Hardness of Moving Many Discs
%R Report 092
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Oct 1983
%O also as Research Note #20

%A P. Spirakis
%A C. Yap
%T Moving Many Pebbles in a Graph is Polynomial Time
%R Report 093
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Oct 1983
%O also as Research Note #21

%A P. Spirakis
%T Buffered Versus Unbuffered Tree Networks Accessing a Critical Resource
%R Report 094
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Oct 1983

%A J. Nocedal
%A M. Overton
%T Projected Hessian Updating Algorithms for Nonlinearly Constrained Optimization
%R Report 095
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Nov 1983

%A U. Vishkin
%T A Parallel-Design  Distributed-Implementation (PDDI) General-Purpose Computer
%R Report 096
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Jun 1983
%O also as Ultracomputer Note #58

%A L. Trefethen
%T Stability of Hyperbolic Finite-Difference Models With One Or Two Boundaries
%R Report 097
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Nov 1983

%A P. Spirakis
%T Very Fast Algorithms for the Area of the Union of Many Circles
%R Report 098
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Dec 1983
%O also as Research Note #22

%A E. Weyuker
%T Axiomatizing Software Test Data Adequacy
%R Report 099
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Jan 1984

%A M. Overton
%T Numerical Solution of a Model Problem from Collapse Load Analysis
%R Report 100
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Feb 1984

%A O. Widlund
%T Iterative Methods for Elliptic Problems on Regions Partitioned into Substructures and the Biharmonic Dirichlet Problem
%R Report 101
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Feb 1984

%A P. Spirakis
%A J. Reif
%T Probabilistic techniques for two phase locking in database systems
%R Report 102
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Oct 1983

%A J. Hopcroft
%A J. Schwartz
%T On the complexity of motion planning for multiple independent objects;
PSPACE hardness of the "warehouseman's problem"
%R Report 103
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Feb 1984
%O also as Research Note #14

%A R. Cole
%A C. Yap
%T Shape from probing
%R Report 104
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Dec 1983
%O also as Research Note #15

%A C. Yap
%T Coordinating the Motion of Several Discs
%R Report 105
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Feb 1984
%O also as Research Note #16

%A U. Vishkin
%T An Optimal Parallel Algorithm for Selection
%R Report 106
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Dec 1983
%O also as Ultracomputer Note #64

%A U. Vishkin
%T Randomized Speed-Ups in Parallel Computation
%R Report 107
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Feb 1984
%O also as Ultracomputer Note #66

%A R. Cole
%A M. Sharir
%A C. Yap
%T On k-hulls and Related Problems
%R Report 108
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Feb 1984
%O also as Research Note #17

%A U. Vishkin
%T An efficient parallel strong orientation
%R Report 109
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Feb 1984
%O also as Ultracomputer Note #67

%A L. Trefethen
%T Square blocks and  equioscillation in the Pade, Walsh and CF Tables
%R Report 110
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Mar 1984

%A R. Hummel
%A B. Gidas
%T Zero crossings and the heat equation
%R Report 111
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Mar 1984
%O also as Research Note #18

%A L. Trefethen
%T Analysis and design of polygonal resistors by conformal mapping
%R Report 112
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Mar 1984

%A D. Clark
%A R. Hummel
%T VSH Users guide: A software environment for image processing
%R Report 113
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Mar 1984
%O also as Research Note #19

%A P. Spirakis
%T Queuing delay modeling for multistage interconnection multiprocessor networks
%R Report 114
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Mar 1984
%O also as Ultracomputer Note #68

%A R. Hummel
%A B. Kimia
%T Deblurring Gaussian blurr
%R Report 115
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Apr 1984
%O also as Research Note #23

%A L. Trefethen
%T On l<p-> instability and oscillation at discontinuities
in finite difference schemes
%R Report 116
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Apr 1984

%A R. Cole
%T Slowing down sorting networks to obtain faster sorting algorithms
%R Report 117
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Apr 1984

%A J. Reif
%A P. Spirakis
%T Probabalistic biddings gives optimal distributed resource allocation
%R Report 118
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Apr 1984
%O also as Research Note #24

%A J. Schwartz
%A M. Sharir
%T Some remarks on robot vision
%R Report 119
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Apr 1984
%O also as Research Note #25

%A H. Bernstein
%A P.G. Lowney
%A J. Schwartz
%T Servol preliminary proposals for a programming language for real-time servo control
%R Report 120
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Apr 1984
%O also as Research Note #26

%A D. Kornhauser
%A G. Miller
%A P. Spirakis
%T Coordinating pebble motion on graphs, the diameter of permuatation groups and applications
%R Report 121
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D May 1984
%O also as Research Note #27

%A A. Siegel
%T Tight area bounds and provably good AT**2
bounds for sorting circuits
%R Report 122
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Jun 1984

%A E. Davis
%T An ontology of physical actions
%R Report 123
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Jun 1984

%A C. Bastuscheck
%A J. Schwartz
%T Preliminary implementation of a ratio image depth sensor
%R Report 124
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Jun 1984
%O also as Research Note #28

%A H. Bernstein
%T Determining the shape of a convex n-sided polygon by using 2n+k tactile probes
%R Report 125
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Jun 1984
%O also as Research Note #29

%A R. Cole
%A C. Yap
%T A parallel median algorithm
%R Report 126
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D &

%A L. Trefethen
%A R. Williams
%T Conformal mapping solution of
Laplace's equation on a polygon with oblique derivative boundary conditions
%R Report 127
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Jul 1984

%A C. O'Dunlaing
%A C. Yap
%T Counting digraphs and hyper-graphs
%R Report 128
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Jul 1984

%A H. Bernstein
%A M. Goldstein
%T Parallel implementation of bisection for the calculation
of eigenvalues of tridiagonal symmetric matrices
%R Report 129
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Jul 1984

%A P. Spirakis
%A A. Tuzhilin
%T A semantic approach to correctness of concurrent executions
%R Report 130
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Jul 1984

%A D. Cantone
%A A. Ferro
%A J. Schwartz
%T Decision procedures for elementary sublanguages of set theory. V.
Multi-level syllogistic extended by the general union operator
%R Report 131
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Aug 1984

%A D. Wood
%A C. Yap
%T The rectilinear convex skull problem
%R Report 132
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Aug 1984
%O also as Research Note #30

%A P. Spirakis
%T The volume of the union of many spheres and point inclusion problems
%R Report 133
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Aug 1984
%O revised
%O also as Research Note #35

%A M. Atallah
%A U. Vishkin
%T Finding Euler tours in parallel
%R Report 134
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Sep 1984
%O also as Ultracomputer Note #73

%A U. Vishkin
%T Optimal parallel pattern  matching in strings
%R Report 135
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Sep 1984
%O also as Ultracomputer Note #74

%A P. Bjorstad
%A O. Widlund
%T Iterative methods for the solution of elliptic problems
on regions partitioned into substructures
%R Report 136
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Sep 1984

%A E. Davis
%T Shape and function of solid objects: some examples
%R Report 137
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Oct 1984

%A M. Sharir
%T On shortest paths in polyhedral spaces
%R Report 138
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Oct 1984
%O also as Research Note #31

%A C. O'Dunlaing
%A M. Sharir
%A C. Yap
%T Generalized Vornoi diagrams for moving a ladder: I Topological analysis
%R Report 139
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Nov 1984
%O also as Research Note #32

%A C. O. Dunlaing
%A M. Sharir
%A C. Yap
%T Generalized Vornoi diagrams for moving a ladder: II Efficient construction of the diagram
%R Report 140
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Nov 1984
%O also as Research Note #33

%A M. Bastuscheck
%T Look up table computation for a ratio image depth sensor
%R Report 141
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Nov 1984
%O also as Research Note #34

%A R. Cole
%T Partitioning point sets in 4 dimensions
%R Report 142
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Nov 1984

%A J. Reif
%A P. Spirakis
%T Byzantine agreement by  distributed randomization in 0(log n) rounds
%R Report 143
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Oct 1984
%O revised

%A P. Spirakis
%T Fast probabilistic techniques for dynamic parallel addition, parallel counting and the processor identification problem
%R Report 144
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Nov 1984
%O also as Ultracomputer Note #80

%A E. Davis
%T A high level real-time  programming language
%R Report 145
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Dec 1984
%O also as Research Note #36

%A S. Weiss
%A E. Weyuker
%T A time-independent definition of software reliability
%R Report 146
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Jan 1985

%A G. Piatetsky-Shapiro
%T A self-organizing database system - A different approach to query optimization
%R Report 147
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Jan 1985

%A S. Weiss
%A P. Frankl
%A E. Weyuker
%T ASSET: A systen to select and evaluate tests
%R Report 148
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Jan 1985

%A E. Weyuker
%T Evaluating software complexity
%R Report 149
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Jan 1985

%A J. Demmel
%T On the conditioning of pole assignment
%R Report 150
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Jan 1985

%A J. Ellis
%A F. Makedon
%A P. Spirakis
%A S. Zachos
%T Dynamic grid embedding: optimizing the compression of partial grids
%R Report 151
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Jan 1985

%A A. Green
%T The design and analysis of a Distributed System
%R Report 152
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Feb 1985

%A R. Livne
%A M. Sharir
%T On intersection of planar  Jordan curves
%R Report 153
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Feb 1985
%O also as Research Note #37

%A J. Schwartz
%A M. Sharir
%A A. Siegel
%T An efficient algorithm for finding connected components in a binary image
%R Report 154
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Feb 1985
%O also as Research Note #38

%A J. Schwartz
%T Polynomial minimum root separation (Note to a paper of S.M. Rump)
%R Report 155
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Feb 1985
%O also as Research Note #39

%A D. Cantone|A. Ferro|J. Schwartz
%T Decision procedures for elementary sublanguages of set theory. VI.
Multi-level syllogistic extended by the powerset operator
%R Report 156
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Feb 1985

%A E. Kishon
%A X.D. Yang
%T A video camera interface for high speed region boundary locations
%R Report 157
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Feb 1985
%O also as Research Note #40

%A D. Shasha
%A P. Spirakis
%T Join processing in a symmetric parallel environment
%R Report 158
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Mar 1985

%A A. Aggarwal
%A H. Booth
%A J. O'Rourke
%A S. Suri
%A C. Yap
%T Finding minimal convex nested polygons
%R Report 159
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Mar 1985
%O also as Research Note #41

%A C. Yap
%T Minimum area circumscribing polygons
%R Report 160
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D May 1985
%O also as Research Note #42

%A C. Yap
%T An 0(nlogn) algorithm for the Vornoi diagram of a set of simple curve segments
%R Report 161
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D May 1985
%O also as Research Note #43

%A A. Kalvin
%A E. Schonberg
%A J. Schwartz
%T Two-dimensional model-based boundary matching using footprints M. Sharir
%R Report 162
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D May 1985
%O also as Research Note #44

%A J. Demmel
%A B. Kagstrom
%T Computing stable eigendecompositions of of matrix pencils
%R Report 163
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D May 1985

%A J. Schwartz
%A M. Sharir
%T Efficint motion planning algorithms in environments of bounded local complexity
%R Report 164
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D June 1985
%O also as Research Note #45

%A J. Schwartz
%A M. Sharir
%T Identification of partially obscured objects in 2 and 3 dimensions by matching of noisy "characteristic curves"
%R Report 165
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D June 1985
%O also as Research Note #46

%A A. Cimino
%T Bird - A high-level interpreter for plotting curves
in 3 dimensions using NCAR
%R Report 166
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D June 1985
%O also as Research Note #47

%A G. Landau
%A U. Vishkin
%T Efficient string matching with k mismatches
%R Report 167
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D June 1985

%A G. Landau
%A U. Vishkin
%T An efficient string matching algorithm with k differences
for nuceotide and amino acid sequences
%R Report 168
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D July 1985

%A J. Chang
%A C. Yap
%T A polynomial solution for potato-peeling problem
%R Report 169
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D July 1985
%O also as Research Note #48

%A E. Schonberg
%A D. Shields
%T From prototype to efficient implementation:
A case study using SETL and C
%R Report 170
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D July 1985

%A R. Chan
%T Iterative methods for over- flow queueing models
%R Report 171
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Aug 1985

%A R. Cole|A. Siegel
%T Optimal VLSI circuits for sorting
%R Report 172
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Aug 1985
%O also as Ultracomputer Note #86

%A R. Hummel
%A A. Rojer
%T Connected component labelling
in image processing with MIMD architectures
%R Report 173
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Sep 1985
%O also as Ultracomputer Note #87 R49

%A J. Demmel
%T Constrained total least squares problems and the smallest perturbation of a submatrix which lowers the rank
%R Report 174
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Sep 1985

%A R. Cole
%A U. Vishkin
%T Deterministic coin tossing with applications to optimal parallel list ranking
%R Report 175
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Sep 1985
%O also as Ultracomputer Note #87

%A R. Hummel
%A S. Zucker
%T Receptive fields and the reconstruction of visual information
%R Report 176
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Sep 1985
%O also as Research Note #50

%A R. Hummel
%A M. Landy
%T A brief survey of knowledge aggregation methods
%R Report 177
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Sep 1985
%O also as Research Note #51

%A D. Shasha
%T When does non-linear text help?
%R Report 178
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Sep 1985

%A S. Friedland
%A J. Nocedal
%A M. Overton
%T The formulation and analysis of numerical methods for inverse eigenvalue problems
%R Report 179
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Sep 1985

%A A. Baltsam
%A M. Sharir
%T On shortest paths between two convex polyhedra
%R Report 180
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Sep 1985
%O also as Research Note #52

%A M. Sharir
%T On shortest paths amidst convex polyhedra
%R Report 181
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Sep 1985
%O also as Research Note #53

%A P. Spirakis
%T Input sensitive optimal  parallel randomized algorithms for addition and identification
%R Report 182
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Jul 1985

%A C. Borgers
%T A Lagrangian functional step method for the incompressible Navier-Stokes equations
%R Report 183
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Oct 1985

%A R. Cole
%T Partitioning point sets in arbitrary dimension
%R Report 184
%I Department of Computer Science,
Courant Institiute of Mathematical Sciences,
New York University
%D Oct 1985