27 citations · 69 across the 14 of their papers we have counts for
16 papers
Data Races and the Discrete Resource-time Tradeoff Problem with Resource Reuse over Paths
Rathish Das, Shih-Yu Tsai, Sharmila Duppala +5
A determinacy race occurs if two or more logically parallel instructions access the same memory location and at least one of them tries to modify its content. Races often lead to n…
Universal Guard Problems
Sándor P. Fekete, Qian Li, Joseph S. B. Mitchell +1
We provide a spectrum of results for the Universal Guard Problem, in which one is to obtain a small set of points ("guards") that are "universal" in their ability to guard any of a…
Computing Nonsimple Polygons of Minimum Perimeter
Sándor P. Fekete, Andreas Haas, Michael Hemmer +8
We provide exact and approximation methods for solving a geometric relaxation of the Traveling Salesman Problem (TSP) that occurs in curve reconstruction: for a given set of vertic…
Geometric Hitting Set for Segments of Few Orientations
Sándor P. Fekete, Kan Huang, Joseph S. B. Mitchell +2
We study several natural instances of the geometric hitting set problem for input consisting of sets of line segments (and rays, lines) having a small number of distinct slopes. Th…
Improved Approximation Algorithms for Relay Placement
Alon Efrat, Sándor P. Fekete, Joseph S. B. Mitchell +2
In the relay placement problem the input is a set of sensors and a number , the communication range of a relay. In the one-tier version of the problem the objective is to…
Probabilistic Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in d-Dimensions
Esther M. Arkin, Antonio Fernandez Anta, Joseph S. B. Mitchell +1
Motivated by low energy consumption in geographic routing in wireless networks, there has been recent interest in determining bounds on the length of edges in the Delaunay graph of…