Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
As the desire of scientists to perform ever larger computations drives the size of today’s high performance computers from hundreds, to thousands, and even tens of thousands of ...
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
Traditional High Performance Computing systems require extensive management and suffer from security and configuration problems. This paper presents a new clustermanagement syste...
It is well known that women’s involvement in the field of Computer Science is very low in the USA. This is viewed as a significant problem and has become a great concern to educ...