2009 |
34 | EE | Ariel Kulik,
Hadas Shachnai,
Tami Tamir:
Maximizing submodular set functions subject to multiple linear constraints.
SODA 2009: 545-554 |
2008 |
33 | EE | Michal Feldman,
Tami Tamir:
Approximate Strong Equilibrium in Job Scheduling Games.
SAGT 2008: 58-69 |
32 | EE | Michal Feldman,
Tami Tamir:
Conflicting Congestion Effects in Resource Allocation Games.
WINE 2008: 109-117 |
31 | EE | Amotz Bar-Noy,
Richard E. Ladner,
Jacob Christensen,
Tami Tamir:
A general buffer scheme for the windows scheduling problem.
ACM Journal of Experimental Algorithmics 13: (2008) |
30 | EE | Amotz Bar-Noy,
Richard E. Ladner,
Tami Tamir:
Scheduling Techniques for Media-on-Demand.
Algorithmica 52(4): 413-439 (2008) |
29 | EE | Amotz Bar-Noy,
Richard E. Ladner,
Tami Tamir:
Optimal delay for media-on-demand with pre-loading and pre-buffering.
Theor. Comput. Sci. 399(1-2): 3-11 (2008) |
28 | EE | Hadas Shachnai,
Tami Tamir,
Omer Yehezkely:
Approximation Schemes for Packing with Item Fragmentation.
Theory Comput. Syst. 43(1): 81-98 (2008) |
2007 |
27 | EE | Amotz Bar-Noy,
Richard E. Ladner,
Tami Tamir:
Windows scheduling as a restricted version of bin packing.
ACM Transactions on Algorithms 3(3): (2007) |
26 | EE | Joseph Naor,
Hadas Shachnai,
Tami Tamir:
Real-Time Scheduling with a Budget.
Algorithmica 47(3): 343-364 (2007) |
2006 |
25 | EE | Hagit Attiya,
Leah Epstein,
Hadas Shachnai,
Tami Tamir:
Transactional contention management as a non-clairvoyant scheduling problem.
PODC 2006: 308-315 |
24 | EE | Amotz Bar-Noy,
Richard E. Ladner,
Tami Tamir:
Optimal Delay for Media-on-Demand with Pre-loading and Pre-buffering.
SIROCCO 2006: 171-181 |
23 | EE | Leah Epstein,
Rob van Stee,
Tami Tamir:
Paging with Request Sets.
SWAT 2006: 124-135 |
22 | EE | Nicholas J. A. Harvey,
Richard E. Ladner,
László Lovász,
Tami Tamir:
Semi-matchings for bipartite graphs and load balancing.
J. Algorithms 59(1): 53-78 (2006) |
2005 |
21 | EE | Jiri Sgall,
Hadas Shachnai,
Tami Tamir:
Fairness-Free Periodic Scheduling with Vacations.
ESA 2005: 592-603 |
20 | EE | Anna R. Karlin,
David Kempe,
Tami Tamir:
Beyond VCG: Frugality of Truthful Mechanisms.
FOCS 2005: 615-626 |
19 | EE | Amotz Bar-Noy,
Richard E. Ladner,
Tami Tamir,
Tammy VanDeGrift:
Windows scheduling of arbitrary length jobs on parallel machines.
SPAA 2005: 56-65 |
18 | EE | Hadas Shachnai,
Tami Tamir,
Omer Yehezkely:
Approximation Schemes for Packing with Item Fragmentation.
WAOA 2005: 334-347 |
17 | EE | Amotz Bar-Noy,
Jacob Christensen,
Richard E. Ladner,
Tami Tamir:
A General Buffer Scheme for the Windows Scheduling Problem.
WEA 2005: 139-151 |
16 | EE | Hadas Shachnai,
Tami Tamir,
Gerhard J. Woeginger:
Minimizing Makespan and Preemption Costs on a System of Uniform Machines.
Algorithmica 42(3-4): 309-334 (2005) |
2004 |
15 | EE | Amotz Bar-Noy,
Richard E. Ladner,
Tami Tamir:
Windows scheduling as a restricted version of Bin Packing.
SODA 2004: 224-233 |
14 | EE | Hadas Shachnai,
Tami Tamir:
Tight bounds for online class-constrained packing.
Theor. Comput. Sci. 321(1): 103-123 (2004) |
2003 |
13 | EE | Joseph Naor,
Hadas Shachnai,
Tami Tamir:
Real-Time Scheduling with a Budget.
ICALP 2003: 1123-1137 |
12 | EE | Hadas Shachnai,
Tami Tamir:
Approximation Schemes for Generalized 2-Dimensional Vector Packing with Application to Data Placement.
RANDOM-APPROX 2003: 165-177 |
11 | EE | Amotz Bar-Noy,
Richard E. Ladner,
Tami Tamir:
Scheduling techniques for media-on-demand.
SODA 2003: 791-80 |
10 | EE | Nicholas J. A. Harvey,
Richard E. Ladner,
László Lovász,
Tami Tamir:
Semi-matchings for Bipartite Graphs and Load Balancing.
WADS 2003: 294-308 |
2002 |
9 | EE | Hadas Shachnai,
Tami Tamir,
Gerhard J. Woeginger:
Minimizing Makespan and Preemption Costs on a System of Uniform Machines.
ESA 2002: 859-871 |
8 | EE | Hadas Shachnai,
Tami Tamir:
Tight Bounds for Online Class-Constrained Packing.
LATIN 2002: 569-583 |
7 | EE | Hadas Shachnai,
Tami Tamir:
Multiprocessor Scheduling with Machine Allotment and Parallelism Constraints.
Algorithmica 32(4): 651-678 (2002) |
2001 |
6 | EE | Hadas Shachnai,
Tami Tamir:
On Two Class-Constrained Versions of the Multiple Knapsack Problem.
Algorithmica 29(3): 442-467 (2001) |
2000 |
5 | EE | Hadas Shachnai,
Tami Tamir:
Polynominal time approximation schemes for class-constrained packing problem.
APPROX 2000: 238-249 |
1999 |
4 | | Hagit Attiya,
Hadas Shachnai,
Tami Tamir:
Local Labeling and Resource Allocation Using Preprocessing.
SIAM J. Comput. 28(4): 1397-1414 (1999) |
1998 |
3 | | Amotz Bar-Noy,
Mihir Bellare,
Magnús M. Halldórsson,
Hadas Shachnai,
Tami Tamir:
On Chromatic Sums and Distributed Resource Allocation.
Inf. Comput. 140(2): 183-202 (1998) |
1996 |
2 | | Amotz Bar-Noy,
Hadas Shachnai,
Tami Tamir:
On Chromatic Sums and Distributed Resource Allocation.
ISTCS 1996: 119-128 |
1994 |
1 | | Hagit Attiya,
Hadas Shachnai,
Tami Tamir:
Local Labeling and Resource Allocation Using Preprocessing.
WDAG 1994: 194-208 |