Benjamin Moseley

Citado por

	Total	Desde 2019
Citas	4358	2691
Índice h	28	22
Índice i10	69	53

520

260

130

390

2011201220132014201520162017201820192020202120222023202430 87 142 222 239 260 281 341 398 377 454 507 502 446

Acceso público

Ver todo

67 artículos

1 artículo

disponibles

no disponibles

Basado en requisitos de financiación

Coautores

Sungjin ImUniversity of California, MercedDirección de correo verificada de ucmerced.edu
Sergei VassilvitskiiGoogleDirección de correo verificada de google.com
Kirk PruhsProfessor of Computer Science, University of PittsburghDirección de correo verificada de cs.pitt.edu
Ravi KumarGoogleDirección de correo verificada de google.com
Thomas LavastidaAssistant Professor, Jindal School of Management, University of Texas at DallasDirección de correo verificada de utdallas.edu
Kefu LuWashington and Lee UniversityDirección de correo verificada de wlu.edu
Silvio LattanziResearch Scientist at GoogleDirección de correo verificada de google.com
Andrea VattaniML Leadership at Reddit, Computer Science PhD from UC San DiegoDirección de correo verificada de cs.ucsd.edu
Gustavo MalkomesIntelDirección de correo verificada de intel.com
Kunal AgrawalAssociate Professor of Computer Science and Engineering, Washington University in St LouisDirección de correo verificada de wustl.edu
Hung Q. NgoRelationalAIDirección de correo verificada de relational.ai
Roman GarnettWashington University in St. LouisDirección de correo verificada de wustl.edu
Bahman BahmaniStanford UniversityDirección de correo verificada de cs.stanford.edu
Chandra ChekuriProfessor of Computer Science, University of Illinois, Urbana-ChampaignDirección de correo verificada de illinois.edu
Clifford SteinProfessor of IEOR and CS, Columbia UniversityDirección de correo verificada de ieor.columbia.edu
Emily FoxDepartment of Computer Science, The University of Texas at DallasDirección de correo verificada de utdallas.edu
Shali JiangFacebookDirección de correo verificada de wustl.edu
Jing LiYing Wu College of Computing, NJITDirección de correo verificada de njit.edu
Ravishankar KrishnaswamyMicrosoft ResearchDirección de correo verificada de cs.cmu.edu
Mahmoud Abo KhamisRelationalAI (mahmoud.abokhamis@relational.ai)Dirección de correo verificada de relational.ai

Seguir

Benjamin Moseley

Carnegie Mellon University

Dirección de correo verificada de andrew.cmu.edu - Página principal

Algorithms Machine Learning Discrete Optimization


Título Ordenar por citas Ordenar por año Ordenar por título	Citado por Citado por	Año
Scalable k-means++ B Bahmani, B Moseley, A Vattani, R Kumar, S Vassilvitskii arXiv preprint arXiv:1203.6402, 2012	967	2012
Filtering: a method for solving graph problems in mapreduce S Lattanzi, B Moseley, S Suri, S Vassilvitskii Proceedings of the twenty-third annual ACM symposium on Parallelism in …, 2011	322	2011
Fast clustering using MapReduce A Ene, S Im, B Moseley Proceedings of the 17th ACM SIGKDD international conference on Knowledge …, 2011	293	2011
Fast greedy algorithms in mapreduce and streaming R Kumar, B Moseley, S Vassilvitskii, A Vattani ACM Transactions on Parallel Computing (TOPC) 2 (3), 1-22, 2015	275	2015
Online scheduling via learned weights S Lattanzi, T Lavastida, B Moseley, S Vassilvitskii Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020	199	2020
On scheduling in map-reduce and flow-shops B Moseley, A Dasgupta, R Kumar, T Sarlós Proceedings of the twenty-third annual ACM symposium on Parallelism in …, 2011	147	2011
Approximation bounds for hierarchical clustering: Average linkage, bisecting k-means, and local search B Moseley, JR Wang Journal of Machine Learning Research 24 (1), 1-36, 2023	136	2023
Local search methods for k-means with outliers S Gupta, R Kumar, K Lu, B Moseley, S Vassilvitskii Proceedings of the VLDB Endowment 10 (7), 757-768, 2017	136	2017
Fast distributed k-center clustering with outliers on massive data G Malkomes, MJ Kusner, W Chen, KQ Weinberger, B Moseley Advances in Neural Information Processing Systems 28, 2015	97	2015
Efficient massively parallel methods for dynamic programming S Im, B Moseley, X Sun Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017	69	2017
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	66	2020
Efficient nonmyopic active search S Jiang, G Malkomes, G Converse, A Shofner, B Moseley, R Garnett International Conference on Machine Learning, 1714-1723, 2017	61	2017
Scheduling heterogeneous processors isn't as easy as you think A Gupta, S Im, R Krishnaswamy, B Moseley, K Pruhs Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012	59	2012
Functional aggregate queries with additive inequalities MA Khamis, RR Curtin, B Moseley, HQ Ngo, XL Nguyen, D Olteanu, ... ACM Transactions on Database Systems (TODS) 45 (4), 1-41, 2020	53	2020
Fair hierarchical clustering S Ahmadian, A Epasto, M Knittel, R Kumar, M Mahdian, B Moseley, ... Advances in Neural Information Processing Systems 33, 21050-21060, 2020	53	2020
A tutorial on amortized local competitiveness in online scheduling S Im, B Moseley, K Pruhs ACM SIGACT News 42 (2), 83-97, 2011	52	2011
Scheduling parallel DAG jobs online to minimize average flow time K Agrawal, J Li, K Lu, B Moseley Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete …, 2016	44	2016
Online scheduling on identical machines using SRPT K Fox, B Moseley Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete …, 2011	41	2011
An Online Scalable Algorithm for Minimizing ℓ_k-norms of Weighted Flow Time on Unrelated Machines S Im, B Moseley Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete …, 2011	40	2011
Energy efficient scheduling of parallelizable jobs K Fox, S Im, B Moseley Theoretical Computer Science 726, 30-40, 2018	38	2018

El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.

Artículos 1–20

Citas por año

Citas duplicadas

Citas combinadas

Añadir coautoresCoautores

Seguir

Citado por

Coautores