| Global PAC bounds for learning discrete time Markov chains H Bazille, B Genest, C Jégourel, J Sun Computer Aided Verification: 32nd International Conference, CAV 2020, Los …, 2020 | 11 | 2020 |
| Diagnosability degree of stochastic discrete event systems H Bazille, E Fabre, B Genest 2017 IEEE 56th Annual Conference on Decision and Control (CDC), 5726-5731, 2017 | 10 | 2017 |
| On robustness for the Skolem and Positivity problems S Akshay, H Bazille, B Genest, M Vahanwala STACS 2022-39th International Symposium on Theoretical Aspects of Computer …, 2022 | 8 | 2022 |
| Classification among hidden Markov models S Akshay, H Bazille, E Fabre, B Genest FSTTCS 2019-39th IARCS Annual Conference on. Foundations of Software …, 2019 | 8 | 2019 |
| On the complexity of bounded time reachability for piecewise affine systems H Bazille, O Bournez, W Gomaa, A Pouly Reachability Problems: 8th International Workshop, RP 2014, Oxford, UK …, 2014 | 7 | 2014 |
| Closure and decision properties for higher-dimensional automata A Amrane, H Bazille, U Fahrenberg, K Ziemiański International Colloquium on Theoretical Aspects of Computing, 295-312, 2023 | 6 | 2023 |
| On robustness for the skolem, positivity and ultimate positivity problems S Akshay, H Bazille, B Genest, M Vahanwala arXiv preprint arXiv:2211.02365, 2022 | 3 | 2022 |
| On the complexity of bounded time and precision reachability for piecewise affine systems H Bazille, O Bournez, W Gomaa, A Pouly Theoretical Computer Science 735, 132-146, 2018 | 2 | 2018 |
| Symbolically quantifying response time in stochastic models using moments and semirings H Bazille, E Fabre, B Genest Foundations of Software Science and Computation Structures: 21st …, 2018 | 2 | 2018 |
| Complexity reduction techniques for quantified diagnosability of stochastic systems H Bazille, E Fabre, B Genest IFAC-PapersOnLine 51 (7), 82-87, 2018 | 2 | 2018 |
| Languages of Higher-Dimensional Timed Automata A Amrane, H Bazille, E Clement, U Fahrenberg arXiv preprint arXiv:2401.17444, 2024 | 1 | 2024 |
| Computational Protein Design: trying an Answer Set Programming approach to solve the problem H Bazille, J Nicolas 10th Workshop on Constraint-Based Methods for Bioinformatics (WCB'14), 2014 | 1 | 2014 |
| Protein design: a NP-hard problem in bioinformatics H Bazille Computer Science, 1-33, 2014 | 1 | 2014 |
| Logic and Languages of Higher-Dimensional Automata A Amrane, H Bazille, U Fahrenberg, M Fortin arXiv preprint arXiv:2403.19526, 2024 | | 2024 |
| Presenting Interval Pomsets with Interfaces A Amrane, H Bazille, E Clement, U Fahrenberg, K Ziemianski arXiv preprint arXiv:2403.16626, 2024 | | 2024 |
| Developments in Higher-Dimensional Automata Theory A Amrane, H Bazille, U Fahrenberg, K Ziemiański arXiv preprint arXiv:2305.02873, 2023 | | 2023 |
| Detection and quantification of events in stochastic systems H Bazille Université de Rennes, 2019 | | 2019 |
| Certification formelle des réseaux neuronaux profonds: un état de l’art en 2019 H Bazille, E Fabre, B Genest AI and Defense 2019-Artificial Intelligence and defense, 1-10, 2019 | | 2019 |
| ON THE COMPLEXITY OF BOUNDED TIME REACHABILITY FOR PIECEWISE AFFINE SYSTEMS O BOURNEZ, A POULY, W GOMAA, H BAZILLE LECTURE NOTES IN COMPUTER SCIENCE 8762, 20-31, 2014 | | 2014 |
| Research Master Internship H Bazille, J Nicolas | | |
S AkshayIIT BombayVerified email at cse.iitb.ac.in
