Panagiota Fatourou

Panagiota Fatourou's AcademicInfluence.com Rankings

Panagiota Fatourou

Computer Science

#10280

World Rank

#10784

Historical Rank

Database

#9608

World Rank

#10142

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Panagiota Fatourou's Degrees

PhD Computer Science University of Crete
Masters Computer Science University of Crete
Bachelors Computer Science University of Crete

Similar Degrees You Can Earn

Why Is Panagiota Fatourou Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Panagiota Fatourou is a Greek computer scientist, specializing in distributed computing and concurrent computing, including the design of data structures that can be used in non-blocking algorithms. She is a professor of computer science at the University of Crete, the former chair of the ACM Europe Council, and the founder of the Greek chapter of the ACM Council on Women in Computing.

(See a Problem?)

Panagiota Fatourou's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Non-blocking binary search trees (2010) (196)
Revisiting the combining synchronization technique (2012) (141)
A highly-efficient wait-free universal construction (2011) (109)
Universal constructions that ensure disjoint-access parallelism and wait-freedom (2012) (42)
Highly-Efficient Wait-Free Synchronization (2014) (36)
The amortized complexity of non-blocking binary search trees (2014) (35)
ParIS: The Next Destination for Fast Data Series Indexing and Query Answering (2018) (34)
MESSI: In-Memory Data Series Indexing (2020) (33)
Persistent Non-Blocking Binary Search Trees Supporting Wait-Free Range Queries (2018) (23)
ParIS+: Data Series Indexing on Multi-Core Architectures (2020) (23)
Consistency for Transactional Memory Computing (2014) (23)
The space complexity of unbounded timestamps (2007) (21)
The RedBlue Adaptive Universal Constructions (2009) (20)
Space-optimal multi-writer snapshot objects are slow (2002) (19)
A tight time lower bound for space-optimal implementations of multi-writer snapshots (2003) (18)
Time lower bounds for implementations of multi-writer snapshots (2007) (17)
Constant-time snapshots with applications to concurrent data structures (2021) (16)
Time-space tradeoffs for implementations of snapshots (2006) (16)
Recommender systems under European AI regulations (2022) (15)
The PCL theorem: transactions cannot be parallel, consistent and live (2014) (12)
Eight Open Problems in Distributed Computing (2006) (12)
Efficient Scheduling of Strict Multithreaded Computations (2000) (11)
An Efficient Wait-free Resizable Hash Table (2018) (11)
SING: Sequence Indexing Using GPUs (2021) (11)
An Introductory Tutorial to Concurrency-Related Distributed Recursion (2013) (11)
Time-optimal, space-efficient single-scanner snapshots & multi-scanner snapshots using CAS (2007) (11)
Fast data series indexing for in-memory data (2021) (10)
Women are needed in STEM (2019) (10)
The complexity of updating multi-writer snapshot objects (2006) (10)
Tracking in Order to Recover: Recoverable Lock-Free Data Structures (2019) (9)
Abort Free SemanticTM by Dependency Aware Scheduling of Transactional Instructions (2014) (9)
Tracking in Order to Recover - Detectable Recovery of Lock-Free Data Structures (2019) (8)
VAT: Asymptotic Cost Analysis for Multi-Level Key-Value Stores (2020) (7)
Single-scanner multi-writer snapshot implementations are fast! (2006) (7)
Scheduling Algorithms for Strict Multithreaded Computations (1996) (7)
Space and Time Bounded Multiversion Garbage Collection (2021) (6)
The complexity of updating snapshot objects (2011) (6)
Implementation an Experimental Evaluation of Graph Connectivity Algorithms Using LEDA (1999) (5)
Read-modify-write networks (2004) (5)
Distributed Transactional Systems Cannot Be Fast (2019) (5)
Detectable recovery of lock-free data structures (2022) (5)
Snapshot Isolation Does Not Scale Either (2013) (5)
Low-contention depth-first scheduling of parallel computations with write-once synchronization variables (2001) (5)
Persistent Software Combining (2021) (5)
Hercules Against Data Series Similarity Search (2022) (5)
The performance power of software combining in persistence (2022) (4)
Disjoint-Access Parallelism in Software Transactional Memory (2015) (4)
A New Scheduling Algorithm for General Strict Multithreaded Computations (1999) (4)
The Distributed Computing Column (2013) (4)
The global efficiency of distributed, rate-based, flow control algorithms (1998) (4)
Lock Oscillation: Boosting the Performance of Concurrent Data Structures (2017) (4)
Algorithmic Techniques in STM Design (2015) (4)
Adding networks (2001) (3)
Hybrid Data Driven and Rule Based Sentiment Analysis on Greek Text (2020) (3)
Linearizable Wait-Free Iteration Operations in Shared Double-Ended Queues (2017) (3)
The PCL Theorem (2018) (3)
Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control (2005) (3)
Efficiency of oblivious versus non-oblivious schedulers for optimistic, rate-based flow control (extended abstract) (1997) (3)
An Efficient Universal Construction for Large Objects (2020) (2)
Efficient Distributed Data Structures for Future Many-Core Architectures (2016) (2)
The RedBlue family of universal constructions (2020) (2)
Fast Implementations of Shared Objects using Fetch & Add (2010) (2)
Highly-Efficient Wait-Free Synchronization (2013) (2)
Low-contention depth-first scheduling of parallel computations with synchronization variables (2000) (1)
Lower and upper bounds for single-scanner snapshot implementations (2017) (1)
The Power of Scheduling-Aware Synchronization (2014) (1)
WFR-TM: Wait-free readers without sacrificing speculation of writers (2014) (1)
Welcome to the Europe region special section (2019) (1)
Blocking Universal Constructions (2011) (1)
Advances in Rate-Based Flow Control (1997) (1)
Brief Announcement: Persistent Software Combining (2021) (1)
Proceedings of the 2013 ACM symposium on Principles of distributed computing (2013) (1)
Odyssey: A Journey in the Land of Distributed Data Series Similarity Search (2023) (1)
Front Matter, Table of Contents, Preface, Committees, List of Authors (2016) (0)
Practically and Theoretically Efficient Garbage Collection for Multiversioning (2022) (0)
Universal constructions that ensure disjoint-access parallelism and wait-freedom (2016) (0)
Recoverable Computing (Invited Talk) (2022) (0)
Staleness and Local Progress in Transactional Memory (2020) (0)
Combining in Software Transactional Memory (2012) (0)
When is Recoverable Consensus Harder Than Consensus? (2022) (0)
Lower and upper bounds for single-scanner snapshot implementations (2016) (0)
Maurice Herlihy's 60th Birthday Celebration (2015) (0)
Session details: Shared and transactional memory (2013) (0)
The RedBlue family of universal constructions (2020) (0)
Preface (2020) (0)
Eecient, Rate-based Flow Control Algorithms (1996) (0)
Distributed Computing Column Maurice Herlihy’s 60th Birthday Celebration (2015) (0)
20th International Conference on Principles of Distributed Systems, OPODIS 2016, December 13-16, 2016, Madrid, Spain (2017) (0)
Wait-Free Universal Constructions that ensure Timestamp-Ignoring Disjoint-Access Parallelism (2013) (0)
Session details: Session 7 (2014) (0)
Session details: Best paper session (2010) (0)
Schedulers for Optimistic Rate Based Flow Control (2008) (0)
Implementation of a Linear Expected-Time Algorithm for Finding Connected Components (1997) (0)
Distributed Computing (2009) (0)
Constant-Time Lazy Snapshots Supporting General Queries on Concurrent Data Structures (2020) (0)
Space and Time Bounded Multiversion Garbage Collection: FORTH ICS TR 482 (2022) (0)
Towards the Synthesis of Coherence/Replication Protocols from Consistency Models via Real-Time Orderings (2021) (0)
List of authors (1977) (0)
Concurrency for the Masses: The Paradigm of Software Transactional Memory (2017) (0)
Session details: Special track -- transactional memory (2008) (0)

This paper list is powered by the following services:

Other Resources About Panagiota Fatourou

What Schools Are Affiliated With Panagiota Fatourou?

Panagiota Fatourou is affiliated with the following schools:

Panagiota Fatourou's Academic­Influence.com Rankings