Damian Niwinski
Talks

These mysterious game tree languages,
seminar at LIAFA, Paris, October 2015.

Trees with decidable theories,
at
ASL North American Annual Meeting, Boulder, CO, May 2014.

Logic of information processes,
at
Le culture dinanzi a Dio, Roma, June 2013.

Automatatheoretic hierarchies,
Games/Gandalf, Napoli, September 2012.

In search of the shortest description,
Philosophers' Rally, Gdansk 2012.

On separation question for automatatheoretic hierarchies, Dagstuhl,
October 2011.

Complexity of infinite tree languageswhen automata meet topology,
seminar at the University of Liverpool, October 2010.

Symmetry and duality in fixedpoint calculus
invited talk at
Square of Opposition 
Corte, Corsica  June 1720, 2010.

On the complexity of infinite computations 2
at Technion, Haifa, and Tel Aviv University, February 2008.

On the complexity of infinite computations 1
at the Isaac Newton Institute, Cambridge, June 2006.

Unsafe grammars and panic automata
ICALP 2005  GAMES 2005.

Sur la structure rationnelle du calcul infini
expose a l'occasion de la remise de la Medaille de Bronze du CNRS
a Igor Walukiewicz, Mai 2004 (in French).
 Project report 2006 (in Polish).

Problem P=NP
2009 (in Polish).

About Dietrich Bonhoeffer
(nonscientific, in Polish, 2010)