Panagiota Fatourou

According to our database1, Panagiota Fatourou authored at least 58 papers between 1996 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
The PCL Theorem: Transactions cannot be Parallel, Consistent, and Live.
J. ACM, 2019

Tracking in Order to Recover: Recoverable Lock-Free Data Structures.
CoRR, 2019

Women are needed in STEM: European policies and incentives.
Commun. ACM, 2019

Welcome to the Europe region special section.
Commun. ACM, 2019

Persistent Non-Blocking Binary Search Trees Supporting Wait-Free Range Queries.
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

Distributed Transactional Systems Cannot Be Fast.
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

An Efficient Universal Construction for Large Objects.
Proceedings of the 23rd International Conference on Principles of Distributed Systems, 2019

2018
Persistent Non-Blocking Binary Search Trees Supporting Wait-Free Range Queries.
CoRR, 2018

An Efficient Wait-free Resizable Hash Table.
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

ParIS: The Next Destination for Fast Data Series Indexing and Query Answering.
Proceedings of the IEEE International Conference on Big Data, 2018

2017
Linearizable Wait-Free Iteration Operations in Shared Double-Ended Queues.
Parallel Processing Letters, 2017

Lower and upper bounds for single-scanner snapshot implementations.
Distributed Computing, 2017

Concurrency for the Masses: The Paradigm of Software Transactional Memory.
Proceedings of the 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2017

Lock Oscillation: Boosting the Performance of Concurrent Data Structures.
Proceedings of the 21st International Conference on Principles of Distributed Systems, 2017

2016
Schedulers for Optimistic Rate Based Flow Control.
Encyclopedia of Algorithms, 2016

WFR-TM: Wait-free readers without sacrificing speculation of writers.
J. Parallel Distrib. Comput., 2016

Universal constructions that ensure disjoint-access parallelism and wait-freedom.
Distributed Computing, 2016

Efficient Distributed Data Structures for Future Many-Core Architectures.
Proceedings of the 22nd IEEE International Conference on Parallel and Distributed Systems, 2016

2015
Distributed Computing.
Bulletin of the EATCS, 2015

Maurice Herlihy's 60th Birthday Celebration.
Bulletin of the EATCS, 2015

Algorithmic Techniques in STM Design.
Proceedings of the Transactional Memory. Foundations, Algorithms, Tools, and Applications, 2015

Consistency for Transactional Memory Computing.
Proceedings of the Transactional Memory. Foundations, Algorithms, Tools, and Applications, 2015

Disjoint-Access Parallelism in Software Transactional Memory.
Proceedings of the Transactional Memory. Foundations, Algorithms, Tools, and Applications, 2015

2014
Highly-Efficient Wait-Free Synchronization.
Theory Comput. Syst., 2014

Consistency for Transactional Memory Computing.
Bulletin of the EATCS, 2014

The Power of Scheduling-Aware Synchronization.
Proceedings of the Distributed Computing - 28th International Symposium, 2014

The amortized complexity of non-blocking binary search trees.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

Abort Free SemanticTM by Dependency Aware Scheduling of Transactional Instructions.
Proceedings of the Networked Systems - Second International Conference, 2014

2013
An Introductory Tutorial to Concurrency-Related Distributed Recursion.
Bulletin of the EATCS, 2013

2012
Revisiting the combining synchronization technique.
Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2012

2011
The complexity of updating snapshot objects.
J. Parallel Distrib. Comput., 2011

A highly-efficient wait-free universal construction.
Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

Introduction.
Proceedings of the Euro-Par 2011 Parallel Processing - 17th International Conference, 2011

2010
The Distributed Computing Column.
Bulletin of the EATCS, 2010

Non-blocking binary search trees.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

2009
The RedBlue Adaptive Universal Constructions.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

2008
Schedulers for Optimistic Rate Based Flow Control.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

The space complexity of unbounded timestamps.
Distributed Computing, 2008

2007
Time lower bounds for implementations of multi-writer snapshots.
J. ACM, 2007

Time-optimal, space-efficient single-scanner snapshots & multi-scanner snapshots using CAS.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

2006
Eight Open Problems in Distributed Computing.
Bulletin of the EATCS, 2006

Time-space tradeoffs for implementations of snapshots.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

Single-scanner multi-writer snapshot implementations are fast!
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

The Complexity of Updating Multi-writer Snapshot Objects.
Proceedings of the Distributed Computing and Networking, 8th International Conference, 2006

2005
Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control.
SIAM J. Comput., 2005

Max-min Fair Flow Control Sensitive to Priorities.
Journal of Interconnection Networks, 2005

2004
Read-modify-write networks.
Distributed Computing, 2004

2003
A tight time lower bound for space-optimal implementations of multi-writer snapshots.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

2002
Space-optimal multi-writer snapshot objects are slow.
Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

2001
Adding Networks.
Proceedings of the Distributed Computing, 15th International Conference, 2001

Low-contention depth-first scheduling of parallel computations with write-once synchronization variables.
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

2000
Efficient Scheduling of Strict Multithreaded Computations.
Theory Comput. Syst., 2000

1999
A New Scheduling Algorithm for General Strict Multithreaded Computations.
Proceedings of the Distributed Computing, 1999

Implementation an Experimental Evaluation of Graph Connectivity Algorithms Using LEDA.
Proceedings of the Algorithm Engineering, 1999

1998
The Global Efficiency of Distributed, Rate-Based, Flow Control Algorithms.
Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

1997
Advances in Rate-Based Flow Control.
Proceedings of the SIROCCO'97, 1997

Efficiency of Oblivious Versus Non-Oblivious Schedules for Optimistic, Rate-Based Flow Control (Extended Abstract).
Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

1996
Scheduling Algorithms for Strict Multithreaded Computations.
Proceedings of the Algorithms and Computation, 7th International Symposium, 1996


  Loading...