default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDamian Niwinski
Person information
- affiliation: University of Warsaw, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i3]Damian Niwinski, Marcin Przybylko, Michal Skrzypczak:
Computing measures of weak-MSO definable sets of trees. CoRR abs/2410.13479 (2024)- 2023
- [c30]Damian Niwinski, Pawel Parys
, Michal Skrzypczak:
The Probabilistic Rabin Tree Theorem*. LICS 2023: 1-13 - [i2]Damian Niwinski, Pawel Parys, Michal Skrzypczak:
The Probabilistic Rabin Tree Theorem. CoRR abs/2304.12158 (2023) - 2022
- [j26]Stanislaw Kasjan, Damian Niwinski:
Daniel Simson Obituary. Fundam. Informaticae 187(1) (2022) - 2021
- [c29]André Arnold, Damian Niwinski, Pawel Parys:
A Quasi-Polynomial Black-Box Algorithm for Fixed Point Evaluation. CSL 2021: 9:1-9:23 - [c28]Damian Niwinski, Michal Skrzypczak:
On Guidable Index of Tree Automata. MFCS 2021: 81:1-81:14 - 2020
- [j25]Susanne Albers, Nikhil Bansal, Elvira Mayordomo, Dale Miller, Jaroslav Nesetril, Damian Niwinski, David Peleg, Vladimiro Sassone, Alexandra Silva:
EATCS Distinguished Dissertation Award 2020 - Call for Nominations. Bull. EATCS 132 (2020) - [c27]Damian Niwinski, Marcin Przybylko, Michal Skrzypczak:
Computing Measures of Weak-MSO Definable Sets of Trees. ICALP 2020: 136:1-136:18
2010 – 2019
- 2019
- [j24]David Peleg, Susanne Albers, Elvira Mayordomo, Dale Miller, Jaroslav Nesetril, Damian Niwinski, Vladimiro Sassone:
EATCS Distinguished Dissertation Award 2019 - Call for Nominations. Bull. EATCS 129 (2019) - [j23]Mieczyslaw Kula, Damian Niwinski, Jacek Pomykala:
Preface. Fundam. Informaticae 169(4): i (2019) - 2017
- [j22]Damian Niwinski, Ewa Orlowska:
Preface. Fundam. Informaticae 156(3-4) (2017) - 2016
- [j21]Damian Niwinski:
Contribution of Warsaw Logicians to Computational Logic. Axioms 5(2): 16 (2016) - 2014
- [j20]André Arnold, Henryk Michalewski, Damian Niwinski:
On the Separation Question for Tree Languages. Theory Comput. Syst. 55(4): 833-855 (2014) - [p2]Eryk Kopczynski, Damian Niwinski:
A simple indeterminate infinite game. Logic, Computation, Hierarchies 2014: 205-212 - 2013
- [c26]Anuj Dawar, Thomas A. Henzinger, Damian Niwinski:
The Ackermann Award 2013. CSL 2013: 1-4 - 2012
- [j19]Jerzy Jaworski, Mieczyslaw Kula, Damian Niwinski, Jerzy Urbanowicz:
Preface. Fundam. Informaticae 114(3-4) (2012) - [c25]Henryk Michalewski, Damian Niwinski:
On Topological Completeness of Regular Tree Languages. Logic and Program Semantics 2012: 165-179 - [c24]Thierry Coquand, Anuj Dawar, Damian Niwinski:
The Ackermann Award 2012. CSL 2012: 1-5 - [c23]André Arnold, Henryk Michalewski, Damian Niwinski:
On the separation question for tree languages. STACS 2012: 396-407 - [i1]Anna Gambin, Anna K. Marciniak-Czochra, Damian Niwinski:
Alan Turing and Systems Biology. ERCIM News 2012(91) (2012) - 2010
- [j18]Mikolaj Bojanczyk, Damian Niwinski, Alexander Rabinovich, Adam Radziwonczyk-Syta, Michal Skrzypczak:
On the Borel Complexity of MSO Definable Sets of Branches. Fundam. Informaticae 98(4): 337-349 (2010) - [j17]Anna Gambin, Damian Niwinski, Pawel Urzyczyn:
Preface. Fundam. Informaticae 103(1-4) (2010) - [j16]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) - [c22]Johann A. Makowsky, Damian Niwinski:
The Ackermann Award 2010. CSL 2010: 544-546
2000 – 2009
- 2009
- [c21]Szczepan Hummel, Henryk Michalewski, Damian Niwinski:
On the Borel Inseparability of Game Tree Languages. STACS 2009: 565-575 - [e1]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. Lecture Notes in Computer Science 5734, Springer 2009, ISBN 978-3-642-03815-0 [contents] - 2008
- [c20]André Arnold, Jacques Duparc, Filip Murlak, Damian Niwinski:
On the topological complexity of tree languages. Logic and Automata 2008: 9-28 - [c19]Johann A. Makowsky, Damian Niwinski:
The Ackermann Award 2008. CSL 2008: 508-512 - 2007
- [j15]André Arnold, Damian Niwinski:
Continuous Separation of Game Languages. Fundam. Informaticae 81(1-3): 19-28 (2007) - [c18]Martin Grohe, Martin Hyland, Johann A. Makowsky, Damian Niwinski:
The Ackermann Award 2007. CSL 2007: 589-597 - 2006
- [j14]Thomas Colcombet, Damian Niwinski:
On the positional determinacy of edge-labeled games. Theor. Comput. Sci. 352(1-3): 190-196 (2006) - 2005
- [c17]Teodor Knapik, Damian Niwinski, Pawel Urzyczyn, Igor Walukiewicz:
Unsafe Grammars and Panic Automata. ICALP 2005: 1450-1461 - 2004
- [j13]Zofia Adamowicz, Sergei N. Artëmov, Damian Niwinski, Ewa Orlowska, Anna B. Romanowska, Jan Wolenski:
Editorial. Ann. Pure Appl. Log. 126(1-3): 3-4 (2004) - [c16]Damian Niwinski, Igor Walukiewicz:
Deciding Nondeterministic Hierarchy of Deterministic Tree Automata. WoLLIC 2004: 195-208 - 2003
- [j12]Damian Niwinski, Igor Walukiewicz:
A gap property of deterministic tree languages. Theor. Comput. Sci. 303(1): 215-231 (2003) - [c15]Damian Niwinski:
Hierarchies in mu-Calculus (Invited Talk). FICS 2003: 80 - 2002
- [c14]Damian Niwinski:
µ-Calculus via Games. CSL 2002: 27-43 - [c13]Teodor Knapik, Damian Niwinski, Pawel Urzyczyn:
Higher-Order Pushdown Trees Are Easy. FoSSaCS 2002: 205-222 - 2001
- [c12]Teodor Knapik, Damian Niwinski, Pawel Urzyczyn:
Deciding Monadic Theories of Hyperalgebraic Trees. TLCA 2001: 253-267
1990 – 1999
- 1999
- [j11]Helmut Seidl, Damian Niwinski:
On distributive fixed-point expressions. RAIRO Theor. Informatics Appl. 33(4/5): 427-446 (1999) - 1998
- [c11]Witold Charatonik, David A. McAllester, Damian Niwinski, Andreas Podelski, Igor Walukiewicz:
The Horn Mu-calculus. LICS 1998: 58-69 - [c10]Damian Niwinski, Igor Walukiewicz:
Relating Hierarchies of Word and Tree Automata. STACS 1998: 320-331 - 1997
- [j10]Alexei P. Stolboushkin, Damian Niwinski:
y = 2x vs. y = 3x. J. Symb. Log. 62(2): 661-672 (1997) - [j9]Damian Niwinski:
Fixed Point Characterization of Infinite Behavior of Finite-State Systems. Theor. Comput. Sci. 189(1-2): 1-69 (1997) - 1996
- [j8]Damian Niwinski, Igor Walukiewicz:
Games for the mu-Calculus. Theor. Comput. Sci. 163(1&2): 99-116 (1996) - [c9]David Toman, Damian Niwinski:
First-Order Queries over Temporal Databases Inexpressible in Temporal Logic. EDBT 1996: 307-324 - 1995
- [j7]Danièle Beauquier, Damian Niwinski:
Automata on Infinite Trees with Counting Constraints. Inf. Comput. 120(1): 117-125 (1995) - [j6]Jan Chomicki, Damian Niwinski:
On the Feasibility of Checking Temporal Integrity Constraints. J. Comput. Syst. Sci. 51(3): 523-535 (1995) - 1993
- [j5]Danièle Beauquier, Maurice Nivat, Damian Niwinski:
The Effect of the Number of Successful Paths in a BüChi Tree Automaton. Int. J. Algebra Comput. 3(2): 237-250 (1993) - [c8]Damian Niwinski, Alexei P. Stolboushkin:
y = 2x vs. y = 3x. LICS 1993: 172-178 - [c7]Jan Chomicki, Damian Niwinski:
On the Feasibility of Checking Temporal Integrity Constraints. PODS 1993: 202-213 - [c6]Danièle Beauquier, Damian Niwinski:
Automata on Infinite Trees with Counting Constraints. TAPSOFT 1993: 266-281 - 1992
- [p1]André Arnold, Damian Niwinski:
Fixed point characterization of weak monadic logic definable sets of trees. Tree Automata and Languages 1992: 159-188 - 1991
- [j4]Jan Mycielski, Damian Niwinski:
Cellular automata on tress, a model for parallel computation. Fundam. Informaticae 15(2): 139-144 (1991) - [j3]Bruno Courcelle, Damian Niwinski, Andreas Podelski:
A Geometrical View of the Determinization and Minimization of Finite-State Automata. Math. Syst. Theory 24(2): 117-146 (1991) - [c5]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 - [c4]Damian Niwinski:
On the Cardinality of Sets of Infinite Trees Recognizable by Finite Automata. MFCS 1991: 367-376 - 1990
- [j2]André Arnold, Damian Niwinski:
Fixed Point Characterization of Büchi Automata on Infinite Trees. J. Inf. Process. Cybern. 26(8/9): 451-459 (1990)
1980 – 1989
- 1988
- [c3]Damian Niwinski:
Fixed Points vs. Infinite Generation. LICS 1988: 402-409 - 1986
- [c2]Damian Niwinski:
On Fixed-Point Clones (Extended Abstract). ICALP 1986: 464-473 - 1984
- [j1]Damian Niwinski:
Fixed-Point Characterization of Context-Free \infty-Languages. Inf. Control. 61(3): 247-276 (1984) - 1982
- [c1]Damian Niwinski:
Fixed-Point Semantics for Algebraic (Tree) Grammars (Extended Abstract). ICALP 1982: 384-396
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-25 22:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
