Algorithms and Data Structures Today

Algorithms and Data Structures Today:  

New Techniques, New Problems, New Challenges

Underlying many of the exciting new ideas in computing today are new manifestations of classical data structures. Whether we are interested in analyzing large data sets (e.g., b-trees), processing and producing text (e.g., suffix trees), or exchanging cryptocurrencies (e.g., hash chains), we need practical and efficient algorithms.

However, these new settings lead to new problems. The systems involved are often more dynamic, and data structures may need to cope with change.  Data may be distributed and fault prone. Data may be aggregated from many sources. And these new settings have led to a variety of new techniques, new developments in randomized algorithms, and new approaches.

The goal of this workshop is to explore the current state of the art in data structures and their related algorithms today, in relation to the new types of problems that we are facing.  And the goal is to formulate the next big challenges of the future.

Organisational Plan:

The workshop is going to be run in the style of a Dagstuhl workshop, with both talks as well as time for working on specific topics.  Full participation in the workshop is by invitation only.  Costs will be kept low, with much of the local logistics covered by the NUS School of Computing.

 Organisers:

•  Michael Bender (Stony Brook)

• Diptarka Chakraborty (NUS)

• Martin Farach-Colton (NYU)

• Seth Gilbert (NUS)

All the talks will be held at COM 1 Level 2 Video Conference Room (COM 1 #02-13) 

For discussions among small groups, the rooms are: COM 1 Level 2 Seminar Room 8, 9, 10 (COM 1 #02-08,  #02-09,  #02-10)