#### Filter Results:

- Full text PDF available (18)

#### Publication Year

2009

2017

- This year (3)
- Last 5 years (23)
- Last 10 years (24)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Dan Alistarh, Rati Gelashvili, Milan Vojnovic
- PODC
- 2015

Population protocols, roughly defined as systems consisting of large numbers of simple identical agents, interacting at random and updating their state following simple rules, are an important research topic at the intersection of distributed computing and biology. One of the fundamental tasks that a population protocol may solve is majority: each node… (More)

- Dan Alistarh, Rati Gelashvili
- ICALP
- 2015

Population protocols are networks of finite-state agents, interacting randomly, and updating their state using simple rules. Despite their extreme simplicity, these systems have been shown to cooperatively perform complex computational tasks, such as simulating register machines to compute standard arithmetic functions. The election of a unique leader agent… (More)

Population protocols are a popular model of distributed computing, in which randomly-interacting agents with little computational power cooperate to jointly perform computational tasks. Inspired by developments in molecular computation, and in particular DNA computing, recent algorithmic work has focused on the complexity of solving simple yet fundamental… (More)

- Zeyuan Allen-Zhu, Rati Gelashvili, Silvio Micali, Nir Shavit
- Proceedings of the National Academy of Sciences…
- 2014

Johnson-Lindenstrauss (JL) matrices implemented by sparse random synaptic connections are thought to be a prime candidate for how convergent pathways in the brain compress information. However, to date, there is no complete mathematical support for such implementations given the constraints of real neural tissue. The fact that neurons are either excitatory… (More)

- Rati Gelashvili
- DISC
- 2015

The optimal space complexity of consensus in shared memory is a decades-old open problem. For a system of n processes, no algorithm is known that uses a sublinear number of registers. However, the best known lower bound due to Fich, Herlihy, and Shavit requires Ω( √ n) registers. The special symmetric case of the problem where processes are anonymous (run… (More)

Task allocation is a classic distributed problem in which a set of p potentially faulty processes must cooperate to perform a set of tasks. This paper considers a new dynamic version of the problem, in which tasks are injected adversarially during an asynchronous execution. We give the first asynchronous shared-memory algorithm for dynamic task allocation,… (More)

- Faith Ellen, Rati Gelashvili, Nir Shavit, Leqi Zhu
- ArXiv
- 2016

For many years, Herlihy’s elegant computability based Consensus Hierarchy has been our best explanation of the relative power of various types of multiprocessor synchronization objects when used in deterministic algorithms. However, key to this hierarchy is treating synchronization instructions as distinct objects, an approach that is far from the… (More)

- Holger Flier, Rati Gelashvili, Thomas Graffagnino, Marc Nunkesser
- Robust and Online Large-Scale Optimization
- 2009

- Zeyuan Allen Zhu, Rati Gelashvili, Ilya P. Razenshteyn
- ArXiv
- 2014

Population protocols are a popular model of distributed computing, in which randomly-interacting agents with little computational power cooperate to jointly perform computational tasks. Inspired by developments in molecular computation, and in particular DNA computing, recent algorithmic work has focused on the complexity of solving simple yet fundamental… (More)