Abstract. A range of attacks on network components, such as algorithmic denial-of-service attacks and cryptanalysis via timing attacks, are enabled by data structures for which an ...
Abstract. Computing the visibility polygon, VP, of a point in a polygonal scene, is a classical problem that has been studied extensively. In this paper, we consider the problem of...
Visualisations of dynamic data change in appearance over time, reflecting changes in the underlying data, be that the development of a social network, or the addition or removal o...
Congestion games are a fundamental and widely studied model for selfish allocation problems like routing and load balancing. An intrinsic property of these games is that players ...
The problem of enforcing bounded-time 2-phase recovery in real-time programs is often necessitated by conflict between faulttolerance requirements and timing constraints. In this ...