2 citations · 7 across the 6 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.CG2013
The Complexity of Order Type Isomorphism
Greg Aloupis, John Iacono, Stefan Langerman +1
The order type of a point set in maps each -tuple of points to its orientation (e.g., clockwise or counterclockwise in ). Two point sets and have the sa…
cs.DS2013
Why some heaps support constant-amortized-time decrease-key operations, and others do not
John Iacono
A lower bound is presented which shows that a class of heap algorithms in the pointer model with only heap pointers must spend Omega(log log n / log log log n) amortized time on th…