Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarBenjamin Moseley
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2018
[j14]Roozbeh Ebrahimi, Samuel McCauley, Benjamin Moseley:
Scheduling Parallel Jobs Online with Convex and Concave Parallelizability. Theory Comput. Syst. 62(2): 304-318 (2018)- [j13]Kyle Fox, Sungjin Im, Benjamin Moseley:
Energy efficient scheduling of parallelizable jobs. Theor. Comput. Sci. 726: 30-40 (2018) - [c54]Kunal Agrawal, Jing Li, Kefu Lu, Benjamin Moseley:
Scheduling Parallelizable Jobs Online to Maximize Throughput. LATIN 2018: 755-776 - [c53]Giorgio Lucarelli, Benjamin Moseley, Nguyen Kim Thang, Abhinav Srivastav, Denis Trystram:
Online Non-preemptive Scheduling on Unrelated Machines with Rejections. SPAA 2018: 291-300 - [i13]Giorgio Lucarelli, Benjamin Moseley, Nguyen Kim Thang, Abhinav Srivastav, Denis Trystram:
Online Non-preemptive Scheduling on Unrelated Machines with Rejections. CoRR abs/1802.10309 (2018) - [i12]Giorgio Lucarelli, Benjamin Moseley, Nguyen Kim Thang, Abhinav Srivastav, Denis Trystram:
Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines. CoRR abs/1804.08317 (2018) - 2017
- [j12]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:
Two-level main memory co-design: Multi-threaded algorithmic primitives, analysis, and simulation. J. Parallel Distrib. Comput. 102: 213-228 (2017) - [j11]Shalmoli Gupta, Ravi Kumar, Kefu Lu, Benjamin Moseley, Sergei Vassilvitskii:
Local Search Methods for k-Means with Outliers. PVLDB 10(7): 757-768 (2017) - [c52]Gustavo Malkomes, Kefu Lu, Blakeley Hoffman, Roman Garnett, Benjamin Moseley, Richard P. Mann:
Cooperative Set Function Optimization Without Communication or Coordination. AAMAS 2017: 1109-1118 - [c51]Sungjin Im, Benjamin Moseley, Kirk Pruhs, Clifford Stein:
Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing. ESA 2017: 51:1-51:10 - [c50]Shali Jiang, Gustavo Malkomes, Geoff Converse, Alyssa Shofner, Benjamin Moseley, Roman Garnett:
Efficient Nonmyopic Active Search. ICML 2017: 1714-1723 - [c49]Varun Gupta, Benjamin Moseley, Marc Uetz, Qiaomin Xie:
Stochastic Online Scheduling on Unrelated Machines. IPCO 2017: 228-240 - [c48]Sungjin Im, Shi Li, Benjamin Moseley:
Breaking 1 - 1/e Barrier for Non-preemptive Throughput Maximization. IPCO 2017: 292-304 - [c47]Benjamin Moseley, Joshua Wang:
Approximation Bounds for Hierarchical Clustering: Average Linkage, Bisecting K-means, and Local Search. NIPS 2017: 3097-3106 - [c46]Sungjin Im, Benjamin Moseley, Kirk Pruhs, Clifford Stein:
An O(Log Log m)-Competitive Algorithm for Online Machine Minimization. RTSS 2017: 343-350 - [c45]Sungjin Im, Benjamin Moseley:
Fair Scheduling via Iterative Quasi-Uniform Sampling. SODA 2017: 2601-2615 - [c44]Kunal Agrawal, Jing Li, Kefu Lu, Benjamin Moseley:
Brief Announcement: Scheduling Parallelizable Jobs Online to Maximize Throughput. SPAA 2017: 87-89 - [c43]Sungjin Im, Benjamin Moseley, Xiaorui Sun:
Efficient massively parallel methods for dynamic programming. STOC 2017: 798-811 - [i11]Varun Gupta, Benjamin Moseley, Marc Uetz, Qiaomin Xie:
Stochastic Online Scheduling on Unrelated Machines. CoRR abs/1703.01634 (2017) - [i10]Sungjin Im, Benjamin Moseley, Kirk Pruhs, Clifford Stein:
An O(log log m)-competitive Algorithm for Online Machine Minimization. CoRR abs/1708.09046 (2017) - 2016
- [j10]Jacek Blazewicz, Benjamin Moseley, Erwin Pesch, Denis Trystram, Guochuan Zhang:
New challenges in scheduling theory. J. Scheduling 19(6): 617-618 (2016) - [j9]Sungjin Im, Benjamin Moseley, Kirk Pruhs, Eric Torng:
Competitively Scheduling Tasks with Intermediate Parallelizability. TOPC 3(1): 4:1-4:19 (2016) - [c42]Sungjin Im, Janardhan Kulkarni, Benjamin Moseley, Kamesh Munagala:
A Competitive Flow Time Algorithm for Heterogeneous Clusters Under Polytope Constraints. APPROX-RANDOM 2016: 10:1-10:15 - [c41]Shaurya Ahuja, Kefu Lu, Benjamin Moseley:
Partitioned Feasibility Tests for Sporadic Tasks on Heterogeneous Machines. IPDPS 2016: 1013-1020 - [c40]Kunal Agrawal, Jing Li, Kefu Lu, Benjamin Moseley:
Scheduling Parallel DAG Jobs Online to Minimize Average Flow Time. SODA 2016: 176-189 - [c39]Sungjin Im, Benjamin Moseley:
General Profit Scheduling and the Power of Migration on Heterogeneous Machines. SPAA 2016: 165-173 - [c38]Kunal Agrawal, Jing Li, Kefu Lu, Benjamin Moseley:
Scheduling Parallelizable Jobs Online to Minimize the Maximum Flow Time. SPAA 2016: 195-205 - 2015
- [j8]Benjamin Moseley:
Scheduling to minimize energy and flow time in broadcast scheduling. J. Scheduling 18(1): 107-118 (2015) - [j7]Ravi Kumar, Benjamin Moseley, Sergei Vassilvitskii, Andrea Vattani:
Fast Greedy Algorithms in MapReduce and Streaming. TOPC 2(3): 14:1-14:22 (2015) - [c37]Noa Avigdor-Elgrabli, Sungjin Im, Benjamin Moseley, Yuval Rabani:
On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs. ICALP (1) 2015: 78-90 - [c36]Sungjin Im, Benjamin Moseley:
Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities. ICALP (1) 2015: 737-748 - [c35]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:
Two-Level Main Memory Co-Design: Multi-threaded Algorithmic Primitives, Analysis, and Simulation. IPDPS 2015: 835-846 - [c34]Michael A. Bender, Jonathan W. Berry, Simon D. Hammond, Branden Moore, Benjamin Moseley, Cynthia A. Phillips:
k-Means Clustering on Two-Level Memory Systems. MEMSYS 2015: 197-205 - [c33]Gustavo Malkomes, Matt J. Kusner, Wenlin Chen, Kilian Q. Weinberger, Benjamin Moseley:
Fast Distributed k-Center Clustering with Outliers on Massive Data. NIPS 2015: 1063-1071 - [c32]Sungjin Im, Shi Li, Benjamin Moseley, Eric Torng:
A Dynamic Programming Framework for Non-Preemptive Scheduling Problems on Multiple Machines [Extended Abstract]. SODA 2015: 1070-1086 - [c31]Sungjin Im, Benjamin Moseley:
Brief Announcement: Fast and Better Distributed MapReduce Algorithms for k-Center Clustering. SPAA 2015: 65-67 - [c30]Sungjin Im, Janardhan Kulkarni, Benjamin Moseley:
Temporal Fairness of Round Robin: Competitive Analysis for Lk-norms of Flow Time. SPAA 2015: 155-160 - [c29]
- [c28]Sungjin Im, Benjamin Moseley, Kirk Pruhs:
Stochastic Scheduling of Heavy-tailed Jobs. STACS 2015: 474-486 - [c27]Roozbeh Ebrahimi, Samuel McCauley, Benjamin Moseley:
Scheduling Parallel Jobs Online with Convex and Concave Parallelizability. WAOA 2015: 183-195 - 2014
- [j6]Sungjin Im, Benjamin Moseley, Kirk Pruhs:
Online Scheduling with General Cost Functions. SIAM J. Comput. 43(1): 126-143 (2014) - [c26]Antonios Antoniadis, Neal Barcelo, Daniel Cole, Kyle Fox, Benjamin Moseley, Michael Nugent, Kirk Pruhs:
Packet Forwarding Algorithms in a Line Network. LATIN 2014: 610-621 - [c25]Sungjin Im, Benjamin Moseley:
New Approximations for Reordering Buffer Management. SODA 2014: 1093-1111 - [c24]Antonios Antoniadis, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein:
Hallucination Helps: Energy Efficient Virtual Circuit Routing. SODA 2014: 1141-1153 - [c23]Sungjin Im, Benjamin Moseley, Kirk Pruhs, Eric Torng:
Competitively scheduling tasks with intermediate parallelizability. SPAA 2014: 22-29 - 2013
- [c22]Kyle Fox, Sungjin Im, Janardhan Kulkarni, Benjamin Moseley:
Online Non-clairvoyant Scheduling to Simultaneously Minimize All Convex Functions. APPROX-RANDOM 2013: 142-157 - [c21]Arpita Ghosh, Satyen Kale, Kevin J. Lang, Benjamin Moseley:
Bargaining for Revenue Shares on Tree Trading Networks. IJCAI 2013: 129-135 - [c20]Benjamin Moseley, Kirk Pruhs, Cliff Stein:
The Complexity of Scheduling for p-Norms of Flow and Stretch - (Extended Abstract). IPCO 2013: 278-289 - [c19]Kyle Fox, Sungjin Im, Benjamin Moseley:
Energy Efficient Scheduling of Parallelizable Jobs. SODA 2013: 948-957 - [c18]Ravi Kumar, Benjamin Moseley, Sergei Vassilvitskii, Andrea Vattani:
Fast greedy algorithms in mapreduce and streaming. SPAA 2013: 1-10 - [c17]Sungjin Im, Benjamin Moseley:
Brief announcement: online batch scheduling for flow objectives. SPAA 2013: 102-104 - [i9]Benjamin Moseley, Kirk Pruhs, Cliff Stein:
The Complexity of Scheduling for p-norms of Flow and Stretch. CoRR abs/1301.0793 (2013) - [i8]Arpita Ghosh, Satyen Kale, Kevin J. Lang, Benjamin Moseley:
Bargaining for Revenue Shares on Tree Trading Networks. CoRR abs/1304.5822 (2013) - 2012
- [j5]Daniel Cole, Sungjin Im, Benjamin Moseley, Kirk Pruhs:
Speed scaling for stretch plus energy. Oper. Res. Lett. 40(3): 180-184 (2012) - [j4]Bahman Bahmani, Benjamin Moseley, Andrea Vattani, Ravi Kumar, Sergei Vassilvitskii:
Scalable K-Means++. PVLDB 5(7): 622-633 (2012) - [j3]Sungjin Im, Benjamin Moseley:
An online scalable algorithm for average flow time in broadcast scheduling. ACM Trans. Algorithms 8(4): 39:1-39:17 (2012) - [j2]Chandra Chekuri, Sungjin Im, Benjamin Moseley:
Online Scheduling to Minimize Maximum Response Time and Maximum Delay Factor. Theory of Computing 8(1): 165-195 (2012) - [c16]Neal Barcelo, Sungjin Im, Benjamin Moseley, Kirk Pruhs:
Shortest-Elapsed-Time-First on a Multiprocessor. MedAlg 2012: 82-92 - [c15]Anupam Gupta, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Kirk Pruhs:
Scheduling heterogeneous processors isn't as easy as you think. SODA 2012: 1242-1253 - [c14]Sungjin Im, Benjamin Moseley, Kirk Pruhs:
Online scheduling with general cost functions. SODA 2012: 1254-1265 - [c13]Kevin J. Lang, Benjamin Moseley, Sergei Vassilvitskii:
Handling forecast errors while bidding for display advertising. WWW 2012: 371-380 - [i7]Bahman Bahmani, Benjamin Moseley, Andrea Vattani, Ravi Kumar, Sergei Vassilvitskii:
Scalable K-Means++. CoRR abs/1203.6402 (2012) - 2011
- [j1]Sungjin Im, Benjamin Moseley, Kirk Pruhs:
A tutorial on amortized local competitiveness in online scheduling. SIGACT News 42(2): 83-97 (2011) - [c12]
- [c11]Sungjin Im, Benjamin Moseley:
Online Scalable Algorithm for Minimizing ℓk-norms of Weighted Flow Time On Unrelated Machines. SODA 2011: 95-108 - [c10]Jeff Edmonds, Sungjin Im, Benjamin Moseley:
Online Scalable Scheduling for the ℓk-norms of Flow Time Without Conservation of Work. SODA 2011: 109-119 - [c9]
- [c8]Silvio Lattanzi, Benjamin Moseley, Siddharth Suri, Sergei Vassilvitskii:
Filtering: a method for solving graph problems in MapReduce. SPAA 2011: 85-94 - [c7]Benjamin Moseley, Anirban Dasgupta, Ravi Kumar, Tamás Sarlós:
On scheduling in map-reduce and flow-shops. SPAA 2011: 289-298 - [i6]
- 2010
- [c6]Sungjin Im, Benjamin Moseley:
An Online Scalable Algorithm for Average Flow Time in Broadcast Scheduling. SODA 2010: 1322-1333 - [c5]Anupam Gupta, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Kirk Pruhs:
Scheduling jobs with varying parallelizability to reduce variance. SPAA 2010: 11-20 - [c4]Chandra Chekuri, Avigdor Gal, Sungjin Im, Samir Khuller, Jian Li, Richard Matthew McCutchen, Benjamin Moseley, Louiqa Raschid:
New Models and Algorithms for Throughput Maximization in Broadcast Scheduling - (Extended Abstract). WAOA 2010: 71-82 - [i5]Benjamin Moseley:
Scheduling to Minimize Energy and Flow Time in Broadcast Scheduling. CoRR abs/1007.3747 (2010) - [i4]Kyle Fox, Benjamin Moseley:
Online Scheduling on Identical Machines using SRPT. CoRR abs/1011.2187 (2010)
2000 – 2009
- 2009
- [c3]Chandra Chekuri, Sungjin Im, Benjamin Moseley:
Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling. ESA 2009: 444-455 - [c2]Chandra Chekuri, Benjamin Moseley:
Online scheduling to minimize the maximum delay factor. SODA 2009: 1116-1125 - [c1]Chandra Chekuri, Sungjin Im, Benjamin Moseley:
Longest Wait First for Broadcast Scheduling [Extended Abstract]. WAOA 2009: 62-74 - [i3]Chandra Chekuri, Sungjin Im, Benjamin Moseley:
Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling. CoRR abs/0906.2048 (2009) - [i2]Chandra Chekuri, Sungjin Im, Benjamin Moseley:
Longest Wait First for Broadcast Scheduling. CoRR abs/0906.2395 (2009) - 2008
- [i1]Chandra Chekuri, Benjamin Moseley:
Online Scheduling to Minimize the Maximum Delay Factor. CoRR abs/0807.1891 (2008)
Coauthor Index
maintained by 
at 
at 
last updated on 2018-07-17 21:42 CEST by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint