Thorsten Wißmann
{Thorsten Wi{\ss}mann}

Posters

Talks

02/2021 CS Theory Seminar (TSEM) in Tallinn: Generic and Efficient Coalgebraic Partition Refinement
03/2020 D-CON 2020 in Duisburg: Generic and Efficient Partition Refinement
04/2019 International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2019) in Prague: Path Category for Free -- Open Morphisms from Coalgebras
09/2018 Highlights of Logic, Games and Automata in Berlin: Efficient and Modular Coalgebraic Partition Refinement
03/2018 ERATO MMSD Colloquium in Tokyo: Efficient Coalgebraic Partition Refinement
09/2017 International Conference on Concurrency Theory (CONCUR 2017) in Berlin: Efficient Coalgebraic Partition Refinement
06/2017 CALCO Early Ideas in Ljubljana: An Efficient Coalgebraic Paige Tarjan Algorithm
04/2016 International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2016) in Eindhoven: A New Foundation for Finitary Corecursion
04/2016 International Workshop on Coalgebraic Methods in Computer Science (CMCS 2016) in Eindhoven: Regular Behaviours with Names
06/2015 Conference on Algebra and Coalgebra in Computer Science (CALCO 2015) in Nijmegen: Finitary Corecursion for the Infinitary λ-Calculus
06/2015 CALCO Early Ideas (Workshop während CALCO) in Nijmegen: The Locally Finite Fixpoint
07/2013 International Workshop on Description Logics (DL 2013) in Ulm: Reasoning With Bounded Self-Reference Using Logical Interpreters