Richard Cole

Books by Richard Cole

Total count: 75

• Richard Cole is plaintiff in error. Daniel Rawlinson, and John Linger, defendts. The plaintiff's case. ...

  1705-01-01
• [Extract from the will of Richard Cole, 1650].

  s.n.1900-01-01
• 
  Shape from probing

  Courant Institute of Mathematical Sciences, New York University1983-01-01
• 
  Geometric retrieval problems

  Courant Institute of Mathematical Sciences, New York University1983-01-01
• 
  Isomorphism of strongly regular graphs.

  Courant Institute of Mathematical Sciences, New York University1983-01-01
• 
  Searching and storing similar lists.

  Courant Institute of Mathematical Sciences, New York University1983-01-01
• 
  Partitioning point sets in 4 dimensions.

  Courant Institute of Mathematical Sciences, New York University1984-01-01
• 
  A parallel median algorithm.

  Courant Institute of Mathematical Sciences, New York University1984-01-01
• 
  Partitioning point sets in arbitrary dimension.

  Courant Institute of Mathematical Sciences, New York University1985-01-01
• 
  Optimal VLSI circuits for sorting

  Courant Institute of Mathematical Sciences, New York University1985-01-01
• 
  Lower bounds on communication complexity in VLSI

  Courant Institute of Mathematical Sciences, New York University1985-01-01
• 
  Note on the AKS sorting network (expository note)

  Courant Institute of Mathematical Sciences, New York University1986-01-01
• 
  An optimal selection algorithm

  Courant Institute of Mathematical Sciences, New York University1986-01-01
• 
  The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time

  Courant Institute of Mathematical Sciences, New York University1986-01-01
• 
  Visibility problems for polyhedral terrains

  Courant Institute of Mathematical Sciences, New York University1986-01-01
• 
  Parallel merge sort

  Courant Institute of Mathematical Sciences, New York University1987-01-01
• 
  Faster optimal parallel prefix sums and list ranking

  Courant Institute of Mathematical Sciences, New York University1987-01-01
• 
  Approximate parallel scheduling. Part II: Applications to optimal parallel graph algorithms in logarithmic time

  Courant Institute of Mathematical Sciences, New York University1987-01-01
• 
  On optimal parallel algorithm for building a data structure for planar point location

  Courant Institute of Mathematical Sciences, New York University1987-01-01
• 
  Tight bounds on the complexity of the Boyer-Moore pattern matching algorithm.

  Courant Institute of Mathematical Sciences, New York University1990-01-01
and 55 more