Abstract. The recurrent associative memory networks with complexvalued Hebbian matrices of connections are designed from interacting limitcycle oscillators. These oscillatory netwo...
Margarita Kuzmina, Eduard A. Manykin, Irina Surina
We consider asynchronous distributed systems with message losses and process crashes. We study the impact of finite process memory on the solution to consensus, repeated consensus ...
In this paper we present a framework to formally describe and study the interconnection of distributed shared memory systems. In our models we minimize the dependencies between the...
Consider laying out a fixed-topology tree of N nodes into external memory with block size B so as to minimize the worst-case number of block memory transfers required to traverse ...
Motivated by the challenging task of designing “secure” vote storage mechanisms, we study information storage mechanisms that operate in extremely hostile environments. In suc...