Theoretical Computer Science
Upcoming events
Past events
-
Randomised Load Balancing with Random Deletions
Presenter(s): Lars Nagel -
Theories Involving Equations in the Free Group
Presenter(s): Matthew Konefal -
Breaking the sorting barrier
Presenter(s): Markus Whiteland -
A complexity framework for forbidden subgraphs
Presenter(s): Siani Smith -
On subsequence problems and Parikh matrices
Presenter(s): Robert Mercas -
Word Equations with Length Constraints via Weak Arithmetics and Matrix Reachability Problems
Presenter(s): Matthew Konefal -
Strengthening the KLEIN cipher
Presenter(s): Vincent Voigtlander -
Subsequence Matching and Analysis Problems for Formal Languages
Presenter(s): Timo Specht (Göttingen University, Germany) -
The termination of Nielsen transformations applied to word equations with length constraints
Presenter(s): Benjamin Przybocki (Stanford University) -
FC-Datalog as a Framework for Efficient String Querying
Presenter(s): Owen Bell -
Characterization and Decidability of FC-Definable Regular Languages
Presenter(s): Sam Thompson -
The Sakoda and Sipser problem
Presenter(s): Luca Prigioniero -
Moore determinants
Presenter(s): Ana Salagean