Benjamin Moseley

According to our database1, Benjamin Moseley authored at least 67 papers between 2009 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
On Functional Aggregate Queries with Additive Inequalities.
Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019

Scheduling to Approximate Minimization Objectives on Identical Machines.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Matroid Coflow Scheduling.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
New challenges in scheduling theory.
J. Scheduling, 2018

Online Non-preemptive Scheduling on Unrelated Machines with Rejections.
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Efficient nonmyopic batch active search.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Scheduling Parallelizable Jobs Online to Maximize Throughput.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017
Local Search Methods for k-Means with Outliers.
PVLDB, 2017

Efficient massively parallel methods for dynamic programming.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Brief Announcement: Scheduling Parallelizable Jobs Online to Maximize Throughput.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

Fair Scheduling via Iterative Quasi-Uniform Sampling.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

An O(Log Log m)-Competitive Algorithm for Online Machine Minimization.
Proceedings of the 2017 IEEE Real-Time Systems Symposium, 2017

Approximation Bounds for Hierarchical Clustering: Average Linkage, Bisecting K-means, and Local Search.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Breaking 1 - 1/e Barrier for Non-preemptive Throughput Maximization.
Proceedings of the Integer Programming and Combinatorial Optimization, 2017

Stochastic Online Scheduling on Unrelated Machines.
Proceedings of the Integer Programming and Combinatorial Optimization, 2017

Efficient Nonmyopic Active Search.
Proceedings of the 34th International Conference on Machine Learning, 2017

Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

Cooperative Set Function Optimization Without Communication or Coordination.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

2016
New challenges in scheduling theory.
J. Scheduling, 2016

General Profit Scheduling and the Power of Migration on Heterogeneous Machines.
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Scheduling Parallelizable Jobs Online to Minimize the Maximum Flow Time.
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Scheduling Parallel DAG Jobs Online to Minimize Average Flow Time.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Partitioned Feasibility Tests for Sporadic Tasks on Heterogeneous Machines.
Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium, 2016

A Competitive Flow Time Algorithm for Heterogeneous Clusters Under Polytope Constraints.
Proceedings of the Approximation, 2016

2015
Scheduling to minimize energy and flow time in broadcast scheduling.
J. Scheduling, 2015

Scheduling Parallel Jobs Online with Convex and Concave Parallelizability.
Proceedings of the Approximation and Online Algorithms - 13th International Workshop, 2015

Stochastic Scheduling of Heavy-tailed Jobs.
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

Scheduling in Bandwidth Constrained Tree Networks.
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Brief Announcement: Fast and Better Distributed MapReduce Algorithms for k-Center Clustering.
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Temporal Fairness of Round Robin: Competitive Analysis for Lk-norms of Flow Time.
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

A Dynamic Programming Framework for Non-Preemptive Scheduling Problems on Multiple Machines [Extended Abstract].
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Fast Distributed k-Center Clustering with Outliers on Massive Data.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

k-Means Clustering on Two-Level Memory Systems.
Proceedings of the 2015 International Symposium on Memory Systems, 2015

Two-Level Main Memory Co-Design: Multi-threaded Algorithmic Primitives, Analysis, and Simulation.
Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium, 2015

Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014
Competitively scheduling tasks with intermediate parallelizability.
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

New Approximations for Reordering Buffer Management.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Hallucination Helps: Energy Efficient Virtual Circuit Routing.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Packet Forwarding Algorithms in a Line Network.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

2013
Fast greedy algorithms in mapreduce and streaming.
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

Brief announcement: online batch scheduling for flow objectives.
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

Energy Efficient Scheduling of Parallelizable Jobs.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

The Complexity of Scheduling for p-Norms of Flow and Stretch - (Extended Abstract).
Proceedings of the Integer Programming and Combinatorial Optimization, 2013

Bargaining for Revenue Shares on Tree Trading Networks.
Proceedings of the IJCAI 2013, 2013

Online Non-clairvoyant Scheduling to Simultaneously Minimize All Convex Functions.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012
Online Scheduling to Minimize Maximum Response Time and Maximum Delay Factor.
Theory of Computing, 2012

Scalable K-Means++.
PVLDB, 2012

Speed scaling for stretch plus energy.
Oper. Res. Lett., 2012

Handling forecast errors while bidding for display advertising.
Proceedings of the 21st World Wide Web Conference 2012, 2012

Online scheduling with general cost functions.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Scheduling heterogeneous processors isn't as easy as you think.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Shortest-Elapsed-Time-First on a Multiprocessor.
Proceedings of the Design and Analysis of Algorithms, 2012

2011
A tutorial on amortized local competitiveness in online scheduling.
SIGACT News, 2011

On scheduling in map-reduce and flow-shops.
Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

Filtering: a method for solving graph problems in MapReduce.
Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

Online Scalable Algorithm for Minimizing ℓk-norms of Weighted Flow Time On Unrelated Machines.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Online Scheduling on Identical Machines using SRPT.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Online Scalable Scheduling for the ℓk-norms of Flow Time Without Conservation of Work.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Fast clustering using MapReduce.
Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2011

2010
New Models and Algorithms for Throughput Maximization in Broadcast Scheduling - (Extended Abstract).
Proceedings of the Approximation and Online Algorithms - 8th International Workshop, 2010

Scheduling jobs with varying parallelizability to reduce variance.
Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

An Online Scalable Algorithm for Average Flow Time in Broadcast Scheduling.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009
Longest Wait First for Broadcast Scheduling [Extended Abstract].
Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009

Online scheduling to minimize the maximum delay factor.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling.
Proceedings of the Algorithms, 2009


  Loading...