I. Potapov

A gossiping is a communication primitive in which each node of the network possesses a unique message that is to be communicated to all other nodes in the network. Expand

We show, that one can visit consecutive symbols of the original text, moving from one symbol to another in constant time and extra O(|D|) space. Expand

We study deterministic gossiping in ad hoc radio networks with large node labels. Expand

A predicate linear temporal logic LTL/sub /spl lambda/=/ without quantifiers but with predicate/spl lambda/-abstraction mechanism and equality is considered. Expand

We investigate experimentally a dependency graph approach to the distributed parallel computation of the generic transitive closure problem. Expand

We present new approaches to the parallel computation of a class of problems related to the GENERIC TRANSITIVE CLOSURE problem (TC, in short). Expand

We prove undecidability of the robot game in dimension two answering the question formulated by Doyen and Rabinovich in 2011 and closing the gap between undecidable and decidable cases. Expand

In this paper we show an elementary proof of undecidability of the reachability problem for a set of 5 two-dimensional affine transformations. Expand

We study here the gossiping problem (all-to-all communication) in known radio networks, i.e., when all nodes are aware of the network topology. Expand

We introduce the Identity Correspondence Problem (ICP) in the spirit of Post’s Correspondence problem and show that it is undecidable. Expand