The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Tami Tamir: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  28. Minimizing total busy time in parallel scheduling with application to optical networks. [Citation Graph (, )][DBLP]


  29. Maximizing submodular set functions subject to multiple linear constraints. [Citation Graph (, )][DBLP]


  30. Minimal Cost Reconfiguration of Data Placement in Storage Area Network. [Citation Graph (, )][DBLP]


  31. Conflicting Congestion Effects in Resource Allocation Games. [Citation Graph (, )][DBLP]


  32. Scheduling with Bully Selfish Jobs. [Citation Graph (, )][DBLP]


  33. Approximate Strong Equilibrium in Job Scheduling Games. [Citation Graph (, )][DBLP]


  34. Scheduling Techniques for Media-on-Demand. [Citation Graph (, )][DBLP]


  35. Transactional Contention Management as a Non-Clairvoyant Scheduling Problem. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002