Damian Niwinski

	2012
43		Henryk Michalewski, Damian Niwinski: On Topological Completeness of Regular Tree Languages. Logic and Program Semantics 2012: 165-179
42		André Arnold, Henryk Michalewski, Damian Niwinski: On the separation question for tree languages. STACS 2012: 396-407
41		Jerzy Jaworski, Mieczyslaw Kula, Damian Niwinski, Jerzy Urbanowicz: Preface. Fundam. Inform. 114(3-4): (2012)
	2010
40		Johann A. Makowsky, Damian Niwinski: The Ackermann Award 2010. CSL 2010: 544-546
39		Anna Gambin, Damian Niwinski, Pawel Urzyczyn: Preface. Fundam. Inform. 103(1-4): (2010)
38		Mikolaj Bojanczyk, Damian Niwinski, Alexander Rabinovich, Adam Radziwonczyk-Syta, Michal Skrzypczak: On the Borel Complexity of MSO Definable Sets of Branches. Fundam. Inform. 98(4): 337-349 (2010)
37		Marcin Balcerzak, Damian Niwinski: Two-way deterministic automata with two reversals are exponentially more succinct than with one reversal. Inf. Process. Lett. 110(10): 396-398 (2010)
	2009
36		Rastislav Královic, Damian Niwinski: Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings Springer 2009
35		Szczepan Hummel, Henryk Michalewski, Damian Niwinski: On the Borel Inseparability of Game Tree Languages. STACS 2009: 565-575
	2008
34		Johann A. Makowsky, Damian Niwinski: The Ackermann Award 2008. CSL 2008: 508-512
33		André Arnold, Jacques Duparc, Filip Murlak, Damian Niwinski: On the topological complexity of tree languages. Logic and Automata 2008: 9-28
	2007
32		Martin Grohe, Martin Hyland, Johann A. Makowsky, Damian Niwinski: The Ackermann Award 2007. CSL 2007: 589-597
31		André Arnold, Damian Niwinski: Continuous Separation of Game Languages. Fundam. Inform. 81(1-3): 19-28 (2007)
	2006
30		Thomas Colcombet, Damian Niwinski: On the positional determinacy of edge-labeled games. Theor. Comput. Sci. 352(1-3): 190-196 (2006)
	2005
29		Teodor Knapik, Damian Niwinski, Pawel Urzyczyn, Igor Walukiewicz: Unsafe Grammars and Panic Automata. ICALP 2005: 1450-1461
28		Damian Niwinski, Igor Walukiewicz: Deciding Nondeterministic Hierarchy of Deterministic Tree Automata. Electr. Notes Theor. Comput. Sci. 123: 195-208 (2005)
	2004
27		Zofia Adamowicz, Sergei N. Artëmov, Damian Niwinski, Ewa Orlowska, Anna B. Romanowska, Jan Wolenski: Editorial. Ann. Pure Appl. Logic 126(1-3): 3-4 (2004)
	2003
26		Damian Niwinski, Igor Walukiewicz: A gap property of deterministic tree languages. Theor. Comput. Sci. 1(303): 215-231 (2003)
	2002
25		Damian Niwinski: µ-Calculus via Games. CSL 2002: 27-43
24		Teodor Knapik, Damian Niwinski, Pawel Urzyczyn: Higher-Order Pushdown Trees Are Easy. FoSSaCS 2002: 205-222
	2001
23		Teodor Knapik, Damian Niwinski, Pawel Urzyczyn: Deciding Monadic Theories of Hyperalgebraic Trees. TLCA 2001: 253-267
	1999
22		Helmut Seidl, Damian Niwinski: On distributive fixed-point expressions. ITA 33(4/5): 427-446 (1999)
	1998
21		Witold Charatonik, David A. McAllester, Damian Niwinski, Andreas Podelski, Igor Walukiewicz: The Horn Mu-calculus. LICS 1998: 58-69
20		Damian Niwinski, Igor Walukiewicz: Relating Hierarchies of Word and Tree Automata. STACS 1998: 320-331
	1997
19		Alexei P. Stolboushkin, Damian Niwinski: y = 2x vs. y = 3x. J. Symb. Log. 62(2): 661-672 (1997)
18		Damian Niwinski: Fixed Point Characterization of Infinite Behavior of Finite-State Systems. Theor. Comput. Sci. 189(1-2): 1-69 (1997)
	1996
