The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Damian Niwinski: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. David Toman, Damian Niwinski
    First-Order Queries over Temporal Databases Inexpressible in Temporal Logic. [Citation Graph (3, 12)][DBLP]
    EDBT, 1996, pp:307-324 [Conf]
  2. Jan Chomicki, Damian Niwinski
    On the Feasibility of Checking Temporal Integrity Constraints. [Citation Graph (3, 12)][DBLP]
    PODS, 1993, pp:202-213 [Conf]
  3. Jan Chomicki, Damian Niwinski
    On the Feasibility of Checking Temporal Integrity Constraints. [Citation Graph (2, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:51, n:3, pp:523-535 [Journal]
  4. Damian Niwinski
    µ-Calculus via Games. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:27-43 [Conf]
  5. 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. [Citation Graph (0, 0)][DBLP]
    FCT, 1991, pp:136-145 [Conf]
  6. Teodor Knapik, Damian Niwinski, Pawel Urzyczyn
    Higher-Order Pushdown Trees Are Easy. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2002, pp:205-222 [Conf]
  7. Teodor Knapik, Damian Niwinski, Pawel Urzyczyn, Igor Walukiewicz
    Unsafe Grammars and Panic Automata. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:1450-1461 [Conf]
  8. Damian Niwinski
    Fixed-Point Semantics for Algebraic (Tree) Grammars (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:384-396 [Conf]
  9. Damian Niwinski
    On Fixed-Point Clones (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1986, pp:464-473 [Conf]
  10. Witold Charatonik, David A. McAllester, Damian Niwinski, Andreas Podelski, Igor Walukiewicz
    The Horn Mu-calculus. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:58-69 [Conf]
  11. Damian Niwinski
    Fixed Points vs. Infinite Generation [Citation Graph (0, 0)][DBLP]
    LICS, 1988, pp:402-409 [Conf]
  12. Damian Niwinski, Alexei P. Stolboushkin
    y = 2x vs. y = 3x [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:172-178 [Conf]
  13. Damian Niwinski
    On the Cardinality of Sets of Infinite Trees Recognizable by Finite Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:367-376 [Conf]
  14. Damian Niwinski, Igor Walukiewicz
    Relating Hierarchies of Word and Tree Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 1998, pp:320-331 [Conf]
  15. Danièle Beauquier, Damian Niwinski
    Automata on Infinite Trees with Counting Constraints. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:266-281 [Conf]
  16. Teodor Knapik, Damian Niwinski, Pawel Urzyczyn
    Deciding Monadic Theories of Hyperalgebraic Trees. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:253-267 [Conf]
  17. Zofia Adamowicz, Sergei N. Artëmov, Damian Niwinski, Ewa Orowska, Anna Romanowska, Jan Wolenski
    Editorial. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2004, v:126, n:1-3, pp:3-4 [Journal]
  18. André Arnold, Damian Niwinski
    Fixed Point Characterization of Büchi Automata on Infinite Trees. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1990, v:26, n:8/9, pp:451-459 [Journal]
  19. Damian Niwinski, Igor Walukiewicz
    Deciding Nondeterministic Hierarchy of Deterministic Tree Automata. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:123, n:, pp:195-208 [Journal]
  20. Danièle Beauquier, Damian Niwinski
    Automata on Infinite Trees with Counting Constraints [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:120, n:1, pp:117-125 [Journal]
  21. Damian Niwinski
    Fixed-Point Characterization of Context-Free \infty-Languages [Citation Graph (0, 0)][DBLP]
    Information and Control, 1984, v:61, n:3, pp:247-276 [Journal]
  22. Helmut Seidl, Damian Niwinski
    On distributive fixed-point expressions. [Citation Graph (0, 0)][DBLP]
    ITA, 1999, v:33, n:4/5, pp:427-446 [Journal]
  23. Alexei P. Stolboushkin, Damian Niwinski
    y = 2x vs. y = 3x. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1997, v:62, n:2, pp:661-672 [Journal]
  24. Bruno Courcelle, Damian Niwinski, Andreas Podelski
    A Geometrical View of the Determinization and Minimization of Finite-State Automata. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1991, v:24, n:2, pp:117-146 [Journal]
  25. Thomas Colcombet, Damian Niwinski
    On the positional determinacy of edge-labeled games. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:352, n:1-3, pp:190-196 [Journal]
  26. Damian Niwinski
    Fixed Point Characterization of Infinite Behavior of Finite-State Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:189, n:1-2, pp:1-69 [Journal]
  27. Damian Niwinski, Igor Walukiewicz
    Games for the mu-Calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:163, n:1&2, pp:99-116 [Journal]
  28. Damian Niwinski, Igor Walukiewicz
    A gap property of deterministic tree languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:303, pp:215-231 [Journal]
  29. Martin Grohe, Martin Hyland, Johann A. Makowsky, Damian Niwinski
    The Ackermann Award 2007. [Citation Graph (0, 0)][DBLP]
    CSL, 2007, pp:589-597 [Conf]

  30. The Ackermann Award 2008. [Citation Graph (, )][DBLP]


  31. The Ackermann Award 2010. [Citation Graph (, )][DBLP]


  32. On the Borel Inseparability of Game Tree Languages. [Citation Graph (, )][DBLP]


Search in 0.054secs, Finished in 0.055secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002