Wydział Matematyki, Informatyki i Mechaniki Uniwersytetu Warszawskiego
Publications
Damian Niwiński
2017
- Mikołaj Bojańczyk, Wojciech Czerwiński, Piotr Hofman, Szczepan Hummel, Bartosz Klin, Eryk Kopczyński, Sławomir Lasota, Filip Aleksander Mazowiecki, Henryk Michalewski, Damian Niwiński, Joanna Ochremiak, Paweł Parys, Michał Pilipczuk, Wojciech Rytter, Michał Paweł Skrzypczak, Szymon Toruńczyk, Igor Walukiewicz, Joost Winter and Lorenzo ClementeFilip Murlak (ed.), 200 Problems in Formal Languages and Automata Theory, Uniwersytet Warszawski, Warszawa 2017.see in PBN
2012
- Henryk Michalewski and Damian Niwiński, On Topological Completeness of Regular Tree Languages, Lecture Notes In Computer Science 2012, p. 165–179.see in PBN
- Anna Gambin, Anna Marciniak-Czochra and Damian Niwiński, Alan Turing and Systems Biology, Ercim News 2012 (91) 2012.see in PBN
- Thierry Coquand, Anuj Dawar and Damian Niwiński, The Ackermann Award 2012, in: CSL, 2012.see in PBN
- Andre Arnold, Henryk Michalewski and Damian Niwiński, On the separation question for tree languages, in: Symposium on Theoretical Aspects of Computer Science (STACS), Dagstuhl Publishing, Paris 2012.see in PBN
2010
- Arnaud Carayol, Christof Loding, Damian Niwiński and Igor Walukiewicz, Choice functions and well-orderings over the infinite binary tree, Central European Journal Of Mathematics 8 (4) 2010, p. 662–682.see in PBN
- Mikołaj Bojańczyk, Damian Niwiński, Alexander Rabinovich, Adam Radziwonczyk-Syta and Michał Skrzypczak, On the Borel Complexity of MSO Definable Sets of Branches, Fundamenta Informaticae 98 (4) 2010, p. 337–349.see in PBN
- Anna Gambin, Damian Niwiński and Paweł Urzyczyn, Preface, Fundamenta Informaticae 103 (1-4) 2010.see in PBN
- Marcin Balcerzak and Damian Niwiński, Two-way deterministic automata with two reversals are exponentially more succinct than with one reversal, Information Processing Letters 110 (10) 2010, p. 396–398.see in PBN
2009
- Szczepan Hummel, Henryk Michalewski and Damian Niwiński, On the Borel inseparability of game tree languages, in: 26th International Symposium on Theoretical Aspects of Computer Science, Freiburg, February 26 - 28, 2009, Leibniz-Zentrum fuer Informatik, Schloss Dagstuhl 2009.see in PBN
- Rastislav Kralovic and Damian Niwiński (eds.), 34th International Symposium on Mathematical Foundations of Computer Science, SPRINGER-VERLAG BERLIN, HEIDELBERGER PLATZ 3, BERLIN, GERMANY, D-14197 2009.see in PBN
2007
- A. Arnold and D. Niwiński, Continuous Separation of Game Languages, Fundamenta Informaticae Vol. 81, nr 1-3 2007, p. 19–28.see in PBN
- Andre Arnold, Jacques Duparc, Filip Murlak and Damian Niwiński, On the topological complexity of tree languages, in: Logic and automata: History and Perspectives, Amsterdam University Press, Amsterdam 2007.see in PBN
2004
- Zofia Adamowicz, Sergei Artemov, Damian Niwiński, Ewa Orłowska, Anna Romanowska and Jan Woleński (eds.), Provinces of logic determined. Essays in the memory of Alfred Tarski, Elsevier, Amsterdam 2004.see in PBN
2000
- Damian Niwiński and Andre Arnold, O abstrakcyjnym podejściu do rachunku punktów stałych, in: Materiały z konferencji: Informatyka teoretyczna - metody analizy informacji niekompletnej i rozproszonej, Politechnika Białostocka, Białystok 2000.see in PBN
You are not logged in | log in
