( en | de | ru )

 

Disambiguation of "Niwinski, Damian"

Author of the publication

copydeleteadd this publication to your clipboard
On the separation question for tree languages.

, , and . STACS, volume 14 of LIPIcs, page 396-407. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Damian Blumenröder

Damián Cornejo

Hans Damian

Damian Doderer

Damian Flisak

 

Other publications of authors with the same name

On Fixed-Point Clones (Extended Abstract).. ICALP, volume 226 of Lecture Notes in Computer Science, page 464-473. Springer, (1986)On the Separation Question for Tree Languages., , and . Theory Comput. Syst., 55 (4): 833-855 (2014)Hierarchies in mu-Calculus (Invited Talk).. FICS, page 80. University of Warsaw, (2003)On the Borel Complexity of MSO Definable Sets of Branches., , , , and . Fundam. Informaticae, 98 (4): 337-349 (2010)Automata on Infinite Trees with Counting Constraints., and . TAPSOFT, volume 668 of Lecture Notes in Computer Science, page 266-281. Springer, (1993)EATCS Distinguished Dissertation Award 2019 - Call for Nominations., , , , , , and . Bull. EATCS, (2019)The Horn Mu-calculus., , , , and . LICS, page 58-69. IEEE Computer Society, (1998)The Ackermann Award 2013., , and . CSL, volume 23 of LIPIcs, page 1-4. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)A Quasi-Polynomial Black-Box Algorithm for Fixed Point Evaluation., , and . CSL, volume 183 of LIPIcs, page 9:1-9:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)EATCS Distinguished Dissertation Award 2020 - Call for Nominations., , , , , , , , and . Bull. EATCS, (2020)