Panagiota Fatourou

Available identifiers

zbMath Open fatourou.panagiotaMaRDI QIDQ324624

List of research outcomes

Publication	Date of Publication	Type
When is Recoverable Consensus Harder Than Consensus?	2024-03-26	Paper
https://portal.mardi4nfdi.de/entity/Q6061694	2023-12-08	Paper
https://portal.mardi4nfdi.de/entity/Q6083441	2023-12-08	Paper
https://portal.mardi4nfdi.de/entity/Q5874249	2023-02-07	Paper
Scheduling algorithms for strict multithreaded computations	2023-01-25	Paper
The RedBlue family of universal constructions	2021-01-22	Paper
Read-modify-write networks	2020-12-04	Paper
https://portal.mardi4nfdi.de/entity/Q4967167	2019-07-03	Paper
The PCL Theorem	2019-02-25	Paper
Linearizable Wait-Free Iteration Operations in Shared Double-Ended Queues	2017-12-15	Paper
Efficiency of oblivious versus non-oblivious schedulers for optimistic, rate-based flow control (extended abstract)	2017-09-29	Paper
Lower and upper bounds for single-scanner snapshot implementations	2017-09-04	Paper
Universal constructions that ensure disjoint-access parallelism and wait-freedom	2016-10-17	Paper
The amortized complexity of non-blocking binary search trees	2015-09-03	Paper
Single-scanner multi-writer snapshot implementations are fast!	2015-03-10	Paper
Highly-efficient wait-free synchronization	2015-01-19	Paper
Universal constructions that ensure disjoint-access parallelism and wait-freedom	2014-12-05	Paper
Time-space tradeoffs for implementations of snapshots	2014-11-25	Paper
Space-optimal multi-writer snapshot objects are slow	2014-07-25	Paper
Time-optimal, space-efficient single-scanner snapshots & multi-scanner snapshots using CAS	2014-03-13	Paper
The complexity of updating multi-writer snapshot objects	2014-03-13	Paper
The space complexity of unbounded timestamps	2013-07-04	Paper
The complexity of updating snapshot objects	2012-02-14	Paper
A tight time lower bound for space-optimal implementations of multi-writer snapshots	2010-08-16	Paper
The RedBlue Adaptive Universal Constructions	2009-11-19	Paper
https://portal.mardi4nfdi.de/entity/Q3396596	2009-09-19	Paper
Time lower bounds for implementations of multi-writer snapshots	2008-12-21	Paper
The Space Complexity of Unbounded Timestamps	2008-09-02	Paper
Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control	2005-09-16	Paper
https://portal.mardi4nfdi.de/entity/Q4436061	2003-11-23	Paper
https://portal.mardi4nfdi.de/entity/Q4250787	2000-11-22	Paper
Efficient scheduling of strict multithreaded computations	2000-09-04	Paper

Research outcomes over time

This page was built for person: Panagiota Fatourou