In numerous positional games the identity of the winner is easily determined. In this case one of the more interesting questions is not who wins but rather how fast can one win. T...
Dan Hefetz, Michael Krivelevich, Tibor Szabó...
We propose a probabilistic interpretation of Propositional Dynamic Logic (PDL). We show that logical and behavioral equivalence are equivalent over general measurable spaces. This...
— Mobile peer to peer (P2P) computing is becoming a major revolution in computing owing to advances in computing power, network connectivity and storage capacity of mobile device...
Important variants of the Vertex Cover problem (among others, Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in ...
A method is proposed for performing shape analysis of m-surfaces, e.g. planar curves and surfaces, with a geometric interpretation. The analysis uses an implicit surface represent...