Theoretical Computer Science
Past events
-
On the automaticity of counting functions associated to automatic sequences
Presenter(s): Markus Whiteland -
Threshold Implementations and Permutations’ Decompositions
Presenter(s): Pantelimon Stanica -
Combining Word Equations, Regular Languages and Arithmetic
Presenter(s): Joel Day -
Generalized Core Spanner Inexpressibility via Ehrenfeucht-Fraisse Games for FC
Presenter(s): Sam Thompson -
Coset leaders of the first order Reed-Muller codes in the classes of Niho and Threshold functions
Presenter(s): Serge Feukoua -
Regular Languages - A Descriptional Complexity Perspective
Presenter(s): Luca Prigioniero -
Fast Datalog on Text
Presenter(s): Owen Bell -
Probabilistic estimation of the algebraic degree of Boolean functions
Presenter(s): Percy Reyes-Paredes