Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling. - Chandra Chekuri; Sungjin Im; Benjamin Moseley (ESA, 2009)

Online scheduling to minimize the maximum delay factor. - Chandra Chekuri; Benjamin Moseley (SODA, 2009)

Longest Wait First for Broadcast Scheduling [Extended Abstract]. - Chandra Chekuri; Sungjin Im; Benjamin Moseley (WAOA, 2009)

Longest Wait First for Broadcast Scheduling - Chandra Chekuri; Sungjin Im; Benjamin Moseley (CoRR, 2009)

Scheduling jobs with varying parallelizability to reduce variance. - Anupam Gupta 001; Sungjin Im; Ravishankar Krishnaswamy; Benjamin Moseley; Kirk Pruhs (SPAA, 2010)

New Models and Algorithms for Throughput Maximization in Broadcast Scheduling - (Extended Abstract). - Chandra Chekuri; Avigdor Gal; Sungjin Im; Samir Khuller; Jian Li 015; Richard Matthew McCutchen; Benjamin Moseley; Louiqa Raschid (WAOA, 2010)

Fast clustering using MapReduce. - Alina Ene; Sungjin Im; Benjamin Moseley (KDD, 2011)

Online Scalable Scheduling for the ℓk-norms of Flow Time Without Conservation of Work. - Jeff Edmonds; Sungjin Im; Benjamin Moseley (SODA, 2011)

Online Scheduling on Identical Machines using SRPT. - Kyle Fox; Benjamin Moseley (SODA, 2011)

Online Scalable Algorithm for Minimizing ℓk-norms of Weighted Flow Time On Unrelated Machines. - Sungjin Im; Benjamin Moseley (SODA, 2011)

Filtering: a method for solving graph problems in MapReduce. - Silvio Lattanzi; Benjamin Moseley; Siddharth Suri; Sergei Vassilvitskii (SPAA, 2011)

On scheduling in map-reduce and flow-shops. - Benjamin Moseley; Anirban Dasgupta 001; Ravi Kumar 001; Tamás Sarlós (SPAA, 2011)

A tutorial on amortized local competitiveness in online scheduling. - Sungjin Im; Benjamin Moseley; Kirk Pruhs (SIGACT News, 2011)

Shortest-Elapsed-Time-First on a Multiprocessor. - Neal Barcelo; Sungjin Im; Benjamin Moseley; Kirk Pruhs (MedAlg, 2012)

Scheduling heterogeneous processors isn't as easy as you think. - Anupam Gupta 001; Sungjin Im; Ravishankar Krishnaswamy; Benjamin Moseley; Kirk Pruhs (SODA, 2012)

Handling forecast errors while bidding for display advertising. - Kevin J. Lang; Benjamin Moseley; Sergei Vassilvitskii (WWW, 2012)

Speed scaling for stretch plus energy. - Daniel Cole; Sungjin Im; Benjamin Moseley; Kirk Pruhs (Oper. Res. Lett., 2012)

Scalable K-Means++. - Bahman Bahmani; Benjamin Moseley; Andrea Vattani; Ravi Kumar 001; Sergei Vassilvitskii (Proc. VLDB Endow., 2012)

An online scalable algorithm for average flow time in broadcast scheduling. - Sungjin Im; Benjamin Moseley (ACM Trans. Algorithms, 2012)

Online Scheduling to Minimize Maximum Response Time and Maximum Delay Factor. - Chandra Chekuri; Sungjin Im; Benjamin Moseley (Theory Comput., 2012)

Online scheduling algorithms for broadcasting and general cost functions - Benjamin Moseley (2012)

Online Non-clairvoyant Scheduling to Simultaneously Minimize All Convex Functions. - Kyle Fox; Sungjin Im; Janardhan Kulkarni; Benjamin Moseley (APPROX-RANDOM, 2013)

Bargaining for Revenue Shares on Tree Trading Networks. - Arpita Ghosh; Satyen Kale; Kevin J. Lang; Benjamin Moseley (IJCAI, 2013)

The Complexity of Scheduling for p-Norms of Flow and Stretch - (Extended Abstract). - Benjamin Moseley; Kirk Pruhs; Cliff Stein 001 (IPCO, 2013)

Brief announcement: online batch scheduling for flow objectives. - Sungjin Im; Benjamin Moseley (SPAA, 2013)

The Complexity of Scheduling for p-norms of Flow and Stretch - Benjamin Moseley; Kirk Pruhs; Cliff Stein 001 (CoRR, 2013)

Packet Forwarding Algorithms in a Line Network. - Antonios Antoniadis 001; Neal Barcelo; Daniel Cole; Kyle Fox; Benjamin Moseley; Michael Nugent; Kirk Pruhs (LATIN, 2014)

New Approximations for Reordering Buffer Management. - Sungjin Im; Benjamin Moseley (SODA, 2014)

Online Scheduling with General Cost Functions. - Sungjin Im; Benjamin Moseley; Kirk Pruhs (SIAM J. Comput., 2014)

On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs. - Noa Avigdor-Elgrabli; Sungjin Im; Benjamin Moseley; Yuval Rabani (ICALP (1), 2015)

Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities. - Sungjin Im; Benjamin Moseley (ICALP (1), 2015)

k-Means Clustering on Two-Level Memory Systems. - Michael A. Bender; Jonathan W. Berry; Simon D. Hammond; Branden Moore; Benjamin Moseley; Cynthia A. Phillips (MEMSYS, 2015)

Fast Distributed k-Center Clustering with Outliers on Massive Data. - Gustavo Malkomes; Matt J. Kusner; Wenlin Chen; Kilian Q. Weinberger; Benjamin Moseley (NIPS, 2015)

A Dynamic Programming Framework for Non-Preemptive Scheduling Problems on Multiple Machines [Extended Abstract]. - Sungjin Im; Shi Li 001; Benjamin Moseley; Eric Torng (SODA, 2015)

Temporal Fairness of Round Robin: Competitive Analysis for Lk-norms of Flow Time. - Sungjin Im; Janardhan Kulkarni; Benjamin Moseley (SPAA, 2015)

Brief Announcement: Fast and Better Distributed MapReduce Algorithms for k-Center Clustering. - Sungjin Im; Benjamin Moseley (SPAA, 2015)

Scheduling in Bandwidth Constrained Tree Networks. - Sungjin Im; Benjamin Moseley (SPAA, 2015)

Stochastic Scheduling of Heavy-tailed Jobs. - Sungjin Im; Benjamin Moseley; Kirk Pruhs (STACS, 2015)

Scheduling to minimize energy and flow time in broadcast scheduling. - Benjamin Moseley (J. Sched., 2015)

Fast Greedy Algorithms in MapReduce and Streaming. - Ravi Kumar 001; Benjamin Moseley; Sergei Vassilvitskii; Andrea Vattani (ACM Trans. Parallel Comput., 2015)

A Competitive Flow Time Algorithm for Heterogeneous Clusters Under Polytope Constraints. - Sungjin Im; Janardhan Kulkarni; Benjamin Moseley; Kamesh Munagala (APPROX-RANDOM, 2016)

Partitioned Feasibility Tests for Sporadic Tasks on Heterogeneous Machines. - Shaurya Ahuja; Kefu Lu; Benjamin Moseley (IPDPS, 2016)

Scheduling Parallel DAG Jobs Online to Minimize Average Flow Time. - Kunal Agrawal 001; Jing Li 025; Kefu Lu; Benjamin Moseley (SODA, 2016)

Scheduling Parallelizable Jobs Online to Minimize the Maximum Flow Time. - Kunal Agrawal 001; Jing Li 025; Kefu Lu; Benjamin Moseley (SPAA, 2016)

General Profit Scheduling and the Power of Migration on Heterogeneous Machines. - Sungjin Im; Benjamin Moseley (SPAA, 2016)

New challenges in scheduling theory. - Jacek Blazewicz; Benjamin Moseley; Erwin Pesch; Denis Trystram; Guochuan Zhang (J. Sched., 2016)

Competitively Scheduling Tasks with Intermediate Parallelizability. - Sungjin Im; Benjamin Moseley; Kirk Pruhs; Eric Torng (ACM Trans. Parallel Comput., 2016)

Cooperative Set Function Optimization Without Communication or Coordination. - Gustavo Malkomes; Kefu Lu; Blakeley Hoffman; Roman Garnett; Benjamin Moseley; Richard P. Mann (AAMAS, 2017)

Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing. - Sungjin Im; Benjamin Moseley; Kirk Pruhs; Clifford Stein 001 (ESA, 2017)

Efficient Nonmyopic Active Search. - Shali Jiang 001; Gustavo Malkomes; Geoff Converse; Alyssa Shofner; Benjamin Moseley; Roman Garnett (ICML, 2017)

Stochastic Online Scheduling on Unrelated Machines. - Varun Gupta 004; Benjamin Moseley; Marc Uetz; Qiaomin Xie (IPCO, 2017)

Breaking 1 - 1/e Barrier for Non-preemptive Throughput Maximization. - Sungjin Im; Shi Li 001; Benjamin Moseley (IPCO, 2017)

An O(Log Log m)-Competitive Algorithm for Online Machine Minimization. - Sungjin Im; Benjamin Moseley; Kirk Pruhs; Clifford Stein 001 (RTSS, 2017)

Brief Announcement: Scheduling Parallelizable Jobs Online to Maximize Throughput. - Kunal Agrawal 001; Jing Li 025; Kefu Lu; Benjamin Moseley (SPAA, 2017)

Efficient massively parallel methods for dynamic programming. - Sungjin Im; Benjamin Moseley; Xiaorui Sun (STOC, 2017)

Two-level main memory co-design: Multi-threaded algorithmic primitives, analysis, and simulation. - Michael A. Bender; Jonathan W. Berry; Simon D. Hammond; K. Scott Hemmert; Samuel McCauley; Branden Moore; Benjamin Moseley; Cynthia A. Phillips; David S. Resnick; Arun Rodrigues (J. Parallel Distributed Comput., 2017)

Local Search Methods for k-Means with Outliers. - Shalmoli Gupta; Ravi Kumar 001; Kefu Lu; Benjamin Moseley; Sergei Vassilvitskii (Proc. VLDB Endow., 2017)

Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines. - Giorgio Lucarelli; Benjamin Moseley; Kim Thang Nguyen; Abhinav Srivastav; Denis Trystram (ESA, 2018)

Scheduling Parallelizable Jobs Online to Maximize Throughput. - Kunal Agrawal 001; Jing Li 025; Kefu Lu; Benjamin Moseley (LATIN, 2018)

Efficient nonmyopic batch active search. - Shali Jiang 001; Gustavo Malkomes; Matthew Abbott; Benjamin Moseley; Roman Garnett (NeurIPS, 2018)

Pre-Synaptic Pool Modification (PSPM): A Supervised Learning Procedure for Spiking Neural Networks. - Bryce Bagley; Blake Bordelon; Benjamin Moseley; Ralf Wessel (CoRR, 2018)

Efficient nonmyopic active search with applications in drug and materials discovery. - Shali Jiang 001; Gustavo Malkomes; Benjamin Moseley; Roman Garnett (CoRR, 2018)

Scheduling Parallel Jobs Online with Convex and Concave Parallelizability. - Roozbeh Ebrahimi; Samuel McCauley; Benjamin Moseley (Theory Comput. Syst., 2018)

Energy efficient scheduling of parallelizable jobs. - Kyle Fox; Sungjin Im; Benjamin Moseley (Theor. Comput. Sci., 2018)

Submodular Optimization with Contention Resolution Extensions. - Benjamin Moseley; Maxim Sviridenko (APPROX-RANDOM, 2019)

Online Non-Preemptive Scheduling to Minimize Maximum Weighted Flow-Time on Related Machines. - Giorgio Lucarelli; Benjamin Moseley; Kim Thang Nguyen; Abhinav Srivastav; Denis Trystram (FSTTCS, 2019)

Matroid Coflow Scheduling. - Sungjin Im; Benjamin Moseley; Kirk Pruhs; Manish Purohit (ICALP, 2019)

Scheduling to Approximate Minimization Objectives on Identical Machines. - Benjamin Moseley (ICALP, 2019)

Practically Efficient Scheduler for Minimizing Average Flow Time of Parallel Jobs. - Kunal Agrawal 001; I-Ting Angelina Lee; Jing Li 025; Kefu Lu; Benjamin Moseley (IPDPS, 2019)

Backprop with Approximate Activations for Memory-efficient Network Training. - Ayan Chakrabarti; Benjamin Moseley (NeurIPS, 2019)

Cost Effective Active Search. - Shali Jiang 001; Roman Garnett; Benjamin Moseley (NeurIPS, 2019)

A Framework for Parallelizing Hierarchical Clustering Methods. - Silvio Lattanzi; Thomas Lavastida; Kefu Lu; Benjamin Moseley (ECML/PKDD (1), 2019)

Non-clairvoyantly Scheduling to Minimize Convex Functions. - Kyle Fox; Sungjin Im; Janardhan Kulkarni; Benjamin Moseley (Algorithmica, 2019)

A Conditional Lower Bound on Graph Connectivity in MapReduce. - Sungjin Im; Benjamin Moseley (CoRR, 2019)

On Coresets for Regularized Loss Minimization. - Ryan R. Curtin; Sungjin Im; Benjamin Moseley; Kirk Pruhs; Alireza Samadian (CoRR, 2019)

An Objective for Hierarchical Clustering in Euclidean Space and Its Connection to Bisecting K-means. - Yuyan Wang; Benjamin Moseley (AAAI, 2020)

Rk-means: Fast Clustering for Relational Data. - Ryan R. Curtin; Benjamin Moseley; Hung Q. Ngo 001; XuanLong Nguyen; Dan Olteanu; Maximilian Schleich (AISTATS, 2020)

Fast Noise Removal for k-Means Clustering. - Sungjin Im; Mahshid Montazer Qaem; Benjamin Moseley; Xiaorui Sun; Rudy Zhou (AISTATS, 2020)

Unconditional Coresets for Regularized Loss Minimization. - Alireza Samadian; Kirk Pruhs; Benjamin Moseley; Sungjin Im; Ryan R. Curtin (AISTATS, 2020)

Scheduling for Weighted Flow and Completion Times in Reconfigurable Networks. - Michael Dinitz; Benjamin Moseley (INFOCOM, 2020)

A Scheduling Approach to Incremental Maintenance of Datalog Programs. - Shikha Singh 002; Sergey Madaminov; Michael A. Bender; Michael Ferdman; Ryan Johnson; Benjamin Moseley; Hung Q. Ngo 001; Dung Nguyen; Soeren Olesen; Kurt Stirewalt; Geoffrey Washburn (IPDPS, 2020)

Fair Hierarchical Clustering. - Sara Ahmadian; Alessandro Epasto; Marina Knittel; Ravi Kumar 001; Mohammad Mahdian; Benjamin Moseley; Philip Pham; Sergei Vassilvitskii; Yuyan Wang (NeurIPS, 2020)

Online Scheduling via Learned Weights. - Silvio Lattanzi; Thomas Lavastida; Benjamin Moseley; Sergei Vassilvitskii (SODA, 2020)

Optimal Resource Allocation for Elastic and Inelastic Jobs. - Benjamin Berg; Mor Harchol-Balter; Benjamin Moseley; Weina Wang 001; Justin Whitehouse (SPAA, 2020)

How to Manage High-Bandwidth Memory Automatically. - Rathish Das; Kunal Agrawal 001; Michael A. Bender; Jonathan W. Berry; Benjamin Moseley; Cynthia A. Phillips (SPAA, 2020)

Symmetric Linear Programming Formulations for Minimum Cut with Applications to TSP. - Robert D. Carr; Jennifer Iglesias; Giuseppe Lancia; Benjamin Moseley (CoRR, 2020)

Greed Works - Online Algorithms for Unrelated Machine Stochastic Scheduling. - Varun Gupta 004; Benjamin Moseley; Marc Uetz; Qiaomin Xie (Math. Oper. Res., 2020)

Dynamic Weighted Fairness with Minimal Disruptions. - Sungjin Im; Benjamin Moseley; Kamesh Munagala; Kirk Pruhs (Proc. ACM Meas. Anal. Comput. Syst., 2020)

Hallucination Helps: Energy Efficient Virtual Circuit Routing. - Antonios Antoniadis 001; Sungjin Im; Ravishankar Krishnaswamy; Benjamin Moseley; Viswanath Nagarajan; Kirk Pruhs; Clifford Stein 001 (SIAM J. Comput., 2020)

Fair Scheduling via Iterative Quasi-Uniform Sampling. - Sungjin Im; Benjamin Moseley (SIAM J. Comput., 2020)

