Search the dblp DataBase
Igor Walukiewicz :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Igor Walukiewicz Automata and Games for Synthesis. [Citation Graph (0, 0)][DBLP ] AMAST, 2002, pp:15-20 [Conf ] Igor Walukiewicz Pushdown Processes: Games and Model Checking. [Citation Graph (0, 0)][DBLP ] CAV, 1996, pp:62-74 [Conf ] Mikolaj Bojanczyk , Igor Walukiewicz Characterizing EF and EX Tree Logics. [Citation Graph (0, 0)][DBLP ] CONCUR, 2004, pp:131-145 [Conf ] David Janin , Igor Walukiewicz On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic. [Citation Graph (0, 0)][DBLP ] CONCUR, 1996, pp:263-277 [Conf ] Igor Walukiewicz Winning Strategies and Synthesis of Controllers (Tutorial). [Citation Graph (0, 0)][DBLP ] CSL, 2003, pp:574- [Conf ] Anca Muscholl , Igor Walukiewicz An NP-Complete Fragment of LTL. [Citation Graph (0, 0)][DBLP ] Developments in Language Theory, 2004, pp:334-344 [Conf ] Slawomir Lasota , Igor Walukiewicz Alternating Timed Automata. [Citation Graph (0, 0)][DBLP ] FoSSaCS, 2005, pp:250-265 [Conf ] Andrzej S. Murawski , Igor Walukiewicz Third-Order Idealized Algol with Iteration Is Decidable. [Citation Graph (0, 0)][DBLP ] FoSSaCS, 2005, pp:202-218 [Conf ] Alexis-Julien Bouquet , Olivier Serre , Igor Walukiewicz Pushdown Games with Unboundedness and Regular Conditions. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2003, pp:88-99 [Conf ] Swarup Mohalik , Igor Walukiewicz Distributed Games. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2003, pp:338-351 [Conf ] Igor Walukiewicz Model Checking CTL Properties of Pushdown Systems. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2000, pp:127-138 [Conf ] Igor Walukiewicz From Logic to Games. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:79-91 [Conf ] Teodor Knapik , Damian Niwinski , Pawel Urzyczyn , Igor Walukiewicz Unsafe Grammars and Panic Automata. [Citation Graph (0, 0)][DBLP ] ICALP, 2005, pp:1450-1461 [Conf ] Andrzej S. Murawski , C.-H. Luke Ong , Igor Walukiewicz Idealized Algol with Ground Recursion, and DPDA Equivalence. [Citation Graph (0, 0)][DBLP ] ICALP, 2005, pp:917-929 [Conf ] Igor Walukiewicz Difficult Configurations - On the Complexity of LTrL. [Citation Graph (0, 0)][DBLP ] ICALP, 1998, pp:140-151 [Conf ] Igor Walukiewicz Decision Procedure for Checking Validity of PAL Formulas. [Citation Graph (0, 0)][DBLP ] IMYCS, 1990, pp:288-298 [Conf ] 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 ] Stefan Dziembowski , Marcin Jurdzinski , Igor Walukiewicz How Much Memory is Needed to Win Infinite Games? [Citation Graph (0, 0)][DBLP ] LICS, 1997, pp:99-110 [Conf ] Erich Grädel , Igor Walukiewicz Guarded Fixed Point Logic. [Citation Graph (0, 0)][DBLP ] LICS, 1999, pp:45-54 [Conf ] P. S. Thiagarajan , Igor Walukiewicz An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces. [Citation Graph (0, 0)][DBLP ] LICS, 1997, pp:183-194 [Conf ] Igor Walukiewicz A Landscape with Games in the Backgroun. [Citation Graph (0, 0)][DBLP ] LICS, 2004, pp:356-366 [Conf ] Igor Walukiewicz On Completeness of the mu-calculus [Citation Graph (0, 0)][DBLP ] LICS, 1993, pp:136-146 [Conf ] Igor Walukiewicz Completeness of Kozen's Axiomatisation of the Propositional mu-Calculus [Citation Graph (0, 0)][DBLP ] LICS, 1995, pp:14-24 [Conf ] Igor Walukiewicz How to Fix It: Using Fixpoints in Different Contexts. [Citation Graph (0, 0)][DBLP ] LPAR, 2004, pp:184-193 [Conf ] David Janin , Igor Walukiewicz Automata for the Modal mu-Calculus and related Results. [Citation Graph (0, 0)][DBLP ] MFCS, 1995, pp:552-562 [Conf ] Igor Walukiewicz Gentzen Type Axiomatizations for PAL. [Citation Graph (0, 0)][DBLP ] MFCS, 1990, pp:499-507 [Conf ] Damian Niwinski , Igor Walukiewicz Relating Hierarchies of Word and Tree Automata. [Citation Graph (0, 0)][DBLP ] STACS, 1998, pp:320-331 [Conf ] Igor Walukiewicz Monadic Second Order Logic on Tree-Like Structures. [Citation Graph (0, 0)][DBLP ] STACS, 1996, pp:401-413 [Conf ] Bruno Courcelle , Igor Walukiewicz Monadic Second-Order Logic, Graph Coverings and Unfoldings of Transition Systems. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 1998, v:92, n:1, pp:35-62 [Journal ] Igor Walukiewicz A note on the completeness of Kozen's axiomatisation of the propositional mu-calculus. [Citation Graph (0, 0)][DBLP ] Bulletin of Symbolic Logic, 1996, v:2, n:3, pp:349-366 [Journal ] 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 ] Igor Walukiewicz Describing properties of concurrent systems (Logic for Traces) (invited talk). [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2002, v:68, n:2, pp:- [Journal ] Igor Walukiewicz Deciding low levels of tree-automata hierarchy. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2002, v:67, n:, pp:- [Journal ] Igor Walukiewicz Difficult Configurations-On the Complexity of LTrL . [Citation Graph (0, 0)][DBLP ] Formal Methods in System Design, 2005, v:26, n:1, pp:27-43 [Journal ] P. S. Thiagarajan , Igor Walukiewicz An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2002, v:179, n:2, pp:230-249 [Journal ] Igor Walukiewicz Completeness of Kozen's Axiomatisation of the Propositional µ-Calculus. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2000, v:157, n:1-2, pp:142-182 [Journal ] Igor Walukiewicz Pushdown Processes: Games and Model-Checking. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2001, v:164, n:2, pp:234-263 [Journal ] Anca Muscholl , Igor Walukiewicz An NP-complete fragment of LTL. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2005, v:16, n:4, pp:743-753 [Journal ] Jakub Neumann , Andrzej Szepietowski , Igor Walukiewicz Complexity of weak acceptance conditions in tree automata. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2002, v:84, n:4, pp:181-187 [Journal ] Julien Bernet , David Janin , Igor Walukiewicz Permissive strategies: from parity games to safety games. [Citation Graph (0, 0)][DBLP ] ITA, 2002, v:36, n:3, pp:261-275 [Journal ] Igor Walukiewicz Local Logics for Traces. [Citation Graph (0, 0)][DBLP ] Journal of Automata, Languages and Combinatorics, 2002, v:7, n:2, pp:259-290 [Journal ] Erich Grädel , Igor Walukiewicz Positional Determinacy of Games with Infinitely Many Priorities. [Citation Graph (0, 0)][DBLP ] Logical Methods in Computer Science, 2006, v:2, n:4, pp:- [Journal ] André Arnold , Aymeric Vincent , Igor Walukiewicz Games for synthesis of controllers with partial observation. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:1, n:303, pp:7-34 [Journal ] Mikolaj Bojanczyk , Igor Walukiewicz Characterizing EF and EX tree logics. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:358, n:2-3, pp:255-272 [Journal ] 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 ] 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 ] Igor Walukiewicz Monadic second-order logic on tree-like structures. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2002, v:275, n:1-2, pp:311-346 [Journal ] Igor Walukiewicz Gentzen-Type Axiomatization for PAL. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1993, v:118, n:1, pp:67-79 [Journal ] Anca Muscholl , Igor Walukiewicz A Lower Bound on Web Services Composition. [Citation Graph (0, 0)][DBLP ] FoSSaCS, 2007, pp:274-286 [Conf ] Patrick Chervet , Igor Walukiewicz Minimizing Variants of Visibly Pushdown Automata. [Citation Graph (0, 0)][DBLP ] MFCS, 2007, pp:135-146 [Conf ] Thierry Cachat , Igor Walukiewicz The Complexity of Games on Higher Order Pushdown Automata [Citation Graph (0, 0)][DBLP ] CoRR, 2007, v:0, n:, pp:- [Journal ] Erich Grädel , Igor Walukiewicz Postinal Determinacy of Games with Infinitely Many Priorities [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Erich Grädel , Igor Walukiewicz Positional Determinacy of Games with Infinitely Many Priorities [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Synthesis: Words and Traces. [Citation Graph (, )][DBLP ] Efficient Emptiness Check for Timed Büchi Automata. [Citation Graph (, )][DBLP ] Finding Your Way in a Forest: On Different Types of Trees and Their Properties. [Citation Graph (, )][DBLP ] Weak Alternating Timed Automata. [Citation Graph (, )][DBLP ] Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata. [Citation Graph (, )][DBLP ] Wreath Products of Forest Algebras, with Applications to Tree Logics. [Citation Graph (, )][DBLP ] Alternating Timed Automata [Citation Graph (, )][DBLP ] A lower bound on web services composition [Citation Graph (, )][DBLP ] Search in 0.004secs, Finished in 0.329secs