Damian Niwinski

According to our database, Damian Niwinski authored at least 56 papers between 1982 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

The Probabilistic Rabin Tree Theorem.

Damian Niwinski, Pawel Parys, Michal Skrzypczak

CoRR, 2023

The Probabilistic Rabin Tree Theorem^*.

Damian Niwinski, Pawel Parys, Michal Skrzypczak

LICS, 2023

2022

Daniel Simson Obituary.

Stanislaw Kasjan, Damian Niwinski

Fundam. Informaticae, 2022

2021

On Guidable Index of Tree Automata.

Damian Niwinski, Michal Skrzypczak

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

A Quasi-Polynomial Black-Box Algorithm for Fixed Point Evaluation.

André Arnold, Damian Niwinski, Pawel Parys

Proceedings of the 29th EACSL Annual Conference on Computer Science Logic, 2021

2020

EATCS Distinguished Dissertation Award 2020 - Call for Nominations.

Susanne Albers, Nikhil Bansal, Elvira Mayordomo, Dale Miller, Jaroslav Nesetril, Damian Niwinski, David Peleg, Vladimiro Sassone, Alexandra Silva

Bull. EATCS, 2020

Computing Measures of Weak-MSO Definable Sets of Trees.

Damian Niwinski, Marcin Przybylko, Michal Skrzypczak

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019

Preface.

Mieczyslaw Kula, Damian Niwinski, Jacek Pomykala

Fundam. Informaticae, 2019

EATCS Distinguished Dissertation Award 2019 - Call for Nominations.

David Peleg, Susanne Albers, Elvira Mayordomo, Dale Miller, Jaroslav Nesetril, Damian Niwinski, Vladimiro Sassone

Bull. EATCS, 2019

2017

Preface.

Damian Niwinski, Ewa Orlowska

Fundam. Informaticae, 2017

2016

Contribution of Warsaw Logicians to Computational Logic.

Damian Niwinski

Axioms, 2016

2014

On the Separation Question for Tree Languages.

André Arnold, Henryk Michalewski, Damian Niwinski

Theory Comput. Syst., 2014

A simple indeterminate infinite game.

Eryk Kopczynski, Damian Niwinski

Proceedings of the Logic, Computation, Hierarchies, 2014

2013

The Ackermann Award 2013.

Anuj Dawar, Thomas A. Henzinger, Damian Niwinski

Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

2012

Preface.

Jerzy Jaworski, Mieczyslaw Kula, Damian Niwinski, Jerzy Urbanowicz

Fundam. Informaticae, 2012

Alan Turing and Systems Biology.

Anna Gambin, Anna K. Marciniak-Czochra, Damian Niwinski

ERCIM News, 2012

The Ackermann Award 2012.

Thierry Coquand, Anuj Dawar, Damian Niwinski

