Moses Ganardi

(University of Siegen)
hosted by Georg Zetzsche

"Querying Regular Languages over Sliding Windows"

( MPI-SWS talk in Kooperation mit dem Fachbereich Informatik)

A sliding window algorithm for a language L receives a stream of symbols and has to decide at each time step whether the suffix of length n belongs to L or not. The window size n is either a fixed number (in the fixed-size model) or can be controlled online by an adversary (in the variable-size model). In this talk we give a survey on recent results for deterministic and randomized sliding window algorithms for regular languages.while it avoids contention on shared resources by design. Spatial and temporal isolation between different clusters is provided by a partitioning and configuration of the Network-on-Chip that further reduces the worst-case access times to external memory.

Bio: Moses Ganardi is a PhD student in Computer Science at the University of Siegen, Germany, under the supervision of Prof. Dr. Markus Lohrey. His main research interests are formal languages and automata, and their applications in the context of streaming algorithms. He received his B.Sc. degree in Computer Science and Mathematics, in 2011 and 2012, respectively, and his M.Sc. degree in Computer Science in 2013 from the RWTH Aachen,

Time: Wednesday, Germany.29.04.2020, 14:30
Place: MPI-SWS Kaiserslautern, room 111
Video: videocast to MPI-SWS Saarbrücken, room 029