Damian Niwinski

66 papers A* 9A 5B 13C 1Journal 31Unranked 5
YearRankTypeTitle / Venue / Authors
2026 A conf
Generalised Quantifiers Based on Rabin-Mostowski Index.
STACS
Denis Kuperberg, Damian Niwinski, Pawel Parys, Michal Skrzypczak
2026 J jnl
Generalised Quantifiers Based on Rabin-Mostowski Index.
CoRR
Denis Kuperberg, Damian Niwinski, Pawel Parys, Michal Skrzypczak
2025 A conf
A Dichotomy Theorem for Ordinal Ranks in MSO.
STACS
Damian Niwinski, Pawel Parys, Michal Skrzypczak
2025 J jnl
A Dichotomy Theorem for Ordinal Ranks in MSO.
CoRR
Damian Niwinski, Pawel Parys, Michal Skrzypczak
2024 J jnl
Computing measures of weak-MSO definable sets of trees.
CoRR
Damian Niwinski, Marcin Przybylko, Michal Skrzypczak
2023 A* conf
The Probabilistic Rabin Tree Theorem
LICS
Damian Niwinski, Pawel Parys, Michal Skrzypczak
2023 J jnl
The Probabilistic Rabin Tree Theorem.
CoRR
Damian Niwinski, Pawel Parys, Michal Skrzypczak
2022 J jnl
Daniel Simson Obituary.
Fundam. Informaticae
Stanislaw Kasjan, Damian Niwinski
2021 B conf
A Quasi-Polynomial Black-Box Algorithm for Fixed Point Evaluation.
CSL
André Arnold, Damian Niwinski, Pawel Parys
2021 B conf
On Guidable Index of Tree Automata.
MFCS
Damian Niwinski, Michal Skrzypczak
2020 A* conf
Computing Measures of Weak-MSO Definable Sets of Trees.
ICALP
Damian Niwinski, Marcin Przybylko, Michal Skrzypczak
2020 J jnl
EATCS Distinguished Dissertation Award 2020 - Call for Nominations.
Bull. EATCS
Susanne Albers, Nikhil Bansal, Elvira Mayordomo, Dale Miller, Jaroslav Nesetril, Damian Niwinski, David Peleg, Vladimiro Sassone, Alexandra Silva
2019 J jnl
EATCS Distinguished Dissertation Award 2019 - Call for Nominations.
Bull. EATCS
David Peleg, Susanne Albers, Elvira Mayordomo, Dale Miller, Jaroslav Nesetril, Damian Niwinski, Vladimiro Sassone
2019 J jnl
Preface.
Fundam. Informaticae
Mieczyslaw Kula, Damian Niwinski, Jacek Pomykala
2017 J jnl
Preface.
Fundam. Informaticae
Damian Niwinski, Ewa Orlowska
2016 J jnl
Contribution of Warsaw Logicians to Computational Logic.
Axioms
Damian Niwinski
2014 — ch.
A simple indeterminate infinite game.
Logic, Computation, Hierarchies
Eryk Kopczynski, Damian Niwinski
2014 J jnl
On the Separation Question for Tree Languages.
Theory Comput. Syst.
André Arnold, Henryk Michalewski, Damian Niwinski
2013 B conf
The Ackermann Award 2013.
CSL
Anuj Dawar, Thomas A. Henzinger, Damian Niwinski
2012 J jnl
Alan Turing and Systems Biology.
ERCIM News
Anna Gambin, Anna K. Marciniak-Czochra, Damian Niwinski
2012 — conf
On Topological Completeness of Regular Tree Languages.
Logic and Program Semantics
Henryk Michalewski, Damian Niwinski
2012 A conf
On the separation question for tree languages.
STACS
André Arnold, Henryk Michalewski, Damian Niwinski
2012 J jnl
Preface.
Fundam. Informaticae
Jerzy Jaworski, Mieczyslaw Kula, Damian Niwinski, Jerzy Urbanowicz
2012 B conf
The Ackermann Award 2012.
CSL
Thierry Coquand, Anuj Dawar, Damian Niwinski
2010 J jnl
On the Borel Complexity of MSO Definable Sets of Branches.
Fundam. Informaticae
Mikolaj Bojanczyk, Damian Niwinski, Alexander Rabinovich, Adam Radziwonczyk-Syta, Michal Skrzypczak
2010 J jnl
Preface.
Fundam. Informaticae
Anna Gambin, Damian Niwinski, Pawel Urzyczyn
2010 B conf
The Ackermann Award 2010.
CSL
Johann A. Makowsky, Damian Niwinski
2010 J jnl
Two-way deterministic automata with two reversals are exponentially more succinct than with one reversal.
Inf. Process. Lett.
Marcin Balcerzak, Damian Niwinski
2009 B ed.
Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings
MFCS
Rastislav Královic, Damian Niwinski
2009 A conf
On the Borel Inseparability of Game Tree Languages.
STACS
Szczepan Hummel, Henryk Michalewski, Damian Niwinski
2008 — conf
On the topological complexity of tree languages.
Logic and Automata
André Arnold, Jacques Duparc, Filip Murlak, Damian Niwinski
2008 B conf
The Ackermann Award 2008.
CSL
Johann A. Makowsky, Damian Niwinski
2007 J jnl
Continuous Separation of Game Languages.
Fundam. Informaticae
André Arnold, Damian Niwinski
2007 B conf
The Ackermann Award 2007.
CSL
Martin Grohe, Martin Hyland, Johann A. Makowsky, Damian Niwinski
2006 J jnl
On the positional determinacy of edge-labeled games.
Theor. Comput. Sci.
Thomas Colcombet, Damian Niwinski
2005 A* conf
Unsafe Grammars and Panic Automata.
ICALP
Teodor Knapik, Damian Niwinski, Pawel Urzyczyn, Igor Walukiewicz
2004 C conf
Deciding Nondeterministic Hierarchy of Deterministic Tree Automata.
WoLLIC
Damian Niwinski, Igor Walukiewicz
2004 J jnl
Editorial.
Ann. Pure Appl. Log.
Zofia Adamowicz, Sergei N. Artëmov, Damian Niwinski, Ewa Orlowska, Anna B. Romanowska, Jan Wolenski
2003 J jnl
A gap property of deterministic tree languages.
Theor. Comput. Sci.
Damian Niwinski, Igor Walukiewicz
2003 — conf
Hierarchies in mu-Calculus (Invited Talk).
FICS
Damian Niwinski
2002 B conf
Higher-Order Pushdown Trees Are Easy.
FoSSaCS
Teodor Knapik, Damian Niwinski, Pawel Urzyczyn
2002 B conf
µ-Calculus via Games.
CSL
Damian Niwinski
2001 — conf
Deciding Monadic Theories of Hyperalgebraic Trees.
TLCA
Teodor Knapik, Damian Niwinski, Pawel Urzyczyn
1999 J jnl
On distributive fixed-point expressions.
RAIRO Theor. Informatics Appl.
Helmut Seidl, Damian Niwinski
1998 A conf
Relating Hierarchies of Word and Tree Automata.
STACS
Damian Niwinski, Igor Walukiewicz
1998 A* conf
The Horn Mu-calculus.
LICS
Witold Charatonik, David A. McAllester, Damian Niwinski, Andreas Podelski, Igor Walukiewicz
1997 J jnl
Fixed Point Characterization of Infinite Behavior of Finite-State Systems.
Theor. Comput. Sci.
Damian Niwinski
1997 J jnl
y = 2x vs. y = 3x.
J. Symb. Log.
Alexei P. Stolboushkin, Damian Niwinski
1996 B conf
First-Order Queries over Temporal Databases Inexpressible in Temporal Logic.
EDBT
David Toman, Damian Niwinski
1996 J jnl
Games for the mu-Calculus.
Theor. Comput. Sci.
Damian Niwinski, Igor Walukiewicz
1995 J jnl
Automata on Infinite Trees with Counting Constraints
Inf. Comput.
Danièle Beauquier, Damian Niwinski
1995 J jnl
On the Feasibility of Checking Temporal Integrity Constraints.
J. Comput. Syst. Sci.
Jan Chomicki, Damian Niwinski
1993 — conf
Automata on Infinite Trees with Counting Constraints.
TAPSOFT
Danièle Beauquier, Damian Niwinski
1993 A* conf
On the Feasibility of Checking Temporal Integrity Constraints.
PODS
Jan Chomicki, Damian Niwinski
1993 J jnl
The Effect of the Number of Successful Paths in a BüChi Tree Automaton.
Int. J. Algebra Comput.
Danièle Beauquier, Maurice Nivat, Damian Niwinski
1993 A* conf
y = 2x vs. y = 3x
LICS
Damian Niwinski, Alexei P. Stolboushkin
1992 — ch.
Fixed point characterization of weak monadic logic definable sets of trees.
Tree Automata and Languages
André Arnold, Damian Niwinski
1991 J jnl
A Geometrical View of the Determinization and Minimization of Finite-State Automata.
Math. Syst. Theory
Bruno Courcelle, Damian Niwinski, Andreas Podelski
1991 B conf
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
Danièle Beauquier, Maurice Nivat, Damian Niwinski
1991 J jnl
Cellular automata on tress, a model for parallel computation.
Fundam. Informaticae
Jan Mycielski, Damian Niwinski
1991 B conf
On the Cardinality of Sets of Infinite Trees Recognizable by Finite Automata.
MFCS
Damian Niwinski
1990 J jnl
Fixed Point Characterization of Büchi Automata on Infinite Trees.
J. Inf. Process. Cybern.
André Arnold, Damian Niwinski
1988 A* conf
Fixed Points vs. Infinite Generation
LICS
Damian Niwinski
1986 A* conf
On Fixed-Point Clones (Extended Abstract).
ICALP
Damian Niwinski
1984 J jnl
Fixed-Point Characterization of Context-Free \infty-Languages
Inf. Control.
Damian Niwinski
1982 A* conf
Fixed-Point Semantics for Algebraic (Tree) Grammars (Extended Abstract).
ICALP
Damian Niwinski