17		David Toman, Damian Niwinski: First-Order Queries over Temporal Databases Inexpressible in Temporal Logic. EDBT 1996: 307-324
16		Damian Niwinski, Igor Walukiewicz: Games for the mu-Calculus. Theor. Comput. Sci. 163(1&2): 99-116 (1996)
	1995
15		Danièle Beauquier, Damian Niwinski: Automata on Infinite Trees with Counting Constraints Inf. Comput. 120(1): 117-125 (1995)
14		Jan Chomicki, Damian Niwinski: On the Feasibility of Checking Temporal Integrity Constraints. J. Comput. Syst. Sci. 51(3): 523-535 (1995)
	1993
13		Damian Niwinski, Alexei P. Stolboushkin: y = 2x vs. y = 3x LICS 1993: 172-178
12		Jan Chomicki, Damian Niwinski: On the Feasibility of Checking Temporal Integrity Constraints. PODS 1993: 202-213
11		Danièle Beauquier, Damian Niwinski: Automata on Infinite Trees with Counting Constraints. TAPSOFT 1993: 266-281
	1992
10		André Arnold, Damian Niwinski: Fixed point characterization of weak monadic logic definable sets of trees. Tree Automata and Languages 1992: 159-188
	1991
9		Danièle Beauquier, Maurice Nivat, Damian Niwinski: 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 1991: 136-145
8		Damian Niwinski: On the Cardinality of Sets of Infinite Trees Recognizable by Finite Automata. MFCS 1991: 367-376
7		Jan Mycielski, Damian Niwinski: Cellular automata on tress, a model for parallel computation. Fundam. Inform. 15(2): 139-144 (1991)
6		Bruno Courcelle, Damian Niwinski, Andreas Podelski: A Geometrical View of the Determinization and Minimization of Finite-State Automata. Mathematical Systems Theory 24(2): 117-146 (1991)
	1990
5		André Arnold, Damian Niwinski: Fixed Point Characterization of Büchi Automata on Infinite Trees. Elektronische Informationsverarbeitung und Kybernetik 26(8/9): 451-459 (1990)
	1988
4		Damian Niwinski: Fixed Points vs. Infinite Generation LICS 1988: 402-409
	1986
3		Damian Niwinski: On Fixed-Point Clones (Extended Abstract). ICALP 1986: 464-473
	1984
2		Damian Niwinski: Fixed-Point Characterization of Context-Free \infty-Languages Information and Control 61(3): 247-276 (1984)
	1982
1		Damian Niwinski: Fixed-Point Semantics for Algebraic (Tree) Grammars (Extended Abstract). ICALP 1982: 384-396

Coauthor Index

1	Zofia Adamowicz	[27]
2	André Arnold	[5] [10] [31] [33] [42]
3	Sergei N. Artëmov	[27]
4	Marcin Balcerzak	[37]
5	Danièle Beauquier	[9] [11] [15]
6	Mikolaj Bojanczyk	[38]
7	Witold Charatonik	[21]
8	Jan Chomicki	[12] [14]
9	Thomas Colcombet	[30]
10	Bruno Courcelle	[6]
11	Jacques Duparc	[33]
12	Anna Gambin	[39]
13	Martin Grohe	[32]
14	Szczepan Hummel	[35]
15	Martin Hyland (J. M. E. Hyland)	[32]
16	Jerzy Jaworski	[41]
17	Teodor Knapik	[23] [24] [29]
18	Rastislav Kralovic (Rastislav Královic)	[36]
19	Mieczyslaw Kula	[41]
20	Johann A. Makowsky (Janos Makowsky)	[32] [34] [40]
21	David A. McAllester	[21]
22	Henryk Michalewski	[35] [42] [43]
23	Filip Murlak	[33]
24	Jan Mycielski	[7]
25	Maurice Nivat	[9]
26	Ewa Orlowska	[27]
27	Andreas Podelski	[6] [21]
28	Alexander Moshe Rabinovich (Alexander Rabinovich)	[38]
29	Adam Radziwonczyk-Syta	[38]
30	Anna B. Romanowska	[27]
31	Helmut Seidl	[22]
32	Michal Skrzypczak	[38]
33	Alexei P. Stolboushkin	[13] [19]
34	David Toman	[17]
35	Jerzy Urbanowicz	[41]
36	Pawel Urzyczyn	[23] [24] [29] [39]
37	Igor Walukiewicz	[16] [20] [21] [26] [28] [29]
38	Jan Wolenski	[27]

Colors in the list of coauthors

Last update Fri May 25 01:42:58 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page