| Rudiments of calculus A Arnold, D Niwinski Elsevier, 2001 | 395 | 2001 |
| Higher-order pushdown trees are easy T Knapik, D Niwiński, P Urzyczyn Foundations of Software Science and Computation Structures: 5th …, 2002 | 231 | 2002 |
| On fixed-point clones D Niwiński Automata, Languages and Programming: 13th International Colloquium Rennes …, 1986 | 170 | 1986 |
| Games for the μ-calculus D Niwiński, I Walukiewicz Theoretical Computer Science 163 (1-2), 99-116, 1996 | 126 | 1996 |
| Fixed points vs. infinite generation D Niwinski Proceedings Third Annual Symposium on Logic in Computer Science, 402,403,404 …, 1988 | 109 | 1988 |
| Fixed point characterization of infinite behavior of finite-state systems D Niwiński Theoretical Computer Science 189 (1-2), 1-69, 1997 | 98 | 1997 |
| On the feasibility of checking temporal integrity constraints J Chomicki, D Niwiński Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles …, 1993 | 83 | 1993 |
| Unsafe grammars and panic automata T Knapik, D Niwiński, P Urzyczyn, I Walukiewicz Automata, Languages and Programming: 32nd International Colloquium, ICALP …, 2005 | 74 | 2005 |
| Fixed point characterization of weak monadic logic definable sets of trees A Arnold, D Niwinski Tree automata and Languages 10, 159-188, 1992 | 74 | 1992 |
| Relating hierarchies of word and tree automata D Niwiński, I Walukiewicz STACS 98: 15th Annual Symposium on Theoretical Aspects of Computer Science …, 1998 | 66 | 1998 |
| A gap property of deterministic tree languages D Niwiński, I Walukiewicz Theoretical Computer Science 303 (1), 215-231, 2003 | 64 | 2003 |
| Deciding monadic theories of hyperalgebraic trees T Knapik, D Niwinski, P Urzyczyn TLCA 1, 253-267, 2001 | 61 | 2001 |
| First-order queries over temporal databases inexpressible in temporal logic D Toman, D Niwiński Advances in Database Technology—EDBT'96: 5th International Conference on …, 1996 | 49 | 1996 |
| Deciding nondeterministic hierarchy of deterministic tree automata D Niwiński, I Walukiewicz Electronic Notes in Theoretical Computer Science 123, 195-208, 2005 | 44 | 2005 |
| Choice functions and well-orderings over the infinite binary tree A Carayol, C Löding, D Niwinski, I Walukiewicz Open Mathematics 8 (4), 662-682, 2010 | 40 | 2010 |
| Fixed point characterization of Buchi automata on infinite trees A Arnold, D Niwinski Journal of Information Processing and Cybernetics 26 (8-9), 451-459, 1991 | 39 | 1991 |
| Equational μ-calculus D Niwiński Computation theory (Zaborów, 1984), 169-176, 1985 | 33* | 1985 |
| Continuous separation of game languages A Arnold, D Niwiński Fundamenta Informaticae 81 (1-3), 19-28, 2007 | 30 | 2007 |
| On the positional determinacy of edge-labeled games T Colcombet, D Niwiński Theoretical Computer Science 352 (1-3), 190-196, 2006 | 29 | 2006 |
| On the cardinality of sets of infinite trees recognizable by finite automata D Niwiński Mathematical Foundations of Computer Science 1991: 16th International …, 1991 | 26 | 1991 |
Igor WalukiewiczCNRS, LaBRI, Bordeaux UniversityDirección de correo verificada de labri.fr
