16 citations · 23 across the 7 of their papers we have counts for
10 papers
When Is Recoverable Consensus Harder Than Consensus?
Carole Delporte-Gallet, Panagiota Fatourou, Hugues Fauconnier +1
We study the ability of different shared object types to solve recoverable consensus using non-volatile shared memory in a system with crashes and recoveries. In particular, we com…
An Efficient Wait-free Resizable Hash Table
Panagiota Fatourou, Nikolaos D. Kallimanis, Thomas Ropars
This paper presents an efficient wait-free resizable hash table. To achieve high throughput at large core counts, our algorithm is specifically designed to retain the natural paral…
Fast Data Series Indexing for In-Memory Data
Botao Peng, Panagiota Fatourou, Themis Palpanas
Data series similarity search is a core operation for several data series analysis applications across many different domains. However, the state-of-the-art techniques fail to deli…
MESSI: In-Memory Data Series Indexing
Botao Peng, Panagiota Fatourou, Themis Palpanas
Data series similarity search is a core operation for several data series analysis applications across many different domains. However, the state-of-the-art techniques fail to deli…
ParIS+: Data Series Indexing on Multi-Core Architectures
Botao Peng, Panagiota Fatourou, Themis Palpanas
Data series similarity search is a core operation for several data series analysis applications across many different domains. Nevertheless, even state-of-the-art techniques cannot…
Constant-Time Snapshots with Applications to Concurrent Data Structures
Yuanhao Wei, Naama Ben-David, Guy E. Blelloch +3
We present an approach for efficiently taking snapshots of the state of a collection of CAS objects. Taking a snapshot allows later operations to read the value that each CAS objec…