32 citations · 50 across the 13 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DS2017
Reconstructing Generalized Staircase Polygons with Uniform Step Length
Nodari Sitchinava, Darren Strash
Visibility graph reconstruction, which asks us to construct a polygon that has a given visibility graph, is a fundamental problem with unknown complexity (although visibility graph…
cs.DS2017★ 3 cited
An Efficient Multiway Mergesort for GPU Architectures
Henri Casanova, John Iacono, Ben Karsin +2
Sorting is a primitive operation that is a building block for countless algorithms. As such, it is important to design sorting algorithms that approach peak performance on a range…