Max-plus Algebraic Tools for Discrete Event Systems, Static Analysis, and Zero-Sum Games
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
Subexponential lower bounds for randomized pivoting rules for the simplex algorithm
Proceedings of the forty-third annual ACM symposium on Theory of computing
On strategy improvement algorithms for simple stochastic games
Journal of Discrete Algorithms
The complexity of solving reachability games using value and strategy iteration
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
A subexponential lower bound for Zadeh's pivoting rule for solving linear programs and games
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
A subexponential lower bound for the random facet algorithm for parity games
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On strategy improvement algorithms for simple stochastic games
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
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
Tropical linear-fractional programming and parametric mean payoff games
Journal of Symbolic Computation
A superpolynomial lower bound for strategy iteration based on snare memorization
Discrete Applied Mathematics
Hi-index | 0.00 |
Model Checking is an automatic verification technique for state-transition systems that are finite-state or that have finite-state abstractions. In the early 1980's in a series of joint papers with my graduate students E.A. Emerson and A.P. Sistla, we ...