Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Michael Ian Shamos

Known as: Michael Shamos, Mike Shamos 
Michael Ian "Mike" Shamos (born April 21, 1947) is an American mathematician, attorney, book author, journal editor, consultant and company director… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2000
2000
We present a deterministic algorithm for computing the diameter of a set of n points in R3; its running time O(n log n) is worst… Expand
  • figure 1
  • figure 3
  • figure 2
  • figure 4
Is this relevant?
1989
1989
Abstract : This thesis is primarily concerned with two problems of interconnecting components in VLSI technologies. In the first… Expand
  • figure 2-1
  • figure 2-2
  • figure 2-3
  • figure 2-4
  • figure 2-5
Is this relevant?
Highly Cited
1983
Highly Cited
1983
We present an O(n(log n)3(log log n)2) algorithm for the problem of finding a point (x, y) in the plane that minimizes the… Expand
Is this relevant?
Highly Cited
1982
Highly Cited
1982
Linear-time algorithms for linear programming in R and R are presented. The methods used are applicable for other graphic and… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1982
Highly Cited
1982
  • Nimrod Megiddo
  • 23rd Annual Symposium on Foundations of Computer…
  • 1982
  • Corpus ID: 14467740
Linear-time for Linear Programming in R2 and R3 are presented. The methods used are applicable for some other problems. For… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1982
Highly Cited
1982
  • Bernard Chazelle
  • 23rd Annual Symposium on Foundations of Computer…
  • 1982
  • Corpus ID: 14232738
Let P be a simple polygon with N vertices, each being assigned a weight ∈ {0,1}, and let C, the weight of P, be the added weight… Expand
Is this relevant?
1980
1980
Abstract Combinatorial techniques are used to solve recurrence relations in two variables of the form T(N, k) = 2T( N 2 , k) + T… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
1979
Highly Cited
1979
An interesting class of "geometric intersection problems" calls for dealing with the pairwise intersections among a set of N… Expand
Is this relevant?
Highly Cited
1979
Highly Cited
1979
The problem of construction of planar Voronoi diagrams arises in many areas, one of the most important of which is in nearest… Expand
Is this relevant?
Highly Cited
1979
Highly Cited
1979
 
  • figure 1
  • figure 2
Is this relevant?