Publications

Damian Niwiński

Number of publications: 32

2023

• Damian Niwiński , Paweł Parys , Michał Skrzypczak , The Probabilistic Rabin Tree Theorem*, Thirty-Eighth Annual ACM/IEEE Symposium on Logic in Computer Science, Boston, the United States of America, 26 June 2023 - 29 June 2023. See in PBN

2021

• André Arnold, Damian Niwiński , Paweł Parys , A Quasi-Polynomial Black-Box Algorithm for Fixed Point Evaluation, 29th EACSL Annual Conference on Computer Science Logic, Lublana, Slovenia, 25 January 2021 - 28 January 2021, 183 2021, p. 9:1--9:23. See in PBN
• Damian Niwiński , Michał Skrzypczak , On Guidable Index of Tree Automata, 46th International Symposium on Mathematical Foundations of Computer Science, Tallinn, Estonia, 23 August 2021 - 27 August 2021, 202 2021, p. 81:1--81:14. See in PBN

2020

• Damian Niwiński , Marcin Przybyłko, Michał Skrzypczak , Computing Measures of Weak-MSO Definable Sets of Trees, 47th International Colloquium on Automata, Languages, and Programming, Saarbrücken, Germany, 8 July 2020 - 11 July 2020, 168 2020, p. 136:1--136:18. See in PBN

2017

• Damian Niwiński , Henryk Michalewski , Wojciech Rytter , Joost Winter, Michał Skrzypczak , Szymon Toruńczyk , Michał Pilipczuk , Eryk Kopczyński , Sławomir Lasota , Paweł Parys , Joanna Ochremiak, Wojciech Czerwiński , Bartosz Klin , Igor Walukiewicz, Szczepan Hummel, Mikołaj Bojańczyk , Piotr Hofman , Lorenzo Clemente , Filip Mazowiecki, Filip Murlak , 200 Problems in Formal Languages and Automata Theory, 2017. See in PBN
• Damian Niwiński , Stella Orłowska, Helena Rasiowa's Heritage in Mathematical Logic, Fundamenta Informaticae, 156 (3-4) 2017, p. i-ii. See in PBN

2016

• Damian Niwiński , Contribution of Warsaw Logicians to Computational Logic, Axioms, 2016. See in PBN

2014

• Eryk Kopczyński , Damian Niwiński , A simple indeterminate infinite game, 2014. See in PBN

2013

• André Arnold, Henryk Michalewski , Damian Niwiński , On the Separation Question for Tree Languages, Theory of Computing Systems, 2013. See in PBN

2012

• Anna Gambin , Anna Marciniak-Czochra, Damian Niwiński , Alan Turing and Systems Biology, ERCIM News, 2012. See in PBN
• Andre Arnold, Henryk Michalewski , Damian Niwiński , On the separation question for tree languages, 2012. See in PBN
• Henryk Michalewski , Damian Niwiński , On Topological Completeness of Regular Tree Languages, Lecture Notes in Computer Science, 2012. See in PBN
• Thierry Coquand, Anuj Dawar, Damian Niwiński , The Ackermann Award 2012, 2012. See in PBN

2010

• Arnaud Carayol, Christof Loding, Damian Niwiński , Igor Walukiewicz, Choice functions and well-orderings over the infinite binary tree, Central European Journal of Mathematics, 2010. See in PBN
• Mikołaj Bojańczyk , Damian Niwiński , Alexander Rabinovich, Adam Radziwonczyk-Syta, Michał Skrzypczak , On the Borel Complexity of MSO Definable Sets of Branches, Fundamenta Informaticae, 2010. See in PBN
• Anna Gambin , Damian Niwiński , Paweł Urzyczyn , Preface, Fundamenta Informaticae, 2010. See in PBN
• Marcin Balcerzak, Damian Niwiński , Two-way deterministic automata with two reversals are exponentially more succinct than with one reversal, Information Processing Letters, 2010. See in PBN

2009

• Rastislav Kralovic, Damian Niwiński , 34th International Symposium on Mathematical Foundations of Computer Science, 2009. See in PBN
• Szczepan Hummel, Henryk Michalewski , Damian Niwiński , On the Borel inseparability of game tree languages, 2009. See in PBN

2008

• Johann A. Makowsky, Damian Niwiński , The Ackermann Award 2008, Lecture Notes in Computer Science, 2008. See in PBN

2007

• A. Arnold, Damian Niwiński , Continuous Separation of Game Languages, Fundamenta Informaticae, 2007. See in PBN
• Andre Arnold, Jacques Duparc, Filip Murlak , Damian Niwiński , On the topological complexity of tree languages, 2007. See in PBN

2006

• Thomas Colcombet, Damian Niwiński , On the positional determinacy of edge-labeled games, Theoretical Computer Science, 2006. See in PBN

2005

• Teodor Knapik, Damian Niwiński , Paweł Urzyczyn , Igor Walukiewicz, Unsafe Grammars and Panic Automata, Lecture Notes in Computer Science, 2005. See in PBN

2004

• Zofia Adamowicz, Sergei Artemov, Damian Niwiński , Ewa Orłowska, Anna Romanowska, Jan Woleński, Provinces of logic determined. Essays in the memory of Alfred Tarski, 2004. See in PBN

2003

• Damian Niwiński , Igor Walukiewicz, A gap property of deterministic tree languages, Theoretical Computer Science, 2003. See in PBN

2002

• Teodor Knapik, Damian Niwiński , Paweł Urzyczyn , Higher-order pushdown trees are easy, Lecture Notes in Computer Science, 2002. See in PBN
• Damian Niwiński , Mu-calculus via games, Lecture Notes in Computer Science, 2002. See in PBN

2001

• T. Knapik, Damian Niwiński , Paweł Urzyczyn , Deciding monadic theories of hyperalgebraic trees, Lecture Notes in Computer Science, 2001. See in PBN
• A. Arnold, Damian Niwiński , Rudiments of Mu-calculus, 2001. See in PBN

2000

• Andre Arnold, Damian Niwiński , O abstrakcyjnym podejściu do rachunku punktów stałych, 2000. See in PBN

1999

• Damian Niwiński , Marek Zawadowski , Logic, algebra, and computer science. Helena Rasiowa in memoriam., 1999. See in PBN