default search action
Alexander Erreygers
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j4]Alexander Erreygers:
Convex expectations for countable-state uncertain processes with càdlàg sample paths. Int. J. Approx. Reason. 175: 109308 (2024) - [i4]Arne Decadt, Alexander Erreygers, Jasper De Bock:
Extending choice assessments to choice functions: An algorithm for computing the natural extension. CoRR abs/2407.21164 (2024) - 2023
- [c9]Alexander Erreygers:
Sublinear expectations for countable-state uncertain processes. ISIPTA 2023: 210-221 - [c8]Yema Paul, Alexander Erreygers, Jasper De Bock:
Expected time averages in Markovian imprecise jump processes: a graph-theoretic characterisation of weak ergodicity. ISIPTA 2023: 379-389 - 2022
- [j3]Alexander Erreygers, Jasper De Bock:
Markovian imprecise jump processes: Extension to measurable variables, convergence theorems and algorithms. Int. J. Approx. Reason. 147: 78-124 (2022) - [i3]Arne Decadt, Alexander Erreygers, Jasper De Bock, Gert de Cooman:
Decision-making with E-admissibility given a finite assessment of choices. CoRR abs/2204.07428 (2022) - 2021
- [c7]Alexander Erreygers, Jasper De Bock:
Extending the Domain of Imprecise Jump Processes from Simple Variables to Measurable Ones. ISIPTA 2021: 140-149 - [c6]Jasper De Bock, Alexander Erreygers, Thomas Krak:
Sum-product laws and efficient algorithms for imprecise Markov chains. UAI 2021: 1476-1485 - 2020
- [c5]Alexander Erreygers
, Enrique Miranda
A Study of the Set of Probability Measures Compatible with Comparative Judgements. IPMU (2) 2020: 165-179
2010 – 2019
- 2019
- [j2]Alexander Erreygers, Jasper De Bock:
Bounding inferences for large-scale continuous-time Markov chains: A new approach based on lumping and imprecise Markov chains. Int. J. Approx. Reason. 115: 96-133 (2019) - [c4]Alexander Erreygers, Jasper De Bock:
First Steps Towards an Imprecise Poisson Process. ISIPTA 2019: 175-184 - 2018
- [j1]Alexander Erreygers
Imprecise Markov Models for Scalable and Robust Performance Evaluation of Flexi-Grid Spectrum Allocation Policies. IEEE Trans. Commun. 66(11): 5401-5414 (2018) - [c3]Alexander Erreygers, Jasper De Bock:
Computing Inferences for Large-Scale Continuous-Time Markov Chains by Combining Lumping with Imprecision. SMPS 2018: 78-86 - [c2]Thomas E. Krak, Alexander Erreygers, Jasper De Bock:
An Imprecise Probabilistic Estimator for the Transition Rate Matrix of a Continuous-Time Markov Chain. SMPS 2018: 124-132 - [i2]Alexander Erreygers, Cristina Rottondi, Giacomo Verticale
Imprecise Markov Models for Scalable and Robust Performance Evaluation of Flexi-Grid Spectrum Allocation Policies. CoRR abs/1801.05700 (2018) - [i1]Thomas E. Krak, Alexander Erreygers, Jasper De Bock:
An Imprecise Probabilistic Estimator for the Transition Rate Matrix of a Continuous-Time Markov Chain. CoRR abs/1804.01330 (2018) - 2017
- [c1]Alexander Erreygers, Jasper De Bock:
Imprecise Continuous-Time Markov Chains: Efficient Computational Methods with Guaranteed Error Bounds. ISIPTA 2017: 145-156
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 2024-11-14 00:54 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: