Sebastian Perez-Salazar

Orcid: 0000-0003-4534-7721

According to our database1, Sebastian Perez-Salazar authored at least 20 papers between 2018 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Online Contract Selection for Continual Coverage.
CoRR, May, 2026

Prophets Inequalities with Uncertain Acceptance.
CoRR, March, 2026

Competition Versus Complexity in Multiple-Selection Prophet Inequalities.
CoRR, February, 2026

The I.I.D. Prophet Inequality with Limited Flexibility.
Math. Oper. Res., 2026

Splitting Guarantees for Prophet Inequalities via Nonlinear Systems.
Math. Oper. Res., 2026

2025
Online Selection with Uncertain Disruption.
CoRR, May, 2025

Robust Online Selection with Uncertain Offer Acceptance.
Math. Oper. Res., 2025

Residual Prophet Inequalities.
Proceedings of the 26th ACM Conference on Economics and Computation, 2025

2024
Optimal Guarantees for Online Selection Over Time.
CoRR, 2024

Stochastic Scheduling with Abandonments via Greedy Strategies.
CoRR, 2024

2023
On First-Order Meta-Reinforcement Learning with Moreau Envelopes.
Proceedings of the 62nd IEEE Conference on Decision and Control, 2023

2022
Adaptive Bin Packing with Overflow.
Math. Oper. Res., November, 2022

New benchmarking techniques in resource allocation problems: theory and applications in cloud systems.
PhD thesis, 2022

Dynamic Resource Allocation in the Cloud with Near-Optimal Efficiency.
Oper. Res., 2022

The IID Prophet Inequality with Limited Flexibility.
CoRR, 2022

2021
Preserving Diversity when Partitioning: A Geometric Approach.
Proceedings of the EAAMO 2021: ACM Conference on Equity and Access in Algorithms, Mechanisms, and Optimization, Virtual Event, USA, October 5, 2021

Differentially Private Online Submodular Maximization.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
Graph reconstruction in the congested clique.
J. Comput. Syst. Sci., 2020

Online Adaptive Bin Packing with Overflow.
CoRR, 2020

2018
Two Rounds Are Enough for Reconstructing Any Graph (Class) in the Congested Clique Model.
Proceedings of the Structural Information and Communication Complexity, 2018


  Loading...