Sebastian Perez-Salazar

According to our database, Sebastian Perez-Salazar authored at least 11 papers between 2018 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

On First-Order Meta-Reinforcement Learning with Moreau Envelopes.

Mohammad Taha Toghani, Sebastian Perez-Salazar, César A. Uribe

Proceedings of the 62nd IEEE Conference on Decision and Control, 2023

2022

Adaptive Bin Packing with Overflow.

Sebastian Perez-Salazar, Mohit Singh, Alejandro Toriello

Math. Oper. Res., November, 2022

New benchmarking techniques in resource allocation problems: theory and applications in cloud systems.

Sebastian Perez-Salazar

PhD thesis, 2022

Dynamic Resource Allocation in the Cloud with Near-Optimal Efficiency.

Sebastian Perez-Salazar, Ishai Menache, Mohit Singh, Alejandro Toriello

Oper. Res., 2022

The IID Prophet Inequality with Limited Flexibility.

Sebastian Perez-Salazar, Mohit Singh, Alejandro Toriello

CoRR, 2022

2021

Robust Online Selection with Uncertain Offer Acceptance.

Sebastian Perez-Salazar, Mohit Singh, Alejandro Toriello

CoRR, 2021

Preserving Diversity when Partitioning: A Geometric Approach.

Sebastian Perez-Salazar, Alfredo Torrico, Victor Verdugo

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.

Sebastian Perez-Salazar, Rachel Cummings

Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020

Graph reconstruction in the congested clique.

Pedro Montealegre, Sebastian Perez-Salazar, Ivan Rapaport, Ioan Todinca

J. Comput. Syst. Sci., 2020

Online Adaptive Bin Packing with Overflow.

Sebastian Perez-Salazar, Mohit Singh, Alejandro Toriello

CoRR, 2020

2018

Two Rounds Are Enough for Reconstructing Any Graph (Class) in the Congested Clique Model.

Pedro Montealegre, Sebastian Perez-Salazar, Ivan Rapaport, Ioan Todinca

Proceedings of the Structural Information and Communication Complexity, 2018