default search action
Marc P. Renault
Person information
- affiliation: University of Wisconsin-Madison, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j8]Spyros Angelopoulos, Christoph Dürr
, Shendan Jin, Shahin Kamali, Marc P. Renault:
Online computation with untrusted advice. J. Comput. Syst. Sci. 144: 103545 (2024) - 2020
- [j7]Spyros Angelopoulos, Marc P. Renault
Stochastic Dominance and the Bijective Ratio of Online Algorithms. Algorithmica 82(5): 1101-1135 (2020) - [j6]Alejandro López-Ortiz, Marc P. Renault, Adi Rosén:
Paid exchanges are worth the price. Theor. Comput. Sci. 824-825: 1-10 (2020) - [c7]Spyros Angelopoulos
Online Computation with Untrusted Advice. ITCS 2020: 52:1-52:15
2010 – 2019
- 2019
- [i4]Spyros Angelopoulos, Christoph Dürr, Shendan Jin, Shahin Kamali, Marc P. Renault:
Online Computation with Untrusted Advice. CoRR abs/1905.05655 (2019) - 2018
- [j5]Spyros Angelopoulos, Christoph Dürr, Shahin Kamali, Marc P. Renault, Adi Rosén:
Online Bin Packing with Advice of Small Size. Theory Comput. Syst. 62(8): 2006-2034 (2018) - [c6]Lucas Boczkowski, Brieuc Guinard, Amos Korman, Zvi Lotker, Marc P. Renault:
Random Walks with Multiple Step Lengths. LATIN 2018: 174-186 - 2017
- [j4]Marc P. Renault
Online algorithms with advice for the dual bin packing problem. Central Eur. J. Oper. Res. 25(4): 953-966 (2017) - [j3]Anna Adamaszek
Reordering buffer management with advice. J. Sched. 20(5): 423-442 (2017) - 2016
- [c5]Christoph Dürr, Christian Konrad, Marc P. Renault:
On the Power of Advice and Randomization for Online Bipartite Matching. ESA 2016: 37:1-37:16 - [i3]Christoph Dürr, Christian Konrad, Marc P. Renault:
On the Power of Advice and Randomization for Online Bipartite Matching. CoRR abs/1602.07154 (2016) - [i2]Spyros Angelopoulos, Marc P. Renault, Pascal Schweitzer:
Stochastic dominance and the bijective ratio of online algorithms. CoRR abs/1607.06132 (2016) - 2015
- [j2]Marc P. Renault
On Online Algorithms with Advice for the k-Server Problem. Theory Comput. Syst. 56(1): 3-21 (2015) - [j1]Marc P. Renault
Online algorithms with advice for bin packing and scheduling problems. Theor. Comput. Sci. 600: 155-170 (2015) - [c4]Alejandro López-Ortiz, Marc P. Renault
Paid Exchanges are Worth the Price. STACS 2015: 636-648 - [c3]Spyros Angelopoulos, Christoph Dürr, Shahin Kamali, Marc P. Renault
Online Bin Packing with Advice of Small Size. WADS 2015: 40-53 - 2013
- [c2]Anna Adamaszek
Reordering Buffer Management with Advice. WAOA 2013: 132-143 - [i1]Marc P. Renault, Adi Rosén, Rob van Stee:
Online Algorithms with Advice for Bin Packing and Scheduling Problems. CoRR abs/1311.7589 (2013) - 2011
- [c1]Marc P. Renault
On Online Algorithms with Advice for the k-Server Problem. WAOA 2011: 198-210
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-23 18:35 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: