Progress measures and stack assertions for fair termination
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Weak alternating automata are not that weak
ACM Transactions on Computational Logic (TOCL)
Effectively closed sets and graphs of computable real functions
Theoretical Computer Science
Complementation constructions for nondeterministic automata on infinite words
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A theory of robust omega-regular software synthesis
ACM Transactions on Embedded Computing Systems (TECS)
| Hi-index | 0.00 |