default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRaimundo Saona
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c3]Ali Asadi
, Krishnendu Chatterjee, Jakub Svoboda, Raimundo Saona Urmeneta:
Deterministic Sub-exponential Algorithm for Discounted-sum Games with Unary Weights. LICS 2024: 6:1-6:12- [i8]Ali Asadi, Krishnendu Chatterjee, Raimundo Saona, Jakub Svoboda:
Deterministic Sub-exponential Algorithm for Discounted-sum Games with Unary Weights. CoRR abs/2405.02479 (2024) - [i7]Ali Asadi, Krishnendu Chatterjee, Raimundo Saona, Jakub Svoboda:
Concurrent Stochastic Games with Stateful-discounted and Parity Objectives: Complexity and Algorithms. CoRR abs/2405.02486 (2024) - [i6]Krishnendu Chatterjee, David Lurie, Raimundo Saona, Bruno Ziliotto:
Ergodic Unobservable MDPs: Decidability of Approximation. CoRR abs/2405.12583 (2024) - [i5]Giordano Giambartolomei, Frederik Mallmann-Trenn, Raimundo Saona:
IID Prophet Inequality with Random Horizon: Going Beyond Increasing Hazard Rates. CoRR abs/2407.11752 (2024) - 2023
- [c2]Krishnendu Chatterjee, Tobias Meggendorfer, Raimundo Saona, Jakub Svoboda:
Faster Algorithm for Turn-based Stochastic Games with Bounded Treewidth. SODA 2023: 4590-4605 - [i4]Giordano Giambartolomei, Frederik Mallmann-Trenn, Raimundo Saona:
Prophet Inequalities: Separating Random Order from Order Selection. CoRR abs/2304.04024 (2023) - 2022
- [j3]Krishnendu Chatterjee, Raimundo Saona, Bruno Ziliotto:
Finite-Memory Strategies in POMDPs with Long-Run Average Objectives. Math. Oper. Res. 47(1): 100-119 (2022) - [i3]Krishnendu Chatterjee, Mona Mohammadi, Raimundo Saona:
Repeated Prophet Inequality with Near-optimal Bounds. CoRR abs/2209.14368 (2022) - 2021
- [j2]José Correa, Raimundo Saona, Bruno Ziliotto:
Prophet secretary through blind strategies. Math. Program. 190(1): 483-521 (2021)
2010 – 2019
- 2019
- [c1]José Correa, Raimundo Saona, Bruno Ziliotto:
Prophet Secretary Through Blind Strategies. SODA 2019: 1946-1961 - [i2]Krishnendu Chatterjee, Raimundo Saona, Bruno Ziliotto:
The Complexity of POMDPs with Long-run Average Objectives. CoRR abs/1904.13360 (2019) - 2018
- [j1]David Acuna, Marcos E. Orchard, Raimundo Saona:
Conditional predictive Bayesian Cramér-Rao Lower Bounds for prognostic algorithms design. Appl. Soft Comput. 72: 647-665 (2018) - [i1]José Correa, Raimundo Saona, Bruno Ziliotto:
Prophet Secretary Through Blind Strategies. CoRR abs/1807.07483 (2018)
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-08-25 20:04 CEST 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:
