Follow
Sebastian Perez-Salazar
Sebastian Perez-Salazar
Rice University
Verified email at rice.edu - Homepage
Title
Cited by
Cited by
Year
Differentially private online submodular maximization
SP Salazar, R Cummings
International Conference on Artificial Intelligence and Statistics, 1279-1287, 2021
122021
Graph reconstruction in the congested clique
P Montealegre, S Perez-Salazar, I Rapaport, I Todinca
Journal of Computer and System Sciences 113, 1-17, 2020
82020
Adaptive bin packing with overflow
S Perez-Salazar, M Singh, A Toriello
Mathematics of Operations Research 47 (4), 3317-3356, 2022
52022
Dynamic Resource Allocation in the Cloud with Near-Optimal Efficiency.
I Menache, S Perez-Salazar, M Singh, A Toriello
Operations Research, 2021
5*2021
Two rounds are enough for reconstructing any graph (class) in the congested clique model
P Montealegre, S Perez-Salazar, I Rapaport, I Todinca
International Colloquium on Structural Information and Communication …, 2018
32018
The IID prophet inequality with limited flexibility
S Perez-Salazar, M Singh, A Toriello
arXiv preprint arXiv:2210.05634, 2022
22022
Robust online selection with uncertain offer acceptance
S Perez-Salazar, M Singh, A Toriello
arXiv preprint arXiv:2112.00842, 2021
22021
On first-order meta-reinforcement learning with moreau envelopes
MT Toghani, S Perez-Salazar, CA Uribe
2023 62nd IEEE Conference on Decision and Control (CDC), 4176-4181, 2023
12023
Preserving diversity when partitioning: a geometric approach
S Perez-Salazar, A Torrico, V Verdugo
Proceedings of the 1st ACM Conference on Equity and Access in Algorithms …, 2021
12021
Dynamic Resource Allocation in the Cloud with Near-Optimal Efficiency.
I Menache, S Perez-Salazar, M Singh, A Toriello
arXiv preprint arXiv:1809.02688, 2018
12018
El problema de la degenerancia de grafos en Congested Clique
SW Pérez Salazar
Universidad de Chile, 2016
2016
The system can't perform the operation now. Try again later.
Articles 1–11