Thomas Lavastida 个人学术档案

引用次数

	总计	2019 年至今
引用	320	320
h 指数	6	6
i10 指数	5	5

120

2019202020212022202320241 17 45 94 104 55

开放获取的出版物数量

查看全部

5 篇文章

0 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Benjamin MoseleyCarnegie Mellon University在 andrew.cmu.edu 的电子邮件经过验证
Sergei VassilvitskiiGoogle在 google.com 的电子邮件经过验证
Silvio LattanziResearch Scientist at Google在 google.com 的电子邮件经过验证
Kefu LuWashington and Lee University在 wlu.edu 的电子邮件经过验证
R RaviCarnegie Mellon Unviersity在 andrew.cmu.edu 的电子邮件经过验证
Chenyang XuEast China Normal University在 sei.ecnu.edu.cn 的电子邮件经过验证
Sungjin ImUniversity of California, Merced在 ucmerced.edu 的电子邮件经过验证
Michael DinitzAssociate Professor, Johns Hopkins University在 cs.jhu.edu 的电子邮件经过验证
Yuyan WangGoogle在 google.com 的电子邮件经过验证
Jeremy Buhlerprofessor of computer science, Washington university在 wustl.edu 的电子邮件经过验证

关注

Thomas Lavastida

Assistant Professor, Jindal School of Management, University of Texas at Dallas

在 utdallas.edu 的电子邮件经过验证 - 首页

Algorithms Algorithms with Predictions Machine Learning


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
Online Scheduling via Learned Weights S Lattanzi, T Lavastida, B Moseley, S Vassilvitskii Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020	193	2020
Learnable and Instance-Robust Predictions for Online Matching, Flows and Load Balancing T Lavastida, B Moseley, R Ravi, C Xu arXiv preprint arXiv:2011.11743, 2020	56	2020
A Framework for Parallelizing Hierarchical Clustering Methods S Lattanzi, T Lavastida, K Lu, B Moseley Joint European Conference on Machine Learning and Knowledge Discovery in …, 2019	24*	2019
Faster matchings via learned duals M Dinitz, S Im, T Lavastida, B Moseley, S Vassilvitskii Advances in Neural Information Processing Systems 34, 10393-10406, 2021	22	2021
Using Predicted Weights for Ad Delivery T Lavastida, B Moseley, R Ravi, C Xu SIAM Conference on Applied and Computational Discrete Algorithms (ACDA21), 21-31, 2021	13	2021
Algorithms with prediction portfolios M Dinitz, S Im, T Lavastida, B Moseley, S Vassilvitskii Advances in neural information processing systems 35, 20273-20286, 2022	8	2022
Scaling Average-Linkage via Sparse Cluster Embeddings T Lavastida, K Lu, B Moseley, Y Wang Asian Conference on Machine Learning, 1429-1444, 2021	3	2021
A scalable approximation algorithm for weighted longest common subsequence J Buhler, T Lavastida, K Lu, B Moseley European Conference on Parallel Processing, 368-384, 2021	1	2021
Controlling Tail Risk in Online Ski-Rental M Dinitz, S Im, T Lavastida, B Moseley, S Vassilvitskii Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024		2024
On Scalable Algorithms and Algorithms with Predictions T Lavastida Carnegie Mellon University, 2022		2022

系统目前无法执行此操作，请稍后再试。

文章 1–10

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用