| Temporal specifications with accumulative values U Boker, K Chatterjee, TA Henzinger, O Kupferman ACM Transactions on Computational Logic (TOCL) 15 (4), 1-25, 2014 | 130 | 2014 |
| What’s decidable about weighted automata? S Almagor, U Boker, O Kupferman Automated Technology for Verification and Analysis: 9th International …, 2011 | 109* | 2011 |
| Discounting in LTL S Almagor, U Boker, O Kupferman Tools and Algorithms for the Construction and Analysis of Systems: 20th …, 2014 | 76 | 2014 |
| Formally reasoning about quality S Almagor, U Boker, O Kupferman Journal of the ACM (JACM) 63 (3), 1-56, 2016 | 64 | 2016 |
| The Church-Turing thesis over arbitrary domains U Boker, N Dershowitz Pillars of computer science: essays dedicated to Boris (Boaz) Trakhtenbrot …, 2008 | 54 | 2008 |
| Nondeterminism in the presence of a diverse or unknown future U Boker, D Kuperberg, O Kupferman, M Skrzypczak International Colloquium on Automata, Languages, and Programming, 89-100, 2013 | 46 | 2013 |
| Formalizing and reasoning about quality S Almagor, U Boker, O Kupferman International Colloquium on Automata, Languages, and Programming, 15-27, 2013 | 41 | 2013 |
| Decidable verification under a causally consistent shared memory O Lahav, U Boker Proceedings of the 41st ACM SIGPLAN Conference on Programming Language …, 2020 | 39 | 2020 |
| Why These Automata Types? U Boker LPAR 18, 143-163, 2018 | 39 | 2018 |
| Alternation removal in Büchi automata U Boker, O Kupferman, A Rosenberg Automata, Languages and Programming: 37th International Colloquium, ICALP …, 2010 | 38 | 2010 |
| The target discounted-sum problem U Boker, TA Henzinger, J Otop 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 750-761, 2015 | 37 | 2015 |
| Families of DFAs as Acceptors of -Regular Languages D Angluin, U Boker, D Fisman Logical Methods in Computer Science 14, 2018 | 34 | 2018 |
| Exact and approximate determinization of discounted-sum automata U Boker, TA Henzinger Logical Methods in Computer Science 10, 2014 | 34 | 2014 |
| Good for games automata: From nondeterminism to alternation U Boker, K Lehtinen arXiv preprint arXiv:1906.11624, 2019 | 32 | 2019 |
| How deterministic are good-for-games automata? U Boker, O Kupferman, M Skrzypczak arXiv preprint arXiv:1710.04115, 2017 | 32 | 2017 |
| Comparing computational power U Boker, N Dershowitz Logic Journal of the IGPL 14 (5), 633-647, 2006 | 32 | 2006 |
| Three paths to effectiveness U Boker, N Dershowitz Fields of logic and computation: essays dedicated to Yuri Gurevich on the …, 2010 | 27 | 2010 |
| Battery transition systems U Boker, TA Henzinger, A Radhakrishna Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of …, 2014 | 26 | 2014 |
| History determinism vs. good for gameness in quantitative automata U Boker, K Lehtinen arXiv preprint arXiv:2110.14238, 2021 | 25 | 2021 |
| Formalizing and reasoning about quality S Almagor, U Boker, O Kupferman Journal of the ACM 63 (3), 24, 2016 | 25 | 2016 |
Orna KupfermanProfessor of Computer Science, The Hebrew UniversityVerified email at cs.huji.ac.il
