In this paper we study the nonzero-sum Dynkin game in continuous time, which is a two-player noncooperative game on stopping times. We show that it has a Nash equilibrium point for...
Closed streamlines are a missing part in most visualizations of vector field topology. In this paper, we propose a method which detects closed streamlines in a time-dependent two-...
Worst-Case Execution Time (WCET) analysis means to compute a safe upper bound to the execution time of a piece of code. Parametric WCET analysis yields symbolic upper bounds: expr...
We propose and study the Maximum Constrained Agreement Subtree (MCAST) problem, which is a variant of the classical Maximum Agreement Subtree (MAST) problem. Our problem allows us...
This article advocates a new computing paradigm, called computing with time, that is capable of efficiently performing a certain class of computation, namely, searching in paralle...