| Run-time optimization for learned controllers through quantitative games G Avni, R Bloem, K Chatterjee, TA Henzinger, B Könighofer, S Pranger International Conference on Computer Aided Verification, 630-649, 2019 | 54 | 2019 |
| Synthesizing Time-Triggered Schedules for Switched Networks with Faulty Links G Avni, S Guha, G Rodriguez-Navas International Conference on Embedded Software, 2016 | 38 | 2016 |
| Repairing Multi-Player Games S Almagor, G Avni, O Kupferman CONCUR 2015–Concurrency Theory 42, 2015 | 35 | 2015 |
| Infinite-Duration Bidding Games G Avni, V Chonev, TA Henzinger J. ACM 66 (4), 31:1--31:29, 2019 | 31 | 2019 |
| Network-Formation Games with Regular Objectives G Avni, O Kupferman, T Tamir Foundations of Software Science and Computation Structures, 119-133, 2014 | 29 | 2014 |
| Dynamic resource allocation games G Avni, TA Henzinger, O Kupferman International Symposium on Algorithmic Game Theory, 153-166, 2016 | 23* | 2016 |
| Bidding mechanisms in graph games G Avni, TA Henzinger, Đ Žikelić Journal of Computer and System Sciences 119, 133-144, 2021 | 22 | 2021 |
| Cost-sharing scheduling games on restricted unrelated machines G Avni, T Tamir Theoretical Computer Science 646, 26-39, 2016 | 21 | 2016 |
| Formal methods with a touch of magic PA Alamdari, G Avni, TA Henzinger, A Lukina Proceedings of the 20th Conference on Formal Methods in Computer-Aided Design, 2020 | 20 | 2020 |
| Infinite-duration poorman-bidding games G Avni, TA Henzinger, R Ibsen-Jensen International Conference on Web and Internet Economics, 21-36, 2018 | 20 | 2018 |
| Determinacy in discrete-bidding infinite-duration games M Aghajohari, G Avni, TA Henzinger Logical Methods in Computer Science 17, 2021 | 18 | 2021 |
| An Abstraction-Refinement Methodology for Reasoning about Network Games G Avni, S Guha, O Kupferman Games 9 (3), 39, 2018 | 18 | 2018 |
| ASQ-IT: Interactive explanations for reinforcement-learning agents Y Amitai, O Amir, G Avni Artificial Intelligence 335, 104182, 2024 | 17* | 2024 |
| Synthesis from component libraries with costs G Avni, O Kupferman Theoretical Computer Science 712, 50-72, 2018 | 17* | 2018 |
| Infinite-duration all-pay bidding games G Avni, I Jecker, Đ Žikelić Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 16 | 2021 |
| A survey of bidding games on graphs G Avni, TA Henzinger 31st International Conference on Concurrency Theory 171, 2020 | 16* | 2020 |
| All-pay bidding games on graphs G Avni, R Ibsen-Jensen, J Tkadlec Proceedings of the AAAI Conference on Artificial Intelligence 34 (02), 1798-1805, 2020 | 13 | 2020 |
| Timed network games G Avni, S Guha, O Kupferman 42nd International Symposium on Mathematical Foundations of Computer Science …, 2017 | 11 | 2017 |
| Making weighted containment feasible: A heuristic based on simulation and abstraction G Avni, O Kupferman International Conference on Concurrency Theory, 84-99, 2012 | 10 | 2012 |
| Automatic generation of quality specifications S Almagor, G Avni, O Kupferman International Conference on Computer Aided Verification, 479-494, 2013 | 9 | 2013 |
Orna KupfermanProfessor of Computer Science, The Hebrew UniversityVerified email at cs.huji.ac.il
