Travelled to:1 × Denmark
1 × Poland
1 × Portugal
2 × France
2 × USA
2 × United Kingdom
Collaborated with:∅ T.Knapik P.Urzyczyn J.Chomicki D.Beauquier I.Walukiewicz W.Charatonik D.A.McAllester A.Podelski
Talks about:tree (4) point (3) fix (3) constraint (2) calculus (2) automata (2) infinit (2) grammar (2) hyperalgebra (1) pushdown (1)
Person: Damian Niwinski
DBLP: Niwinski:Damian
Contributed to:
2005
2002
2002
2001
1998
1993198819861982
1993Wrote 10 papers:
- ICALP-2005-KnapikNUW #automaton
- Unsafe Grammars and Panic Automata (TK, DN, PU, IW), pp. 1450–1461.
- CSL-2002-Niwinski #calculus #game studies #μ-calculus
- μ-Calculus via Games (DN), pp. 27–43.
- FoSSaCS-2002-KnapikNU #automaton #higher-order
- Higher-Order Pushdown Trees Are Easy (TK, DN, PU), pp. 205–222.
- TLCA-2001-KnapikNU #algebra #monad
- Deciding Monadic Theories of Hyperalgebraic Trees (TK, DN, PU), pp. 253–267.
- LICS-1998-CharatonikMNPW #calculus #μ-calculus
- The Horn μ-calculus (WC, DAM, DN, AP, IW), pp. 58–69.
- PODS-1993-ChomickiN #constraints #on the
- On the Feasibility of Checking Temporal Integrity Constraints (JC, DN), pp. 202–213.
- LICS-1988-Niwinski #fixpoint #generative #infinity
- Fixed Points vs. Infinite Generation (DN), pp. 402–409.
- ICALP-1986-Niwinski #fixpoint #on the
- On Fixed-Point Clones (DN), pp. 464–473.
- ICALP-1982-Niwinski #algebra #fixpoint #semantics
- Fixed-Point Semantics for Algebraic (Tree) Grammars (DN), pp. 384–396.
- TAPSOFT-1993-BeauquirerN #automaton #constraints #infinity
- Automata on Infinite Trees with Counting Constraints (DB, DN), pp. 266–281.