Damian Niwinski

According to our database1, Damian Niwinski
  • authored at least 49 papers between 1982 and 2016.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2016
Contribution of Warsaw Logicians to Computational Logic.
Axioms, 2016

2014
On the Separation Question for Tree Languages.
Theory Comput. Syst., 2014

A simple indeterminate infinite game.
Proceedings of the Logic, Computation, Hierarchies, 2014

2013
The Ackermann Award 2013.
Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

2012
Preface.
Fundam. Inform., 2012

Alan Turing and Systems Biology.
ERCIM News, 2012

On the separation question for tree languages.
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

The Ackermann Award 2012.
Proceedings of the Computer Science Logic (CSL'12), 2012

On Topological Completeness of Regular Tree Languages.
Proceedings of the Logic and Program Semantics, 2012

2010
Two-way deterministic automata with two reversals are exponentially more succinct than with one reversal.
Inf. Process. Lett., 2010

Preface.
Fundam. Inform., 2010

On the Borel Complexity of MSO Definable Sets of Branches.
Fundam. Inform., 2010

The Ackermann Award 2010.
Proceedings of the Computer Science Logic, 24th International Workshop, 2010

2009
On the Borel Inseparability of Game Tree Languages.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

2008
The Ackermann Award 2008.
Proceedings of the Computer Science Logic, 22nd International Workshop, 2008

On the topological complexity of tree languages.
Proceedings of the Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., 2008

2007
Continuous Separation of Game Languages.
Fundam. Inform., 2007

The Ackermann Award 2007.
Proceedings of the Computer Science Logic, 21st International Workshop, 2007

2006
On the positional determinacy of edge-labeled games.
Theor. Comput. Sci., 2006

2005
Deciding Nondeterministic Hierarchy of Deterministic Tree Automata.
Electr. Notes Theor. Comput. Sci., 2005

Unsafe Grammars and Panic Automata.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004
Editorial.
Ann. Pure Appl. Logic, 2004

2003
A gap property of deterministic tree languages.
Theor. Comput. Sci., 2003

2002
Higher-Order Pushdown Trees Are Easy.
Proceedings of the Foundations of Software Science and Computation Structures, 2002

µ-Calculus via Games.
Proceedings of the Computer Science Logic, 16th International Workshop, 2002

2001
Deciding Monadic Theories of Hyperalgebraic Trees.
TLCA, 2001

1999
On distributive fixed-point expressions.
ITA, 1999

1998
Relating Hierarchies of Word and Tree Automata.
Proceedings of the STACS 98, 1998

The Horn Mu-calculus.
Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

1997
Fixed Point Characterization of Infinite Behavior of Finite-State Systems.
Theor. Comput. Sci., 1997

y = 2x vs. y = 3x.
J. Symb. Log., 1997

1996
Games for the mu-Calculus.
Theor. Comput. Sci., 1996

First-Order Queries over Temporal Databases Inexpressible in Temporal Logic.
Proceedings of the Advances in Database Technology, 1996

1995
Automata on Infinite Trees with Counting Constraints
Inf. Comput., July, 1995

On the Feasibility of Checking Temporal Integrity Constraints.
J. Comput. Syst. Sci., 1995

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

Automata on Infinite Trees with Counting Constraints.
Proceedings of the TAPSOFT'93: Theory and Practice of Software Development, 1993

On the Feasibility of Checking Temporal Integrity Constraints.
Proceedings of the Twelfth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1993

y = 2x vs. y = 3x
Proceedings of the Eighth Annual Symposium on Logic in Computer Science (LICS '93), 1993

1992
Fixed point characterization of weak monadic logic definable sets of trees.
Tree Automata and Languages, 1992

1991
A Geometrical View of the Determinization and Minimization of Finite-State Automata.
Mathematical Systems Theory, 1991

Cellular automata on tress, a model for parallel computation.
Fundam. Inform., 1991

On the Cardinality of Sets of Infinite Trees Recognizable by Finite Automata.
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.
Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

1990
Fixed Point Characterization of Büchi Automata on Infinite Trees.
Elektronische Informationsverarbeitung und Kybernetik, 1990

1988
Fixed Points vs. Infinite Generation
Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988

1986
On Fixed-Point Clones (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986

1984
Fixed-Point Characterization of Context-Free \infty-Languages
Information and Control, June, 1984

1982
Fixed-Point Semantics for Algebraic (Tree) Grammars (Extended Abstract).
Proceedings of the Automata, 1982


  Loading...