Conference Programme
Thursday 7th February 2019
|
09:00-09:25 |
Registration |
|
09:25-09:30 |
Opening and Welcome |
|
First session chaired by George Theodorakopoulos | |
|
09:30-10:30 |
Invited talk: Graham Cormode Distributed private data collection at scale |
|
10:30-11:00 |
Coffee Break |
|
Second session chaired by Tomasz Radzik | |
|
11:00-11:25 |
Nan Kang Best-of-Three Voting on Dense Graphs |
|
11:25-11:50 |
Ansgar Scherp About Extreme Analyses of Texts and Graphs |
|
11:50-14:30 |
Lunch |
|
Third session chaired by Robert Mercas | |
|
14:30-14:55 |
Gabriele Fici Constructing Antidictionaries in Output-Sensitive Space |
|
14:55-15:20 |
Richard Pinch Enumerating Words with Forbidden Factors |
|
15:20- 15:45 |
Rachel Kirsch Universal Partial Words |
|
15:45- 16:20 |
Coffee Break |
|
Fourth session chaired by Carl Barton | |
|
16:20-16:45 |
Bill Smyth A New Approach to Regular & Indeterminate Strings |
|
16:45-17:10 |
Jan Holub On-line Search in IUPAC Nucleotide Sequences |
Friday 8th February 2019
|
First session chaired by Solon Pissis | |
|
09:30-10:30 |
Invited talk: Rajeev Raman In-Memory Data Mining via Succinct Data Structures |
|
10:30-11:00 |
Coffee Break |
|
Second session chaired by Grigorios Loukides | |
|
11:00-11:25 |
George Theodorakopoulos Inferring Paths from Anonymized Visit Events |
|
11:25-11:50 |
Huiping Chen Viral Marketing without Tears: Limiting the Harm caused by Diffusing Information to Vulnerable Users |
|
11:50-12:15 |
Changyu Dong Forward Private Searchable Symmetric Encryption with Optimized I/O Efficiency |
|
12:15-14:30 |
Lunch |
|
Third session chaired by Maxime Crochemore | |
|
14:30-14:55 |
Erik Garrison Dynamic Succinct Genome Variation Graphs |
|
14:55-15:20 |
Felipe A. Louza Space-efficient Construction of Succinct de Bruijn Graphs |
|
15:20-15:45 |
Bartlomiej Dudek Slowing Down Top Trees for Better Worst-Case Compression |
|
15:45-16:20 |
Coffee Break |
|
Fourth session chaired by Bill Smyth | |
|
16:20-16:45 |
Sylvie Hamel Median of Permutations: Space Reduction Techniques and Link with the 3-hitting Set Problem |
|
16:45-17:10 |
Stepan Plachy Deterministic k-Local Tree Automata and their Work-optimal Parallel Run |
|
17:10-17:15 |
Closing Remarks |
