Panagiota Fatourou       

Associate Professor, University of Crete
Department of Computer Science

P.O.Box 2208
Voutes Campus
GR-70013 Heraklion
Crete Island, GREECE

Tel: +30 2810 393549
Fax: +30 2810 393591
E-mail:
Room: K311
&
Foundation for Research and Technology - Hellas (FORTH)
Institute of Computer Science (ICS)
N. Plastira 100
Vassilika Vouton, GR-70013 Heraklion
Crete Island, Greece

Tel: +30 2810 391727
Fax: +30 2810 391609
Room: Ã121 (Main FORTH Building)


Chair of the ACM Europe Council and the Greek ACM-W Chapter.

Member-at-large of the Steering Committee of the ACM Symposium on Principles of Distributed Computing.


Panagiota Fatourou is an Associate Professor at the Department of Computer Science of the University of Crete, Greece and the Institute of Computer Science (ICS) of the Foundation for Research and Technology - Hellas (FORTH). She has been a visiting Professor at the School of Computer and Communication Sciences, École Polytechnique Fédérale de Lausanne in Switzerland. Prior to joining the University of Crete and FORTH ICS, she was a full-time faculty member at the Department of Computer Science & Engineering of the University of Ioannina. She has worked as a postdoc at Max-Planck Institut für Informatik, Saarbrücken, Germany, and at the Computer Science Department of the University of Toronto, Canada. Her research interests focus on theoretical aspects of computer science with emphasis on the theory of parallel and distributed computing.

Panagiota Fatourou is the chair of the ACM Europe Council. She has served as the editor of the Distributed Computing Column of the Bulletin of the European Association for Theoretical Computer Science (BEATCS) and as the General Chair of the ACM Symposium on Principles of Distributed Computing (PODC 2013). She is a member-at-large of the steering committee of the ACM Symposium on Principles of Distributed Computing (PODC) and she has served in the steering committee of the International Conference on Principles of Distributed Systems (OPODIS). She has participated in the PC of more than 35 conferences. She has been an ACM Distinguished Speaker.

Panagiota Fatourou was the coordinator of TransForm - Theoretical Foundations of Transactional Memory, an EU-funded Marie Curie Initial Training Network (2008 - 2013), and the co-coordinator (together with Manolis Katevenis) of the GreenVM project (ARISTEIA Action of the Operational Programme "Education and Lifelong Learning"). She was the Greek representative of the COST Action Euro-TM. She has participated in many additional research and development projects.

 


Affiliated Conferences & other Professional Activities

     Panagiota Fatourou is a member of the PC of ICDCN 2020 and SIROCCO 2020.

     Member of the PC of ACM PODC 2019 and ACM PODC 2017.

     Member of the Extended Review Committee of PPoPP 2018.

     Chair of the Evaluation Panel of the Minerva Informatics Equality Award, 2018.

     PC co-chair (together with Prof. Sergio Rajsbaum) of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS’17) for the track “Distributed Computing and Communication Networks”.

     PC co-chair (together with Prof. Fernando Pedone) of the 20th International Conference on Principles of Distributed Systems (OPODIS 2016), 13-16 December 2016, Madrid, Spain.

     Panagiota Fatourou has been a member of the Executive Committee of ACM-Women Europe, the chair of the Supporters Programme of womENcourage 2017, the Poster Evaluation Committee Chair of womENcourage 2016.


