At the Dagstuhl workshop on Data Structures and Advanced Models of Computation on Big Data, we presented contribution ERa — A Practical Approach to Parallel Construction of Suffix Trees by Andrej Brodnik and Matevž Jekovec.
LUSY, FRI, UNI-LJ will be hosting Alejandro López-Ortiz and his post-doctoral student Daniela Maftuleac from March 1st to March 31st 2014. Alejandro López-Ortiz is a professor at the School of Computer Science at the University of Waterloo. His research interests include search engine algorithms, internet tomography, data streams, video on demand, paging, and constraint programming.
In the first week of December Andrej Brodnik, Nataša Kristan and Radovan Krajnc participated in the 4th International Doctoral Consortium On Informatics and Informatics Engineering Education Research in Lithuania. Doctoral Consortium was orginized by Valentina Dagiene. It was intended for doctoral students in Computer Science Education field, where they worked with foreign professors.
On Thursday, 7th November 2013 at 14:00, Matevž Jekovec will revise Ukkonen's online suffix tree construction algorithm in linear time and present the current state-of-the-art parallel Elastic Range algorithm.
The article titled "The Encoding Complexity of Two Dimensional Range Minimum Data Structures" by Gerth Stølting Brodal, Pooya Davoodi and Andrej Brodnik was accepted to this year's ESA 2013.
ESA (European Symposium on Algorithms) is a one of the premier conferences on algorithms. Out of 304 submitted papers, only 69 were accepted this year.
Congratulations to the authors!