Proceedings of the Computer Science Logic (CSL'12), 2012

On Topological Completeness of Regular Tree Languages.

Henryk Michalewski, Damian Niwinski

Proceedings of the Logic and Program Semantics, 2012

2010

Two-way deterministic automata with two reversals are exponentially more succinct than with one reversal.

Marcin Balcerzak, Damian Niwinski

Inf. Process. Lett., 2010

Preface.

Anna Gambin, Damian Niwinski, Pawel Urzyczyn

Fundam. Informaticae, 2010

On the Borel Complexity of MSO Definable Sets of Branches.

Mikolaj Bojanczyk, Damian Niwinski, Alexander Rabinovich, Adam Radziwonczyk-Syta, Michal Skrzypczak

Fundam. Informaticae, 2010

The Ackermann Award 2010.

Johann A. Makowsky, Damian Niwinski

Proceedings of the Computer Science Logic, 24th International Workshop, 2010

2009

On the Borel Inseparability of Game Tree Languages.

Szczepan Hummel, Henryk Michalewski, Damian Niwinski

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

2008

The Ackermann Award 2008.

Johann A. Makowsky, Damian Niwinski

Proceedings of the Computer Science Logic, 22nd International Workshop, 2008

On the topological complexity of tree languages.

André Arnold, Jacques Duparc, Filip Murlak, Damian Niwinski

Proceedings of the Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., 2008

2007

Continuous Separation of Game Languages.

André Arnold, Damian Niwinski

Fundam. Informaticae, 2007

The Ackermann Award 2007.

Martin Grohe, Martin Hyland, Johann A. Makowsky, Damian Niwinski

Proceedings of the Computer Science Logic, 21st International Workshop, 2007

2006

On the positional determinacy of edge-labeled games.

Thomas Colcombet, Damian Niwinski

Theor. Comput. Sci., 2006

2005

Unsafe Grammars and Panic Automata.

Teodor Knapik, Damian Niwinski, Pawel Urzyczyn, Igor Walukiewicz

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004

Deciding Nondeterministic Hierarchy of Deterministic Tree Automata.

Damian Niwinski, Igor Walukiewicz

Proceedings of the 11th Workshop on Logic, Language, Information and Computation, 2004

Editorial.

Zofia Adamowicz, Sergei N. Artëmov, Damian Niwinski, Ewa Orlowska, Anna B. Romanowska, Jan Wolenski

Ann. Pure Appl. Log., 2004

2003

A gap property of deterministic tree languages.

Damian Niwinski, Igor Walukiewicz

Theor. Comput. Sci., 2003

Hierarchies in mu-Calculus (Invited Talk).

Damian Niwinski

Proceedings of the FICS '03, 2003

2002

Higher-Order Pushdown Trees Are Easy.

Teodor Knapik, Damian Niwinski, Pawel Urzyczyn

Proceedings of the Foundations of Software Science and Computation Structures, 2002

µ-Calculus via Games.

Damian Niwinski

Proceedings of the Computer Science Logic, 16th International Workshop, 2002

2001

Deciding Monadic Theories of Hyperalgebraic Trees.

Teodor Knapik, Damian Niwinski, Pawel Urzyczyn

Proceedings of the Typed Lambda Calculi and Applications, 5th International Conference, 2001

1999

On distributive fixed-point expressions.

Helmut Seidl, Damian Niwinski

RAIRO Theor. Informatics Appl., 1999

1998

Relating Hierarchies of Word and Tree Automata.

Damian Niwinski, Igor Walukiewicz

Proceedings of the STACS 98, 1998

The Horn Mu-calculus.

Witold Charatonik, David A. McAllester, Damian Niwinski, Andreas Podelski, Igor Walukiewicz

Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

1997

Fixed Point Characterization of Infinite Behavior of Finite-State Systems.

Damian Niwinski

Theor. Comput. Sci., 1997

y = 2x vs. y = 3x.

Alexei P. Stolboushkin, Damian Niwinski

J. Symb. Log., 1997

1996

Games for the mu-Calculus.

Damian Niwinski, Igor Walukiewicz

Theor. Comput. Sci., 1996

First-Order Queries over Temporal Databases Inexpressible in Temporal Logic.

David Toman, Damian Niwinski

Proceedings of the Advances in Database Technology, 1996

1995

Automata on Infinite Trees with Counting Constraints

Danièle Beauquier, Damian Niwinski

Inf. Comput., July, 1995

On the Feasibility of Checking Temporal Integrity Constraints.

Jan Chomicki, Damian Niwinski

J. Comput. Syst. Sci., 1995

1993

The Effect of the Number of Successful Paths in a BüChi Tree Automaton.

Danièle Beauquier, Maurice Nivat, Damian Niwinski

Int. J. Algebra Comput., 1993

1992

Fixed point characterization of weak monadic logic definable sets of trees.

André Arnold, Damian Niwinski

Proceedings of the Tree Automata and Languages., 1992

1991

A Geometrical View of the Determinization and Minimization of Finite-State Automata.

Bruno Courcelle, Damian Niwinski, Andreas Podelski

Math. Syst. Theory, 1991

Cellular automata on tress, a model for parallel computation.

Jan Mycielski, Damian Niwinski

Fundam. Informaticae, 1991

On the Cardinality of Sets of Infinite Trees Recognizable by Finite Automata.

Damian Niwinski

Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

About the Effect of the Number of Successful Paths in an Infinite Tree on the Recognizability by a Finite Automaton with Büchi Conditions.

Danièle Beauquier, Maurice Nivat, Damian Niwinski

Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

1990

Fixed Point Characterization of Büchi Automata on Infinite Trees.

André Arnold, Damian Niwinski

J. Inf. Process. Cybern., 1990

1988

Fixed Points vs. Infinite Generation

Damian Niwinski

Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988

1986

On Fixed-Point Clones (Extended Abstract).

Damian Niwinski

Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986

1984

Fixed-Point Characterization of Context-Free \infty-Languages

Damian Niwinski

Inf. Control., June, 1984

1982

Fixed-Point Semantics for Algebraic (Tree) Grammars (Extended Abstract).

Damian Niwinski

Proceedings of the Automata, 1982