Panagiota Fatourou

ORCID

Publication Activity (10 Years)

Years Active: 1996-2024
Publications (10 Years): 59

Top Venues

Publications

Panagiota Fatourou, Nikos Giachoudis, George Mallis
Highly-Efficient Persistent FIFO Queues. CoRR (2024)
Panagiota Fatourou, Nikos Giachoudis, George Mallis
Highly-Efficient Persistent FIFO Queues. SIROCCO (2024)
Panagiota Fatourou, Nikolaos D. Kallimanis, Eleni Kanellou, Odysseas Makridakis, Christi Symeonidou
Efficient Distributed Data Structures for Future Many-core Architectures. CoRR (2024)
Panagiota Fatourou, Eric Ruppert
Lock-Free Augmented Trees. CoRR (2024)
Panagiota Fatourou, Eleftherios Kosmas, Themis Palpanas, George Paterakis
FreSh: A Lock-Free Data Series Index. SRDS (2023)
Panagiota Fatourou
Parallel and Distributed Data Series Processing on Modern and Emerging Hardware. MEDES (2023)
Panagiota Fatourou, Eleftherios Kosmas, Themis Palpanas, George Paterakis
FreSh: A Lock-Free Data Series Index. CoRR (2023)
Panagiota Fatourou
Parallel and Distributed Data Series Processing on Modern and Emerging Hardware. CoRR (2023)
Manos Chatzakis, Panagiota Fatourou, Eleftherios Kosmas, Themis Palpanas, Botao Peng
Odyssey: A Journey in the Land of Distributed Data Series Similarity Search. CoRR (2023)
Manos Chatzakis, Panagiota Fatourou, Eleftherios Kosmas, Themis Palpanas, Botao Peng
Odyssey: A Journey in the Land of Distributed Data Series Similarity Search. Proc. VLDB Endow. 16 (5) (2023)
Yuanhao Wei, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert
Practically and Theoretically Efficient Garbage Collection for Multiversioning. PPoPP (2023)
Tommaso Di Noia, Nava Tintarev, Panagiota Fatourou, Markus Schedl
Recommender systems under European AI regulations. Commun. ACM 65 (4) (2022)
Panagiota Fatourou, Nikolaos D. Kallimanis, Eleftherios Kosmas
The performance power of software combining in persistence. PPoPP (2022)
Carole Delporte-Gallet, Panagiota Fatourou, Hugues Fauconnier, Eric Ruppert
When is Recoverable Consensus Harder Than Consensus? PODC (2022)
Carole Delporte-Gallet, Panagiota Fatourou, Hugues Fauconnier, Eric Ruppert
When Is Recoverable Consensus Harder Than Consensus? CoRR (2022)
Hagit Attiya, Ohad Ben-Baruch, Panagiota Fatourou, Danny Hendler, Eleftherios Kosmas
Detectable recovery of lock-free data structures. PPoPP (2022)
Panagiota Fatourou, Nikolaos D. Kallimanis, Thomas Ropars
An Efficient Wait-free Resizable Hash Table. CoRR (2022)
Panagiota Fatourou
Recoverable Computing (Invited Talk). OPODIS (2022)
Karima Echihabi, Panagiota Fatourou, Kostas Zoumpatianos, Themis Palpanas, Houda Benbrahim
Hercules Against Data Series Similarity Search. CoRR (2022)
Karima Echihabi, Panagiota Fatourou, Kostas Zoumpatianos, Themis Palpanas, Houda Benbrahim
Hercules Against Data Series Similarity Search. Proc. VLDB Endow. 15 (10) (2022)
Yuanhao Wei, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert
Practically and Theoretically Efficient Garbage Collection for Multiversioning. CoRR (2022)
Yuanhao Wei, Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun
Constant-time snapshots with applications to concurrent data structures. PPoPP (2021)
Panagiota Fatourou, Nikolaos D. Kallimanis, Eleftherios Kosmas
Brief Announcement: Persistent Software Combining. DISC (2021)
Panagiota Fatourou, Nikolaos D. Kallimanis, Eleftherios Kosmas
Persistent Software Combining. CoRR (2021)
Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun, Yuanhao Wei
Space and Time Bounded Multiversion Garbage Collection. CoRR (2021)
Vasilis Gavrielatos, Vijay Nagarajan, Panagiota Fatourou
Towards the Synthesis of Coherence/Replication Protocols from Consistency Models via Real-Time Orderings. PaPoC@EuroSys (2021)
Botao Peng, Panagiota Fatourou, Themis Palpanas
ParIS+: Data Series Indexing on Multi-Core Architectures. IEEE Trans. Knowl. Data Eng. 33 (5) (2021)
Botao Peng, Panagiota Fatourou, Themis Palpanas
Fast data series indexing for in-memory data. VLDB J. 30 (6) (2021)
Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun, Yuanhao Wei
Space and Time Bounded Multiversion Garbage Collection. DISC (2021)
Botao Peng, Panagiota Fatourou, Themis Palpanas
SING: Sequence Indexing Using GPUs. ICDE (2021)
Botao Peng, Panagiota Fatourou, Themis Palpanas
Fast Data Series Indexing for In-Memory Data. CoRR (2021)
Panagiota Fatourou, Fernando Pedone
Preface. Theor. Comput. Sci. (2020)
Botao Peng, Panagiota Fatourou, Themis Palpanas
MESSI: In-Memory Data Series Indexing. CoRR (2020)
Nikos Batsaras, Giorgos Saloustros, Anastasios Papagiannis, Panagiota Fatourou, Angelos Bilas
VAT: Asymptotic Cost Analysis for Multi-Level Key-Value Stores. CoRR (2020)
Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun, Yuanhao Wei
Constant-Time Lazy Snapshots Supporting General Queries on Concurrent Data Structures. CoRR (2020)
Panagiota Fatourou, Nikolaos D. Kallimanis, Eleni Kanellou
An Efficient Universal Construction for Large Objects. CoRR (2020)
Botao Peng, Panagiota Fatourou, Themis Palpanas
MESSI: In-Memory Data Series Indexing. ICDE (2020)
Botao Peng, Panagiota Fatourou, Themis Palpanas
ParIS+: Data Series Indexing on Multi-Core Architectures. CoRR (2020)
Hagit Attiya, Ohad Ben-Baruch, Panagiota Fatourou, Danny Hendler, Eleftherios Kosmas
Tracking in Order to Recover - Detectable Recovery of Lock-Free Data Structures. SPAA (2020)
Panagiota Fatourou, Nikolaos D. Kallimanis
The RedBlue family of universal constructions. Distributed Comput. 33 (6) (2020)
Hagit Attiya, Panagiota Fatourou, Sandeep Hans, Eleni Kanellou
Staleness and Local Progress in Transactional Memory. NETYS (2020)
Victor Bushkov, Dmytro Dziuma, Panagiota Fatourou, Rachid Guerraoui
The PCL Theorem: Transactions cannot be Parallel, Consistent, and Live. J. ACM 66 (1) (2019)
Panagiota Fatourou, Yota Papageorgiou, Vasiliki Petousi
Women are needed in STEM: European policies and incentives. Commun. ACM 62 (4) (2019)
Panagiota Fatourou, Nikolaos D. Kallimanis, Eleni Kanellou
An Efficient Universal Construction for Large Objects. OPODIS (2019)
Panagiota Fatourou, Chris Hankin
Welcome to the Europe region special section. Commun. ACM 62 (4) (2019)
Panagiota Fatourou, Elias Papavasileiou, Eric Ruppert
Persistent Non-Blocking Binary Search Trees Supporting Wait-Free Range Queries. SPAA (2019)
Hagit Attiya, Ohad Ben-Baruch, Panagiota Fatourou, Danny Hendler, Eleftherios Kosmas
Tracking in Order to Recover: Recoverable Lock-Free Data Structures. CoRR (2019)
Diego Didona, Panagiota Fatourou, Rachid Guerraoui, Jingjing Wang, Willy Zwaenepoel
Distributed Transactional Systems Cannot Be Fast. CoRR (2019)
Diego Didona, Panagiota Fatourou, Rachid Guerraoui, Jingjing Wang, Willy Zwaenepoel
Distributed Transactional Systems Cannot Be Fast. SPAA (2019)
Botao Peng, Panagiota Fatourou, Themis Palpanas
ParIS: The Next Destination for Fast Data Series Indexing and Query Answering. IEEE BigData (2018)
Panagiota Fatourou, Nikolaos D. Kallimanis, Thomas Ropars
An Efficient Wait-free Resizable Hash Table. SPAA (2018)
Panagiota Fatourou, Eric Ruppert
Persistent Non-Blocking Binary Search Trees Supporting Wait-Free Range Queries. CoRR (2018)
Panagiota Fatourou
Concurrency for the Masses: The Paradigm of Software Transactional Memory. SYNASC (2017)
Panagiota Fatourou, Yiannis Nikolakopoulos, Marina Papatriantafilou
Linearizable Wait-Free Iteration Operations in Shared Double-Ended Queues. Parallel Process. Lett. 27 (2) (2017)
Panagiota Fatourou, Nikolaos D. Kallimanis
Lower and upper bounds for single-scanner snapshot implementations. Distributed Comput. 30 (4) (2017)
Panagiota Fatourou, Nikolaos D. Kallimanis
Lock Oscillation: Boosting the Performance of Concurrent Data Structures. OPODIS (2017)
Panagiota Fatourou, Nikolaos D. Kallimanis, Eleni Kanellou, Odysseas Makridakis, Christi Symeonidou
Efficient Distributed Data Structures for Future Many-Core Architectures. ICPADS (2016)
Faith Ellen, Panagiota Fatourou, Eleftherios Kosmas, Alessia Milani, Corentin Travers
Universal constructions that ensure disjoint-access parallelism and wait-freedom. Distributed Comput. 29 (4) (2016)
Panagiota Fatourou, Eleni Kanellou, Eleftherios Kosmas, Md Forhad Rabbi
WFR-TM: Wait-free readers without sacrificing speculation of writers. J. Parallel Distributed Comput. 96 (2016)
Panagiota Fatourou
Maurice Herlihy's 60th Birthday Celebration. Bull. EATCS 116 (2015)
Panagiota Fatourou, Stefan Schmid
Distributed Computing. Bull. EATCS 115 (2015)
Faith Ellen, Panagiota Fatourou, Joanna Helga, Eric Ruppert
The amortized complexity of non-blocking binary search trees. PODC (2014)
Hillel Avni, Shlomi Dolev, Panagiota Fatourou, Eleftherios Kosmas
Abort Free SemanticTM by Dependency Aware Scheduling of Transactional Instructions. NETYS (2014)
Panagiota Fatourou, Nikolaos D. Kallimanis
The Power of Scheduling-Aware Synchronization. DISC (2014)
Panagiota Fatourou, Eleni Kanellou, Eleftherios Kosmas, Md Forhad Rabbi
WFR-TM: Wait-Free Readers without Sacrificing Speculation of Writers. OPODIS (2014)
Panagiota Fatourou, Nikolaos D. Kallimanis
Highly-Efficient Wait-Free Synchronization. Theory Comput. Syst. 55 (3) (2014)
Victor Bushkov, Dmytro Dziuma, Panagiota Fatourou, Rachid Guerraoui
The PCL theorem: transactions cannot be parallel, consistent and live. SPAA (2014)
Dmytro Dziuma, Panagiota Fatourou, Eleni Kanellou
Consistency for Transactional Memory Computing. Bull. EATCS 113 (2014)
Sergio Rajsbaum, Michel Raynal, Panagiota Fatourou
An Introductory Tutorial to Concurrency-Related Distributed Recursion. Bull. EATCS 111 (2013)
Faith Ellen, Panagiota Fatourou, Eleftherios Kosmas, Alessia Milani, Corentin Travers
Universal constructions that ensure disjoint-access parallelism and wait-freedom. PODC (2012)
Panagiota Fatourou, Nikolaos D. Kallimanis
Revisiting the combining synchronization technique. PPOPP (2012)
Panagiota Fatourou, Nikolaos D. Kallimanis
A highly-efficient wait-free universal construction. SPAA (2011)
Hagit Attiya, Faith Ellen, Panagiota Fatourou
The complexity of updating snapshot objects. J. Parallel Distributed Comput. 71 (12) (2011)
Kunal Agarwal, Panagiota Fatourou, Arnold L. Rosenberg, Frédéric Vivien
Introduction. Euro-Par (2) (2011)
Faith Ellen, Panagiota Fatourou, Eric Ruppert, Franck van Breugel
Non-blocking binary search trees. PODC (2010)
Panagiota Fatourou
The Distributed Computing Column. Bull. EATCS 102 (2010)
Panagiota Fatourou, Nikolaos D. Kallimanis
The RedBlue Adaptive Universal Constructions. DISC (2009)
Faith Ellen, Panagiota Fatourou, Eric Ruppert
The space complexity of unbounded timestamps. Distributed Comput. 21 (2) (2008)
Faith Ellen, Panagiota Fatourou, Eric Ruppert
Time lower bounds for implementations of multi-writer snapshots. J. ACM 54 (6) (2007)
Faith Ellen, Panagiota Fatourou, Eric Ruppert
The Space Complexity of Unbounded Timestamps. DISC (2007)
Panagiota Fatourou, Nikolaos D. Kallimanis
Time-optimal, space-efficient single-scanner snapshots & multi-scanner snapshots using CAS. PODC (2007)
Hagit Attiya, Faith Ellen, Panagiota Fatourou
The complexity of updating multi-writer snapshot objects. PODC (2007)
James Aspnes, Costas Busch, Shlomi Dolev, Panagiota Fatourou, Chryssis Georgiou, Alexander A. Shvartsman, Paul G. Spirakis, Roger Wattenhofer
Eight Open Problems in Distributed Computing. Bull. EATCS 90 (2006)
Hagit Attiya, Faith Ellen, Panagiota Fatourou
The Complexity of Updating Multi-writer Snapshot Objects. ICDCN (2006)
Panagiota Fatourou, Faith Ellen Fich, Eric Ruppert
Time-space tradeoffs for implementations of snapshots. STOC (2006)
Panagiota Fatourou, Nikolaos D. Kallimanis
Single-scanner multi-writer snapshot implementations are fast! PODC (2006)
Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis
Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control. SIAM J. Comput. 34 (5) (2005)
Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis
Max-min Fair Flow Control Sensitive to Priorities. J. Interconnect. Networks 6 (2) (2005)
Panagiota Fatourou, Maurice Herlihy
Read-modify-write networks. Distributed Comput. 17 (1) (2004)
Panagiota Fatourou, Faith E. Fich, Eric Ruppert
A tight time lower bound for space-optimal implementations of multi-writer snapshots. STOC (2003)
Panagiota Fatourou, Faith E. Fich, Eric Ruppert
Space-optimal multi-writer snapshot objects are slow. PODC (2002)
Panagiota Fatourou
Low-contention depth-first scheduling of parallel computations with write-once synchronization variables. SPAA (2001)
Panagiota Fatourou, Maurice Herlihy
Adding Networks. DISC (2001)
Panagiota Fatourou, Maurice Herlihy
Adding networks. PODC (2001)
Panagiota Fatourou, Paul G. Spirakis
Efficient Scheduling of Strict Multithreaded Computations. Theory Comput. Syst. 33 (3) (2000)
Panagiota Fatourou, Paul G. Spirakis
A New Scheduling Algorithm for General Strict Multithreaded Computations. DISC (1999)
Panagiota Fatourou, Paul G. Spirakis, Panagiotis Zarafidis, Anna Zoura
Implementation an Experimental Evaluation of Graph Connectivity Algorithms Using LEDA. WAE (1999)
Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis
The Global Efficiency of Distributed, Rate-Based, Flow Control Algorithms. SIROCCO (1998)
Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis
The Global Efficiency of Distributed, Rate-Based, Flow Control Algorithms. PODC (1998)
Panagiota Fatourou, Marios Mavronicolas, Paul G. Spirakis
Advances in Rate-Based Flow Control. SIROCCO (1997)

Panagiota Fatourou.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Panagiota Fatourou