Thomas Lavastida

Orcid: 0009-0007-7874-1908

According to our database1, Thomas Lavastida authored at least 10 papers between 2019 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Controlling Tail Risk in Online Ski-Rental.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
From Stream to Pool: Dynamic Pricing Beyond i.i.d. Arrivals.
CoRR, 2023

2022
Algorithms with Prediction Portfolios.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021
Faster Matchings via Learned Duals.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

A Scalable Approximation Algorithm for Weighted Longest Common Subsequence.
Proceedings of the Euro-Par 2021: Parallel Processing, 2021

Learnable and Instance-Robust Predictions for Online Matching, Flows and Load Balancing.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021

Scaling Average-Linkage via Sparse Cluster Embeddings.
Proceedings of the Asian Conference on Machine Learning, 2021

Using Predicted Weights for Ad Delivery.
Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms, 2021

2020
Online Scheduling via Learned Weights.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
A Framework for Parallelizing Hierarchical Clustering Methods.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2019


  Loading...