BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Date iCal//NONSGML kigkonsult.se iCalcreator 2.20.2//
METHOD:PUBLISH
X-WR-CALNAME;VALUE=TEXT:Eventi DIAG
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:STANDARD
DTSTART:20191027T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20190331T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20200329T020000
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:calendar.18936.field_data.0@www.corsodrupal.uniroma1.it
DTSTAMP:20260407T194427Z
CREATED:20191028T085403Z
DESCRIPTION:Concurrent dictionaries lie in the heart of most modern concurr
 ent applications. We present NB-BST\, the first implementation of a non-bl
 ocking binary search tree in an asynchronous shared-memory system using si
 ngle-word compare-and-swap. We also built upon NB-BST to get PNB-BST\, the
  first implementation of a search tree data structure in an asynchronous s
 hared-memory system that provides a wait-free algorithm for executing comp
 lex queries (such as range queries) on the tree\, in addition to non-block
 ing algorithms for Insert\, Delete and Find.  Such queries are required in
  many big-data applications\, where shared in-memory tree-based data indic
 es must be created for fast data retrieval and useful data analytics. We f
 urther touch upon other wait-free implementations of dictionaries and pres
 ent techniques for achieving efficient synchronization. Short BioPanagiota
  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 fac
 ulty member at the Department of Computer Science & Engineering of the Uni
 versity of Ioannina. She has worked as a postdoc at Max-Planck Institut fü
 r Informatik\, Saarbrücken\, Germany\, and at the Computer Science Departm
 ent of the University of Toronto\, Canada. Her research interests focus on
  the theory of parallel and distributed computing.Panagiota Fatourou is th
 e chair of the ACM Europe Council. She has served as the editor of the Dis
 tributed 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 mem
 ber-at-large of the steering committee of the ACM Symposium on Principles 
 of Distributed Computing (PODC) and she has served in the steering committ
 ee of the International Conference on Principles of Distributed Systems (O
 PODIS). She has participated in the PC of more than 35 conferences. She ha
 s been an ACM Distinguished Speaker.
DTSTART;TZID=Europe/Paris:20191029T120000
DTEND;TZID=Europe/Paris:20191029T120000
LAST-MODIFIED:20230915T092645Z
LOCATION:B203
SUMMARY:Concurrent Dictionaries Supporting Complex Queries - Panagiota Fato
 urou
URL;TYPE=URI:http://www.corsodrupal.uniroma1.it/node/18936
END:VEVENT
END:VCALENDAR