Playing infinite games in finite time
A half-century of automata theory
Monadic second-order logic on tree-like structures
Theoretical Computer Science
A linear time special case for MC Games
Fundamenta Informaticae
Small Progress Measures for Solving Parity Games
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Timed Control Synthesis for External Specifications
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Invited Talk: Decision procedures for guarded logics
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Note on winning positions on pushdown games with ω-regular conditions
Information Processing Letters
The finite graph problem for two-way alternating automata
Theoretical Computer Science - Foundations of software science and computation structures
Automata logics, and infinite games
Memoryless determinacy of parity and mean payoff games: a simple proof
Theoretical Computer Science
Quantitative stochastic parity games
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A deterministic subexponential algorithm for solving parity games
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Games with winning conditions of high Borel complexity
Theoretical Computer Science - Automata, languages and programming: Logic and semantics (ICALP-B 2004)
On the positional determinacy of edge-labeled games
Theoretical Computer Science
Information Processing Letters
The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Positional Strategies for Higher-Order Pushdown Parity Games
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Strategy Construction for Parity Games with Imperfect Information
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
The Descriptive Complexity of Parity Games
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Polynomial-Time Under-Approximation of Winning Regions in Parity Games
Electronic Notes in Theoretical Computer Science (ENTCS)
Solving μ-Calculus Parity Games by Symbolic Planning
Model Checking and Artificial Intelligence
Alpaga: A Tool for Solving Parity Games with Imperfect Information
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Branching-Time Logics Repeatedly Referring to States
Journal of Logic, Language and Information
Solving Parity Games in Practice
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
New Algorithms for Solving Simple Stochastic Games
Electronic Notes in Theoretical Computer Science (ENTCS)
Modal and mixed specifications: Key decision problems and their complexities
Mathematical Structures in Computer Science
Information flow in concurrent games
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Optimal strategy synthesis in stochastic Müller games
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Bounded-variable fragments of hybrid logics
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Faster algorithms for finitary games
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Local abstraction-refinement for the mu-calculus
Proceedings of the 14th international SPIN conference on Model checking software
Memory reduction for strategies in infinite games
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Stochastic Müller games are PSPACE-complete
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Solving parity games in big steps
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Optimizing winning strategies in regular infinite games
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
On reachability games of ordinal length
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
A hybrid algorithm for LTL games
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
The complexity of Nash equilibria in infinite multiplayer games
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Stochastic games with lossy channels
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
The complexity of CTL* + linear past
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
A Solver for Modal Fixpoint Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
On the complexity of branching-time logics
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Strategy construction for parity games with imperfect information
Information and Computation
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Exploring the boundary of half positionality
CLIMA'10 Proceedings of the 11th international conference on Computational logic in multi-agent systems
Robust discrete synthesis against unspecified disturbances
Proceedings of the 14th international conference on Hybrid systems: computation and control
Stuttering mostly speeds up solving parity games
NFM'11 Proceedings of the Third international conference on NASA Formal methods
Logic and games on automatic structures: playing with quantifiers and decompositions
Logic and games on automatic structures: playing with quantifiers and decompositions
Parity games on graphs with medium tree-width
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Minimum attention controller synthesis for omega-regular objectives
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Measuring permissiveness in parity games: mean-payoff parity games revisited
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Structural Analysis of Boolean Equation Systems
ACM Transactions on Computational Logic (TOCL)
Quantitatively fair scheduling
Theoretical Computer Science
Exploring the boundary of half-positionality
Annals of Mathematics and Artificial Intelligence
Rational behaviour and strategy construction in infinite multiplayer games
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
An O(n2) time algorithm for alternating Büchi games
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Parity games played on transition graphs of one-counter processes
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
A survey of stochastic ω-regular games
Journal of Computer and System Sciences
Proving ATL* properties of infinite-state systems
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
A subexponential lower bound for the random facet algorithm for parity games
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The complexity of stochastic Müller games
Information and Computation
Complexity bounds for regular games
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Robustness in the presence of liveness
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Fair adversaries and randomization in two-player games
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Games and markov decision processes with mean-payoff parity and energy parity objectives
MEMICS'11 Proceedings of the 7th international conference on Mathematical and Engineering Methods in Computer Science
On the complexity of parity games
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Strategy machines and their complexity
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
A Linear Time Special Case for MC Games
Fundamenta Informaticae
Theoretical Computer Science
Omega-regular half-positional winning conditions
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Entanglement and the complexity of directed graphs
Theoretical Computer Science
A cure for stuttering parity games
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
Strategy synthesis for multi-dimensional quantitative objectives
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Tight bounds for the determinisation and complementation of generalised Büchi automata
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Concurrent small progress measures
HVC'11 Proceedings of the 7th international Haifa Verification conference on Hardware and Software: verification and testing
The rabin index of parity games
HVC'11 Proceedings of the 7th international Haifa Verification conference on Hardware and Software: verification and testing
Fatal attractors in parity games
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
An overview of the mCRL2 toolset and its recent advances
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Deciding monotone duality and identifying frequent itemsets in quadratic logspace
Proceedings of the 32nd symposium on Principles of database systems
A superpolynomial lower bound for strategy iteration based on snare memorization
Discrete Applied Mathematics
Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems
Information and Computation
Strategy composition in compositional games
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
GOAL for games, omega-automata, and logics
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Solving parity games on integer vectors
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Proof graphs for parameterised boolean equation systems
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Stochastic parity games on lossy channel systems
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
A constraint-based approach to solving games on infinite graphs
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
A theory of robust omega-regular software synthesis
ACM Transactions on Embedded Computing Systems (TECS)
Alternating traps in Muller and parity games
Theoretical Computer Science
| Hi-index | 5.23 |