default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHugo Bazille
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j2]S. Akshay, Hugo Bazille, Blaise Genest, Mihir Vahanwala:
On Robustness for the Skolem, Positivity and Ultimate Positivity Problems. Log. Methods Comput. Sci. 20(2) (2024)- [c10]Amazigh Amrane, Hugo Bazille, Emily Clement, Uli Fahrenberg, Krzysztof Ziemianski:
Presenting Interval Pomsets with Interfaces. RAMiCS 2024: 28-45 - [c9]Amazigh Amrane, Hugo Bazille, Emily Clement, Uli Fahrenberg:
Languages of Higher-Dimensional Timed Automata. Petri Nets 2024: 197-219 - [c8]Amazigh Amrane, Hugo Bazille, Uli Fahrenberg, Marie Fortin:
Logic and Languages of Higher-Dimensional Automata. DLT 2024: 51-67 - [i6]Amazigh Amrane, Hugo Bazille, Emily Clement, Uli Fahrenberg:
Languages of Higher-Dimensional Timed Automata. CoRR abs/2401.17444 (2024) - [i5]Amazigh Amrane, Hugo Bazille, Emily Clement, Uli Fahrenberg, Krzysztof Ziemianski:
Presenting Interval Pomsets with Interfaces. CoRR abs/2403.16626 (2024) - [i4]Amazigh Amrane, Hugo Bazille, Uli Fahrenberg, Marie Fortin:
Logic and Languages of Higher-Dimensional Automata. CoRR abs/2403.19526 (2024) - 2023
- [c7]Amazigh Amrane, Hugo Bazille, Uli Fahrenberg, Krzysztof Ziemianski:
Closure and Decision Properties for Higher-Dimensional Automata. ICTAC 2023: 295-312 - [i3]Amazigh Amrane, Hugo Bazille, Uli Fahrenberg, Krzysztof Ziemianski:
Developments in Higher-Dimensional Automata Theory. CoRR abs/2305.02873 (2023) - 2022
- [c6]S. Akshay, Hugo Bazille, Blaise Genest, Mihir Vahanwala
:
On Robustness for the Skolem and Positivity Problems. STACS 2022: 5:1-5:20 - [i2]S. Akshay, Hugo Bazille, Blaise Genest, Mihir Vahanwala:
On Robustness for the Skolem, Positivity and Ultimate Positivity Problems. CoRR abs/2211.02365 (2022) - 2020
- [c5]Hugo Bazille, Blaise Genest, Cyrille Jégourel, Jun Sun:
Global PAC Bounds for Learning Discrete Time Markov Chains. CAV (2) 2020: 304-326
2010 – 2019
- 2019
- [b1]Hugo Bazille:
Detection and Quantification of Events in Stochastic Systems. (Détection et Quantification d'Evenements dans les Systèmes Stochastiques). University of Rennes, Inria, SUMO Team, France, 2019 - [c4]S. Akshay, Hugo Bazille, Eric Fabre, Blaise Genest:
Classification Among Hidden Markov Models. FSTTCS 2019: 29:1-29:14 - 2018
- [j1]Hugo Bazille, Olivier Bournez, Walid Gomaa, Amaury Pouly:
On the complexity of bounded time and precision reachability for piecewise affine systems. Theor. Comput. Sci. 735: 132-146 (2018) - [c3]Hugo Bazille, Eric Fabre, Blaise Genest:
Symbolically Quantifying Response Time in Stochastic Models Using Moments and Semirings. FoSSaCS 2018: 403-419 - 2017
- [c2]Hugo Bazille, Eric Fabre, Blaise Genest:
Diagnosability degree of stochastic discrete event systems. CDC 2017: 5726-5731 - 2016
- [i1]Hugo Bazille, Olivier Bournez, Walid Gomaa, Amaury Pouly:
On The Complexity of Bounded Time Reachability for Piecewise Affine Systems. CoRR abs/1601.05353 (2016) - 2014
- [c1]Hugo Bazille, Olivier Bournez, Walid Gomaa, Amaury Pouly:
On The Complexity of Bounded Time Reachability for Piecewise Affine Systems. RP 2014: 20-31
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:57 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