Breaking 1 - 1/e Barrier for Nonpreemptive Throughput Maximization. - Sungjin Im; Shi Li 001; Benjamin Moseley (SIAM J. Discret. Math., 2020)

Functional Aggregate Queries with Additive Inequalities. - Mahmoud Abo Khamis; Ryan R. Curtin; Benjamin Moseley; Hung Q. Ngo 001; XuanLong Nguyen; Dan Olteanu; Maximilian Schleich (ACM Trans. Database Syst., 2020)

Using Predicted Weights for Ad Delivery. - Thomas Lavastida; Benjamin Moseley; R. Ravi 001; Chenyang Xu 002 (ACDA, 2021)

Scaling Average-Linkage via Sparse Cluster Embeddings. - Thomas Lavastida; Kefu Lu; Benjamin Moseley; Yuyan Wang (ACML, 2021)

Hierarchical Clustering in General Metric Spaces using Approximate Nearest Neighbors. - Benjamin Moseley; Sergei Vassilvitskii; Yuyan Wang (AISTATS, 2021)

Approximate Aggregate Queries Under Additive Inequalities. - Mahmoud Abo Khamis; Sungjin Im; Benjamin Moseley; Kirk Pruhs; Alireza Samadian (APOCS, 2021)

A Relational Gradient Descent Algorithm For Support Vector Machine Training. - Mahmoud Abo Khamis; Sungjin Im; Benjamin Moseley; Kirk Pruhs; Alireza Samadian (APOCS, 2021)

Learnable and Instance-Robust Predictions for Online Matching, Flows and Load Balancing. - Thomas Lavastida; Benjamin Moseley; R. Ravi 001; Chenyang Xu 002 (ESA, 2021)

An Efficient Reduction of a Gammoid to a Partition Matroid. - Marilena Leichter; Benjamin Moseley; Kirk Pruhs (ESA, 2021)

A Scalable Approximation Algorithm for Weighted Longest Common Subsequence. - Jeremy Buhler; Thomas Lavastida; Kefu Lu; Benjamin Moseley (Euro-Par, 2021)

Relational Algorithms for k-Means Clustering. - Benjamin Moseley; Kirk Pruhs; Alireza Samadian; Yuyan Wang (ICALP, 2021)

Instance Optimal Join Size Estimation. - Mahmoud Abo Khamis; Sungjin Im; Benjamin Moseley; Kirk Pruhs; Alireza Samadian (LAGOS, 2021)

An Approximation Algorithm for the Matrix Tree Multiplication Problem. - Mahmoud Abo Khamis; Ryan R. Curtin; Sungjin Im; Benjamin Moseley; Hung Q. Ngo 001; Kirk Pruhs; Alireza Samadian (MFCS, 2021)

Faster Matchings via Learned Duals. - Michael Dinitz; Sungjin Im; Thomas Lavastida; Benjamin Moseley; Sergei Vassilvitskii (NeurIPS, 2021)

Robust Online Correlation Clustering. - Silvio Lattanzi; Benjamin Moseley; Sergei Vassilvitskii; Yuyan Wang; Rudy Zhou (NeurIPS, 2021)

A Competitive Algorithm for Throughout Maximization on Identical Machines. - Benjamin Moseley; Kirk Pruhs; Clifford Stein 001; Rudy Zhou (CoRR, 2021)

Corrigendum: Greed Works - Online Algorithms for Unrelated Machine Stochastic Scheduling. - Varun Gupta 004; Benjamin Moseley; Marc Uetz; Qiaomin Xie (Math. Oper. Res., 2021)

The matroid intersection cover problem. - Sungjin Im; Benjamin Moseley; Kirk Pruhs (Oper. Res. Lett., 2021)

The Matroid Cup Game. - Sungjin Im; Benjamin Moseley; Rudy Zhou (Oper. Res. Lett., 2021)

New Perspectives in Scheduling Theory. - Jacek Blazewicz; Benjamin Moseley; Erwin Pesch; Denis Trystram; Guochuan Zhang (J. Sched., 2021)

Online Non-preemptive Scheduling on Unrelated Machines with Rejections. - Giorgio Lucarelli; Benjamin Moseley; Kim Thang Nguyen; Abhinav Srivastav; Denis Trystram (ACM Trans. Parallel Comput., 2021)

