4 citations · 7 across the 8 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2018
The Scheduler is Very Powerful in Competitive Analysis of Distributed List Accessing
Joan Boyar, Faith Ellen, Kim S. Larsen
This work is a continuation of efforts to define and understand competitive analysis of algorithms in a distributed shared memory setting, which is surprisingly different from the…
cs.DS2014
Tight Bounds for Restricted Grid Scheduling
Joan Boyar, Faith Ellen
The following online bin packing problem is considered: Items with integer sizes are given and variable sized bins arrive online. A bin must be used if there is still an item remai…
cs.DS2013★ 4 cited
Tight Bounds for Set Disjointness in the Message Passing Model
Mark Braverman, Faith Ellen, Rotem Oshman +2
In a multiparty message-passing model of communication, there are players. Each player has a private input, and they communicate by sending messages to one another over private…