We study conditional computational entropy: the amount of randomness a distribution appears to have to a computationally bounded observer who is given some correlated information....
Since the 1980s, two approaches have been developed for analyzing security protocols. One of the approaches relies on a computational model that considers issues of complexity and ...
Abstract. We introduce a domain-theoretic computational model for multivariable differential calculus, which for the first time gives rise to data types for differentiable functio...
Space constrained optimization problems arise in a multitude of important applications such as data warehouses and pervasive computing. A typical instance of such problems is to s...
Themistoklis Palpanas, Nick Koudas, Alberto O. Men...
This paper examines the computer game Harry Potter and the Philosopher’s Stone in relation to the novel with the same title. The analysis focuses on the temporal aspects of the ...