On Online Algorithms with Advice for the k-Server Problem. - Marc P. Renault; Adi Rosén (Theory Comput. Syst., 2015)

Online algorithms with advice for bin packing and scheduling problems. - Marc P. Renault; Adi Rosén; Rob van Stee (Theor. Comput. Sci., 2015)

On the Power of Advice and Randomization for Online Bipartite Matching. - Christoph Dürr; Christian Konrad 001; Marc P. Renault (ESA, 2016)

Online algorithms with advice for the dual bin packing problem. - Marc P. Renault (Central Eur. J. Oper. Res., 2017)

Reordering buffer management with advice. - Anna Adamaszek; Marc P. Renault; Adi Rosén; Rob van Stee (J. Sched., 2017)

Random Walks with Multiple Step Lengths. - Lucas Boczkowski; Brieuc Guinard; Amos Korman; Zvi Lotker; Marc P. Renault (LATIN, 2018)

Online Bin Packing with Advice of Small Size. - Spyros Angelopoulos 001; Christoph Dürr; Shahin Kamali; Marc P. Renault; Adi Rosén (Theory Comput. Syst., 2018)

Stochastic Dominance and the Bijective Ratio of Online Algorithms. - Spyros Angelopoulos 001; Marc P. Renault; Pascal Schweitzer (Algorithmica, 2020)

Paid exchanges are worth the price. - Alejandro López-Ortiz; Marc P. Renault; Adi Rosén (Theor. Comput. Sci., 2020)

Online computation with untrusted advice. - Spyros Angelopoulos 001; Christoph Dürr; Shendan Jin; Shahin Kamali; Marc P. Renault (J. Comput. Syst. Sci., 2024)