Learning-Augmented Algorithms for Online Steiner Tree. - Chenyang Xu 002; Benjamin Moseley (AAAI, 2022)

Algorithms with Prediction Portfolios. - Michael Dinitz; Sungjin Im; Thomas Lavastida; Benjamin Moseley; Sergei Vassilvitskii (NeurIPS, 2022)

Automatic HBM Management: Models and Algorithms. - Daniel DeLayo; Kenny Zhang; Kunal Agrawal 001; Michael A. Bender; Jonathan W. Berry; Rathish Das; Benjamin Moseley; Cynthia A. Phillips (SPAA, 2022)

Optimizing Polymatroid Functions. - Sungjin Im; Benjamin Moseley; Hung Q. Ngo 001; Kirk Pruhs; Alireza Samadian (CoRR, 2022)

On the impossibility of decomposing binary matroids. - Marilena Leichter; Benjamin Moseley; Kirk Pruhs (Oper. Res. Lett., 2022)

The efficiency-fairness balance of Round Robin scheduling. - Benjamin Moseley; Shai Vardi (Oper. Res. Lett., 2022)

The case for phase-aware scheduling of parallelizable jobs. - Benjamin Berg; Justin Whitehouse; Benjamin Moseley; Weina Wang 001; Mor Harchol-Balter (Perform. Evaluation, 2022)

Online scheduling of parallelizable jobs in the directed acyclic graphs and speed-up curves models. - Benjamin Moseley; Ruilong Zhang 001; Shanjiawen Zhao (Theor. Comput. Sci., 2022)

Min-Max Submodular Ranking for Multiple Agents. - Qingyun Chen; Sungjin Im; Benjamin Moseley; Chenyang Xu 002; Ruilong Zhang 001 (AAAI, 2023)

Fast Combinatorial Algorithms for Min Max Correlation Clustering. - Sami Davies; Benjamin Moseley; Heather Newman (ICML, 2023)

Predictive Flows for Faster Ford-Fulkerson. - Sami Davies; Benjamin Moseley; Sergei Vassilvitskii; Yuyan Wang (ICML, 2023)

Online Dynamic Acknowledgement with Learned Predictions. - Sungjin Im; Benjamin Moseley; Chenyang Xu 002; Ruilong Zhang 001 (INFOCOM, 2023)

Online List Labeling with Predictions. - Samuel McCauley; Benjamin Moseley; Aidin Niaparast; Shikha Singh 002 (NeurIPS, 2023)

Online State Exploration: Competitive Worst Case and Learning-Augmented Algorithms. - Sungjin Im; Benjamin Moseley; Chenyang Xu 002; Ruilong Zhang 001 (ECML/PKDD (4), 2023)

Minimizing Completion Times for Stochastic Jobs via Batched Free Times. - Anupam Gupta 001; Benjamin Moseley; Rudy Zhou (SODA, 2023)

One Partition Approximating All 𝓁p-norm Objectives in Correlation Clustering. - Sami Davies; Benjamin Moseley; Heather Newman (CoRR, 2023)

On the Convergence Rate of Linear Datalogo over Stable Semirings. - Sungjin Im; Benjamin Moseley; Hung Q. Ngo 001; Kirk Pruhs (CoRR, 2023)

Massively Parallel Computation: Algorithms and Applications. - Sungjin Im; Ravi Kumar 001; Silvio Lattanzi; Benjamin Moseley; Sergei Vassilvitskii (Found. Trends Optim., 2023)

Approximation Bounds for Hierarchical Clustering: Average Linkage, Bisecting K-means, and Local Search. - Benjamin Moseley; Joshua R. Wang (J. Mach. Learn. Res., 2023)

Scheduling (Dagstuhl Seminar 23061). - Nicole Megow; Benjamin Moseley; David B. Shmoys; Ola Svensson; Sergei Vassilvitskii; Jens Schlöter (Dagstuhl Reports, 2023)

Mathematical challenges in scheduling theory. - Jacek Blazewicz; Benjamin Moseley; Erwin Pesch; Denis Trystram; Guochuan Zhang (J. Sched., 2023)

