Follow
Panagiota Fatourou
Panagiota Fatourou
Professor, Department of Computer Science, University of Crete
Verified email at csd.uoc.gr - Homepage
Title
Cited by
Cited by
Year
Non-blocking binary search trees
F Ellen, P Fatourou, E Ruppert, F van Breugel
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of …, 2010
2432010
Revisiting the combining synchronization technique
P Fatourou, ND Kallimanis
Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of …, 2012
1682012
A highly-efficient wait-free universal construction
P Fatourou, ND Kallimanis
Proceedings of the twenty-third annual ACM symposium on Parallelism in …, 2011
1352011
Universal constructions that ensure disjoint-access parallelism and wait-freedom
F Ellen, P Fatourou, E Kosmas, A Milani, C Travers
Proceedings of the 2012 ACM symposium on Principles of distributed computing …, 2012
47*2012
The amortized complexity of non-blocking binary search trees
F Ellen, P Fatourou, J Helga, E Ruppert
Proceedings of the 2014 ACM symposium on Principles of distributed computing …, 2014
412014
Paris: The next destination for fast data series indexing and query answering
B Peng, P Fatourou, T Palpanas
2018 IEEE International Conference on Big Data (Big Data), 791-800, 2018
402018
Highly-efficient wait-free synchronization
P Fatourou, ND Kallimanis
Theory of Computing Systems 55, 475-520, 2014
382014
Women are needed in STEM: European policies and incentives
P Fatourou, Y Papageorgiou, V Petousi
Communications of the ACM 62 (4), 52-52, 2019
372019
Messi: In-memory data series indexing
B Peng, P Fatourou, T Palpanas
2020 IEEE 36th International Conference on Data Engineering (ICDE), 337-348, 2020
352020
Paris+: Data series indexing on multi-core architectures
B Peng, P Fatourou, T Palpanas
IEEE Transactions on Knowledge and Data Engineering 33 (5), 2151-2164, 2020
292020
Consistency for transactional memory computing
D Dziuma, P Fatourou, E Kanellou
Transactional Memory. Foundations, Algorithms, Tools, and Applications: COST …, 2015
252015
Persistent non-blocking binary search trees supporting wait-free range queries
P Fatourou, E Papavasileiou, E Ruppert
The 31st ACM Symposium on Parallelism in Algorithms and Architectures, 275-286, 2019
222019
The RedBlue Adaptive Universal Constructions
P Fatourou, ND Kallimanis
Distributed Computing: 23rd International Symposium, DISC 2009, Elche, Spain …, 2009
222009
Recommender systems under European AI regulations
T Di Noia, N Tintarev, P Fatourou, M Schedl
Communications of the ACM 65 (4), 69-73, 2022
212022
The space complexity of unbounded timestamps
F Ellen, P Fatourou, E Ruppert
Distributed Computing 21 (2), 103-115, 2008
212008
Time-space tradeoffs for implementations of snapshots
P Fatourou, FE Fich, E Ruppert
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing …, 2006
202006
Constant-time snapshots with applications to concurrent data structures
Y Wei, N Ben-David, GE Blelloch, P Fatourou, E Ruppert, Y Sun
Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of …, 2021
192021
An efficient wait-free resizable hash table
P Fatourou, ND Kallimanis, T Ropars
Proceedings of the 30th on Symposium on Parallelism in Algorithms and …, 2018
192018
Eight Open Problems in Distributed Computing.
J Aspnes, C Busch, S Dolev, P Fatourou, C Georgiou, AA Shvartsman, ...
Bull. EATCS 90, 109-126, 2006
192006
A tight time lower bound for space-optimal implementations of multi-writer snapshots
P Fatourou, F Fich, E Ruppert
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003
192003
The system can't perform the operation now. Try again later.
Articles 1–20