• Publications
  • Influence
Gossiping with Unit Messages in Known Radio Networks
TLDR
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
  • 60
  • 6
Real-time traversal in grammar-based compressed files
TLDR
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
  • 48
  • 6
  • PDF
Deterministic Communication in Radio Networks with Large Labels
TLDR
We study deterministic gossiping in ad hoc radio networks with large node labels. Expand
  • 22
  • 4
  • PDF
Temporal logic with predicate /spl lambda/-abstraction
TLDR
A predicate linear temporal logic LTL/sub /spl lambda/=/ without quantifiers but with predicate/spl lambda/-abstraction mechanism and equality is considered. Expand
  • 33
  • 3
  • PDF
PVM Computation of the Transitive Closure: The Dependency Graph Approach
TLDR
We investigate experimentally a dependency graph approach to the distributed parallel computation of the generic transitive closure problem. Expand
  • 4
  • 3
Observations on Parallel Computation of Transitive and Max-Closure Problems
TLDR
We present new approaches to the parallel computation of a class of problems related to the GENERIC TRANSITIVE CLOSURE problem (TC, in short). Expand
  • 6
  • 3
  • PDF
Undecidability of Two-dimensional Robot Games
TLDR
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
  • 8
  • 2
  • PDF
On undecidability bounds for matrix decision problems
TLDR
In this paper we show an elementary proof of undecidability of the reachability problem for a set of 5 two-dimensional affine transformations. Expand
  • 30
  • 1
Time Efficient Gossiping in Known Radio Networks
TLDR
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
  • 29
  • 1
  • PDF
On the Undecidability of the Identity Correspondence Problem and its Applications for Word and Matrix Semigroups
TLDR
We introduce the Identity Correspondence Problem (ICP) in the spirit of Post’s Correspondence problem and show that it is undecidable. Expand
  • 24
  • 1
  • PDF