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
2582010
Revisiting the combining synchronization technique
P Fatourou, ND Kallimanis
Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of …, 2012
1732012
A highly-efficient wait-free universal construction
P Fatourou, ND Kallimanis
Proceedings of the twenty-third annual ACM symposium on Parallelism in …, 2011
1432011
Women are needed in STEM: European policies and incentives
P Fatourou, Y Papageorgiou, V Petousi
Communications of the ACM 62 (4), 52-52, 2019
492019
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
48*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
472014
Highly-efficient wait-free synchronization
P Fatourou, ND Kallimanis
Theory of Computing Systems 55 (3), 475-520, 2014
452014
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
432018
Messi: In-memory data series indexing
B Peng, P Fatourou, T Palpanas
2020 IEEE 36th International Conference on Data Engineering (ICDE), 337-348, 2020
412020
Recommender systems under European AI regulations
T Di Noia, N Tintarev, P Fatourou, M Schedl
Communications of the ACM 65 (4), 69-73, 2022
382022
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
372020
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
322019
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
272021
SING: Sequence indexing using GPUs
B Peng, P Fatourou, T Palpanas
2021 IEEE 37th International Conference on Data Engineering (ICDE), 1883-1888, 2021
262021
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
252018
Consistency for transactional memory computing
D Dziuma, P Fatourou, E Kanellou
Transactional Memory. Foundations, Algorithms, Tools, and Applications: COST …, 2015
252015
The redblue adaptive universal constructions
P Fatourou, ND Kallimanis
International Symposium on Distributed Computing, 127-141, 2009
232009
The space complexity of unbounded timestamps
F Ellen, P Fatourou, E Ruppert
Distributed Computing 21 (2), 103-115, 2008
222008
The PCL theorem: transactions cannot be parallel, consistent, and live
V Bushkov, D Dziuma, P Fatourou, R Guerraoui
Journal of the ACM (JACM) 66 (1), 1-66, 2018
21*2018
Hercules against data series similarity search
K Echihabi, P Fatourou, K Zoumpatianos, T Palpanas, H Benbrahim
arXiv preprint arXiv:2212.13297, 2022
202022
The system can't perform the operation now. Try again later.
Articles 1–20