A linear time special case for MC Games
Fundamenta Informaticae
Games and Model Checking for Guarded Logics
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Small Progress Measures for Solving Parity Games
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
On the Complexity of Parity Word Automata
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Infinite Games and Verification (Extended Abstract of a Tutorial)
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Inflationary Fixed Points in Modal Logic
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
A randomized subexponential algorithm for parity games
Nordic Journal of Computing
Automata logics, and infinite games
Inflationary fixed points in modal logic
ACM Transactions on Computational Logic (TOCL)
Quantitative stochastic parity games
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Combining supervisor synthesis and model checking
ACM Transactions on Embedded Computing Systems (TECS)
A deterministic subexponential algorithm for solving parity games
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The complexity of quantitative concurrent parity games
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Information Processing Letters
On the universal and existential fragments of the μ-calculus
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2003)
The NP-completeness column: Finding needles in haystacks
ACM Transactions on Algorithms (TALG)
Reduction of stochastic parity to stochastic mean-payoff games
Information Processing Letters
25 Years of Model Checking
Precise Interval Analysis vs. Parity Games
FM '08 Proceedings of the 15th international symposium on Formal Methods
A CSP-Based Approach for Solving Parity Game
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
State Focusing: Lazy Abstraction for the Mu-Calculus
SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
The Descriptive Complexity of Parity Games
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Infinite Runs in Weighted Timed Automata with Energy Constraints
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Polynomial-Time Under-Approximation of Winning Regions in Parity Games
Electronic Notes in Theoretical Computer Science (ENTCS)
Algorithms for Solving Infinite Games
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Solving μ-Calculus Parity Games by Symbolic Planning
Model Checking and Artificial Intelligence
Games through Nested Fixpoints
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Measuring Permissivity in Finite Games
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Solving Parity Games in Practice
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Computational Aspects of Equilibria
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Linear Complementarity Algorithms for Infinite Games
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Deciding Nondeterministic Hierarchy of Deterministic Tree Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Obtaining Memory-Efficient Solutions to Boolean Equation Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Automata Games for Multiple-model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Information Processing Letters
Representing and verifying temporal epistemic properties in multi-agent systems
CLIMA VII'06 Proceedings of the 7th international conference on Computational logic in multi-agent systems
More precise partition abstractions
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
On the universal and existential fragments of the µ-calculus
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
An accelerated algorithm for 3-color parity games with an application to timed games
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Local abstraction-refinement for the mu-calculus
Proceedings of the 14th international SPIN conference on Model checking software
A generic constructive solution for concurrent games with expressive constraints on strategies
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Solving parity games in big steps
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Model checking for action abstraction
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
Mean-payoff games and propositional proofs
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
On the complexity of model expansion
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Mean-payoff games and propositional proofs
Information and Computation
Faster algorithms for mean-payoff games
Formal Methods in System Design
The complexity of integer bound propagation
Journal of Artificial Intelligence Research
Logic and games on automatic structures: playing with quantifiers and decompositions
Logic and games on automatic structures: playing with quantifiers and decompositions
Energy and mean-payoff parity markov decision processes
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Parity games on graphs with medium tree-width
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
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)
Verifying real-time temporal, cooperation and epistemic properties for uncertain agents
MICAI'06 Proceedings of the 5th Mexican international conference on Artificial Intelligence
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Deterministic priority mean-payoff games as limits of discounted games
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Treewidth in verification: local vs. global
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Reasoning about Co-Büchi tree automata
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
A survey of stochastic ω-regular games
Journal of Computer and System Sciences
Solving parity games by a reduction to SAT
Journal of Computer and System Sciences
Model checking for epistemic and temporal properties of uncertain agents
PRIMA'06 Proceedings of the 9th Pacific Rim international conference on Agent Computing and Multi-Agent Systems
A subexponential lower bound for the random facet algorithm for parity games
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Fixpoint logics on hierarchical structures
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Solving alternating boolean equation systems in answer set programming
INAP'04/WLP'04 Proceedings of the 15th international conference on Applications of Declarative Programming and Knowledge Management, and 18th international conference on Workshop on Logic Programming
Template-Based unbounded time verification of affine hybrid automata
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
A pumping algorithm for ergodic stochastic mean payoff games with perfect information
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
On the complexity of parity games
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
Concurrent games with ordered objectives
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Survey: Equilibria, fixed points, and complexity classes
Computer Science Review
A Linear Time Special Case for MC Games
Fundamenta Informaticae
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
A cure for stuttering parity games
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
Polynomial-Time algorithms for energy games with special weight structures
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Concurrent small progress measures
HVC'11 Proceedings of the 7th international Haifa Verification conference on Hardware and Software: verification and testing
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
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
On the complexity of verifying regular properties on flat counter systems,
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Hyperplane separation technique for multidimensional mean-payoff games
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Alternating traps in Muller and parity games
Theoretical Computer Science
On Modal μ-Calculus in S5 and Applications
Fundamenta Informaticae - Special Issue on the Italian Conference on Computational Logic: CILC 2011
A note on the approximation of mean-payoff games
Information Processing Letters
| Hi-index | 0.89 |