Damian Niwinski

Anna Gambin, Anna Marciniak-Czochra, Damian Niwinski: Alan Turing and Systems Biology. ERCIM News 2012(91) (2012)

Jerzy Jaworski, Mieczyslaw Kula, Damian Niwinski, Jerzy Urbanowicz: Preface. Fundam. Inform. 114(3-4) (2012)

Henryk Michalewski, Damian Niwinski: On Topological Completeness of Regular Tree Languages. Logic and Program Semantics 2012: 165-179

Thierry Coquand, Anuj Dawar, Damian Niwinski: The Ackermann Award 2012. CSL 2012: 1-5

André Arnold, Henryk Michalewski, Damian Niwinski: On the separation question for tree languages. STACS 2012: 396-407

Mikolaj Bojanczyk, Damian Niwinski, Alexander Rabinovich, Adam Radziwonczyk-Syta, Michal Skrzypczak: On the Borel Complexity of MSO Definable Sets of Branches. Fundam. Inform. 98(4): 337-349 (2010)

Anna Gambin, Damian Niwinski, Pawel Urzyczyn: Preface. Fundam. Inform. 103(1-4) (2010)

Marcin Balcerzak, Damian Niwinski: Two-way deterministic automata with two reversals are exponentially more succinct than with one reversal. Inf. Process. Lett. 110(10): 396-398 (2010)

Johann A. Makowsky, Damian Niwinski: The Ackermann Award 2010. CSL 2010: 544-546

Szczepan Hummel, Henryk Michalewski, Damian Niwinski: On the Borel Inseparability of Game Tree Languages. STACS 2009: 565-575

Rastislav Královic, Damian Niwinski (Eds.): Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings. Lecture Notes in Computer Science 5734, Springer 2009, isbn 978-3-642-03815-0

André Arnold, Jacques Duparc, Filip Murlak, Damian Niwinski: On the topological complexity of tree languages. Logic and Automata 2008: 9-28

Johann A. Makowsky, Damian Niwinski: The Ackermann Award 2008. CSL 2008: 508-512

André Arnold, Damian Niwinski: Continuous Separation of Game Languages. Fundam. Inform. 81(1-3): 19-28 (2007)

Martin Grohe, Martin Hyland, Johann A. Makowsky, Damian Niwinski: The Ackermann Award 2007. CSL 2007: 589-597

Thomas Colcombet, Damian Niwinski: On the positional determinacy of edge-labeled games. Theor. Comput. Sci. 352(1-3): 190-196 (2006)

Damian Niwinski, Igor Walukiewicz: Deciding Nondeterministic Hierarchy of Deterministic Tree Automata. Electr. Notes Theor. Comput. Sci. 123: 195-208 (2005)

Teodor Knapik, Damian Niwinski, Pawel Urzyczyn, Igor Walukiewicz: Unsafe Grammars and Panic Automata. ICALP 2005: 1450-1461

Zofia Adamowicz, Sergei N. Artëmov, Damian Niwinski, Ewa Orlowska, Anna B. Romanowska, Jan Wolenski: Editorial. Ann. Pure Appl. Logic 126(1-3): 3-4 (2004)

Damian Niwinski, Igor Walukiewicz: A gap property of deterministic tree languages. Theor. Comput. Sci. 1(303): 215-231 (2003)

Damian Niwinski: µ-Calculus via Games. CSL 2002: 27-43

Teodor Knapik, Damian Niwinski, Pawel Urzyczyn: Higher-Order Pushdown Trees Are Easy. FoSSaCS 2002: 205-222

Teodor Knapik, Damian Niwinski, Pawel Urzyczyn: Deciding Monadic Theories of Hyperalgebraic Trees. TLCA 2001: 253-267

Helmut Seidl, Damian Niwinski: On distributive fixed-point expressions. ITA 33(4/5): 427-446 (1999)

Witold Charatonik, David A. McAllester, Damian Niwinski, Andreas Podelski, Igor Walukiewicz: The Horn Mu-calculus. LICS 1998: 58-69

Damian Niwinski, Igor Walukiewicz: Relating Hierarchies of Word and Tree Automata. STACS 1998: 320-331

Alexei P. Stolboushkin, Damian Niwinski: y = 2x vs. y = 3x. J. Symb. Log. 62(2): 661-672 (1997)

Damian Niwinski: Fixed Point Characterization of Infinite Behavior of Finite-State Systems. Theor. Comput. Sci. 189(1-2): 1-69 (1997)

Damian Niwinski, Igor Walukiewicz: Games for the mu-Calculus. Theor. Comput. Sci. 163(1&2): 99-116 (1996)

David Toman, Damian Niwinski: First-Order Queries over Temporal Databases Inexpressible in Temporal Logic. EDBT 1996: 307-324

Danièle Beauquier, Damian Niwinski: Automata on Infinite Trees with Counting Constraints. Inf. Comput. 120(1): 117-125 (1995)

Jan Chomicki, Damian Niwinski: On the Feasibility of Checking Temporal Integrity Constraints. J. Comput. Syst. Sci. 51(3): 523-535 (1995)

Damian Niwinski, Alexei P. Stolboushkin: y = 2x vs. y = 3x. LICS 1993: 172-178

Jan Chomicki, Damian Niwinski: On the Feasibility of Checking Temporal Integrity Constraints. PODS 1993: 202-213

Danièle Beauquier, Damian Niwinski: Automata on Infinite Trees with Counting Constraints. TAPSOFT 1993: 266-281

André Arnold, Damian Niwinski: Fixed point characterization of weak monadic logic definable sets of trees. Tree Automata and Languages 1992: 159-188

Jan Mycielski, Damian Niwinski: Cellular automata on tress, a model for parallel computation. Fundam. Inform. 15(2): 139-144 (1991)

Bruno Courcelle, Damian Niwinski, Andreas Podelski: A Geometrical View of the Determinization and Minimization of Finite-State Automata. Mathematical Systems Theory 24(2): 117-146 (1991)

Danièle Beauquier, Maurice Nivat, Damian Niwinski: About the Effect of the Number of Successful Paths in an Infinite Tree on the Recognizability by a Finite Automaton with Büchi Conditions. FCT 1991: 136-145

Damian Niwinski: On the Cardinality of Sets of Infinite Trees Recognizable by Finite Automata. MFCS 1991: 367-376

André Arnold, Damian Niwinski: Fixed Point Characterization of Büchi Automata on Infinite Trees. Elektronische Informationsverarbeitung und Kybernetik 26(8/9): 451-459 (1990)

Damian Niwinski: Fixed Points vs. Infinite Generation. LICS 1988: 402-409

Damian Niwinski: On Fixed-Point Clones (Extended Abstract). ICALP 1986: 464-473

Damian Niwinski: Fixed-Point Characterization of Context-Free \infty-Languages. Information and Control 61(3): 247-276 (1984)

Damian Niwinski: Fixed-Point Semantics for Algebraic (Tree) Grammars (Extended Abstract). ICALP 1982: 384-396