Selected Publications

     Panagiota Fatourou and Chris Hankin, Europe Region Special Section - Communications of the ACM, 62(4), ISSN:0001-0782, 2019, https://cacm.acm.org/magazines/2019/4/235591-welcome-to-the-europe-region-special-section/fulltext and https://cacm.acm.org/ videos/europe-region.

     Victor Bushkov, Dmytro Dziuma, Panagiota Fatourou, Rachid Guerraoui, “The PCL theorem: transactions cannot be parallel, consistent and live”, submitted to Journal of the ACM (69 pages), Volume 66 Issue 1, January 2019, Article No. 2.

     P. Fatourou, F. Fich and E. Ruppert, ``Time Lower Bounds for Implementations of Multi-Writer Snapshots’’, Journal of the ACM, 54(6), article 30 (34 pages), December 2007.

     Panagiota Fatourou and Nikolaos Kallimanis, ``Lower and Upper Bounds for Single-Scanner Snapshot Implementations’’, Distributed Computing, Volume 30, Issue 4, pp 231–260, August 2017.

     Faith Ellen, Panagiota Fatourou, Eleftherios Kosmas, Alessia Milani, and Corentin Travers, ``Universal Constructions that Ensure Disjoint-Access Parallelism and Wait-Freedom”, Distributed Computing, , Volume 29, Issue 4, pp 251–277.

     Botao Peng, Panagiota Fatourou, and Themis Palpanas, “MESSI: In-Memory Data Series Indexing”, 36th IEEE International Conference on Data Engineering (ICDE 2020), Dallas, Texas, April 2020.

     Panagiota Fatourou, Elias Papavasileiou, Eric Ruppert, “Persistent Non-Blocking Binary Search Trees Supporting Wait-Free Range Queries’’, In Proc. of the 31st ACM SIGACT/SIGARCH Symposium on Parallelism in Algorithms and Architectures (SPAA 2019), pp. 275-286, Phoenix, USA, June 2019.

     Diego Didona, Panagiota Fatourou, Rachid Guerraoui, Jingjing Wang, and Willy Zwaenepoel, “Distributed Transactional Systems Cannot Be Fast’’, In Proc. of the 31st ACM SIGACT/SIGARCH Symposium on Parallelism in Algorithms and Architectures (SPAA 2019), pp. 369-380, Phoenix, USA, June 2019.

     Panagiota Fatourou, Nikolaos D. Kallimanis, and Thomas Ropars, “An Efficient Wait-free Resizable Hash Table”, In Proc. of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA ‘18), pp.111-120, Vienna, Austria, July 2018.

     Victor Bushkov, Dmytro Dziuma, Panagiota Fatourou, Rachid Guerraoui, “The PCL theorem: transactions cannot be parallel, consistent and live”, Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA’14),  pp. 178-187, Prague, Czech Republic, June 2014.

     Faith Ellen, Panagiota Fatourou, Joanna Helga, Eric Ruppert, “The amortized complexity of non-blocking binary search trees”, Proceedings of the 33rd Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC’14), pp. 332-340, Paris, France, July 2014.

     F. Ellen, P. Fatourou, E. Kosmas, A. Milani, C. Travers, ``Universal Constructions that Ensure Disjoint-Access Parallelism and Wait-Freedom”, Proceedings of the 31st  Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC’12), Madeira, Portugal, July 2012.

     P. Fatourou and N.D. Kallimanis, ``Revisiting the Combining Technique’’, Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP'12), New Orleans, LA, USA, February 2012.

     P. Fatourou and N. D. Kallimanis, ``A Highly-Efficient Wait-Free Universal Construction”, Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '11), pp. 325-334, San Jose, California, USA, June 2011. Also in Theory of Computing Systems (special issue devoted to SPAA’2011), Vol. 55, No. 3, pp. 475-520, 2014.

     F. Ellen, P. Fatourou, E. Ruppert, and F. van Breugel, "Non-Blocking Binary Search Trees", Proceedings of the 29th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC'10), Zurich, Switzerland, July 2010.

     P. Fatourou, F. Fich and E. Ruppert, `` Time-Space Tradeoffs for Implementations of Snapshots’’, Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC’06), pp. 169 - 178, Seattle, WA, 2006.

See her full cv for a complete list.
 


Students who are interested to pursue a thesis (BSc, MSc, PhD) under the supervision of Panagiota Fatourou, please send an e-mail to .
 


Last Modified: Thu, Oct 17, 1:45:30 EET DST 2019, by Panagiota Fatourou