Sampling for Beyond-Worst-Case Online Ranking. - Qingyun Chen; Sungjin Im; Benjamin Moseley; Chenyang Xu 002; Ruilong Zhang 001 (AAAI, 2024)

Online k-Median with Consistent Clusters. - Benjamin Moseley; Heather Newman; Kirk Pruhs (APPROX/RANDOM, 2024)

Simultaneously Approximating All 𝓁p-Norms in Correlation Clustering. - Sami Davies; Benjamin Moseley; Heather Newman (ICALP, 2024)

On the Convergence Rate of Linear Datalog ^∘ over Stable Semirings. - Sungjin Im; Benjamin Moseley; Hung Q. Ngo 001; Kirk Pruhs (ICDT, 2024)

Incremental Topological Ordering and Cycle Detection with Predictions. - Samuel McCauley; Benjamin Moseley; Aidin Niaparast; Shikha Singh 002 (ICML, 2024)

Binary Search with Distributional Predictions. - Michael Dinitz; Sungjin Im; Thomas Lavastida; Benjamin Moseley; Aidin Niaparast; Sergei Vassilvitskii (NeurIPS, 2024)

Controlling Tail Risk in Online Ski-Rental. - Michael Dinitz; Sungjin Im; Thomas Lavastida; Benjamin Moseley; Sergei Vassilvitskii (SODA, 2024)

The Public University Secretary Problem. - Benjamin Moseley; Heather Newman; Kirk Pruhs (SOSA, 2024)

Scheduling Out-Trees Online to Optimize Maximum Flow. - Kunal Agrawal 001; Benjamin Moseley; Heather Newman; Kirk Pruhs (SPAA, 2024)

Best of Many in Both Worlds: Online Resource Allocation with Predictions under Unknown Arrival Model. - Lin An; Andrew A. Li; Benjamin Moseley; Gabriel Visotsky (CoRR, 2024)

Asymptotically Optimal Scheduling of Multiple Parallelizable Job Classes. - Benjamin Berg; Benjamin Moseley; Weina Wang 001; Mor Harchol-Balter (CoRR, 2024)

A competitive algorithm for throughput maximization on identical machines. - Benjamin Moseley; Kirk Pruhs; Clifford Stein 001; Rudy Zhou (Math. Program., 2024)

Polynomial Time Convergence of the Iterative Evaluation of Datalogo Programs. - Sungjin Im; Benjamin Moseley; Hung Q. Ngo 001; Kirk Pruhs (Proc. ACM Manag. Data, 2024)

Incremental Approximate Single-Source Shortest Paths with Predictions. - Samuel McCauley; Benjamin Moseley; Aidin Niaparast; Helia Niaparast; Shikha Singh 002 (ICALP, 2025)

Robust Gittins for Stochastic Scheduling. - Benjamin Moseley; Heather Newman; Kirk Pruhs; Rudy Zhou (SIGMETRICS (Abstracts), 2025)

Putting Off the Catching Up: Online Joint Replenishment Problem with Holding and Backlog Costs. - Benjamin Moseley; Aidin Niaparast; R. Ravi 001 (SODA, 2025)

Managing High-Bandwidth Memory is a Parallel Scheduling Problem (full paper only). - Kunal Agrawal 001; Michael A. Bender; Kirk Pruhs; Benjamin Moseley; Clifford Stein 001 (SPAA, 2025)

The Nonstationary Newsvendor with (and Without) Predictions. - Lin An; Andrew A. Li; Benjamin Moseley; R. Ravi 001 (Manuf. Serv. Oper. Manag., 2025)

Faster Global Minimum Cut with Predictions. - Benjamin Moseley; Helia Niaparast; Karan Singh (CoRR, 2025)

Configuration balancing for stochastic requests. - Franziska Eberle; Anupam Gupta 001; Nicole Megow; Benjamin Moseley; Rudy Zhou (Math. Program., 2025)

Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints. - Sungjin Im; Benjamin Moseley; Hung Q. Ngo 001; Kirk Pruhs (Proc. ACM Manag. Data, 2025)

Structural iterative rounding for generalized k-median problems. - Anupam Gupta 001; Benjamin Moseley; Rudy Zhou (Math. Program., 2025)

Competitive Online Transportation Simplified. - Stephen Arndt; Benjamin Moseley; Kirk Pruhs; Marc Uetz (CoRR, 2025)