The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Hadas Shachnai: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Joel L. Wolf, Philip S. Yu, Hadas Shachnai
    DASD Dancing: A Disk Load Balancing Optimization Scheme for Video-on-Demand Computer. [Citation Graph (1, 0)][DBLP]
    SIGMETRICS, 1995, pp:157-166 [Conf]
  2. Joel L. Wolf, Philip S. Yu, Hadas Shachnai
    Disk Load Balancing for Video-On-Demand Systems. [Citation Graph (1, 0)][DBLP]
    Multimedia Syst., 1997, v:5, n:6, pp:358-370 [Journal]
  3. Philip S. Yu, Joel L. Wolf, Hadas Shachnai
    Design and Analysis of a Look-Ahead Scheduling Scheme to Support Pause-Resume for Video-on-Demand Applications. [Citation Graph (1, 0)][DBLP]
    Multimedia Syst., 1995, v:3, n:4, pp:137-149 [Journal]
  4. Hadas Shachnai, Tami Tamir
    Polynominal time approximation schemes for class-constrained packing problem. [Citation Graph (0, 0)][DBLP]
    APPROX, 2000, pp:238-249 [Conf]
  5. Leah Epstein, Magnús M. Halldórsson, Asaf Levin, Hadas Shachnai
    Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:116-127 [Conf]
  6. Micha Hofri, Hadas Shachnai
    Efficient Reorganization of Binary Search Trees. [Citation Graph (0, 0)][DBLP]
    CIAC, 1994, pp:152-166 [Conf]
  7. Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle
    Multi-coloring Trees. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:271-280 [Conf]
  8. Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai
    Sum Multi-coloring of Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 1999, pp:390-401 [Conf]
  9. Alexander Gaysinsky, Alon Itai, Hadas Shachnai
    Strongly Competitive Algorithms for Caching with Pipelined Prefetching. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:49-61 [Conf]
  10. Jiri Sgall, Hadas Shachnai, Tami Tamir
    Fairness-Free Periodic Scheduling with Vacations. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:592-603 [Conf]
  11. 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]
  12. Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
    Improved Results for Data Migration and Open Shop Scheduling. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:658-669 [Conf]
  13. Joseph Naor, Hadas Shachnai, Tami Tamir
    Real-Time Scheduling with a Budget. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:1123-1137 [Conf]
  14. Aviad Cohen, Yuri Rabinovich, Assaf Schuster, Hadas Shachnai
    Optimal Bounds on Tail Probabilities - A Simplified Approach. [Citation Graph (0, 0)][DBLP]
    IPPS/SPDP Workshops, 1998, pp:341-350 [Conf]
  15. 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]
  16. Alon Itai, Hadas Shachnai
    Adaptive Source Routing in High-Speed Networks. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1993, pp:212-221 [Conf]
  17. Hadas Shachnai, Tami Tamir
    Tight Bounds for Online Class-Constrained Packing. [Citation Graph (0, 0)][DBLP]
    LATIN, 2002, pp:569-583 [Conf]
  18. Jason Glasgow, Hadas Shachnai
    Channel Based Scheduling of Parallelizable Task. [Citation Graph (0, 0)][DBLP]
    MASCOTS, 1997, pp:11-16 [Conf]
  19. Prabhakar Raghavan, Hadas Shachnai, Mira Yaniv
    Dynamic Schemes for Speculative Execution of Code. [Citation Graph (0, 0)][DBLP]
    MASCOTS, 1998, pp:309-0 [Conf]
  20. Hagit Attiya, Hadas Shachnai
    IDABased Protocols for Reliable Multicast. [Citation Graph (0, 0)][DBLP]
    OPODIS, 1997, pp:137-152 [Conf]
  21. 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]
  22. Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
    Minimizing Average Completion of Dedicated Tasks and Interval Graphs. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:114-126 [Conf]
  23. 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]
  24. Erol Gelenbe, Hadas Shachnai
    On G-Networks and Resource Allocation in Multimedia Systems. [Citation Graph (0, 0)][DBLP]
    RIDE, 1998, pp:104-110 [Conf]
  25. Yuval Hershko, Daniel Segal, Hadas Shachnai
    Self-Tuning Synchronization Mechanisms in Network Operating Systems. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS, 1999, pp:224-225 [Conf]
  26. Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph Naor, Baruch Schieber, Hadas Shachnai
    Throughput maximization of real-time scheduling with batching. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:742-751 [Conf]
  27. Reuven Bar-Yehuda, Magnús M. Halldórsson, Joseph Naor, Hadas Shachnai, Irina Shapira
    Scheduling split intervals. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:732-741 [Conf]
  28. Hadas Shachnai, Aravind Srinivasan
    Finding large independent sets of hypergraphs in parallel. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:163-168 [Conf]
  29. Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
    Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria. [Citation Graph (0, 0)][DBLP]
    WAOA, 2004, pp:68-82 [Conf]
  30. Hadas Shachnai, Oded Shmueli, Robert Sayegh
    Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints. [Citation Graph (0, 0)][DBLP]
    WAOA, 2004, pp:111-125 [Conf]
  31. Hadas Shachnai, Tami Tamir, Omer Yehezkely
    Approximation Schemes for Packing with Item Fragmentation. [Citation Graph (0, 0)][DBLP]
    WAOA, 2005, pp:334-347 [Conf]
  32. Hagit Attiya, Hadas Shachnai, Tami Tamir
    Local Labeling and Resource Allocation Using Preprocessing. [Citation Graph (0, 0)][DBLP]
    WDAG, 1994, pp:194-208 [Conf]
  33. Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
    Sum Coloring Interval and k-Claw Free Graphs with Application to Scheduling Dependent Jobs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:37, n:3, pp:187-209 [Journal]
  34. Micha Hofri, Hadas Shachnai
    Efficient Reorganization of Binary Search Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:31, n:3, pp:378-402 [Journal]
  35. Hadas Shachnai, Micha Hofri
    The List Update Problem: Improved Bounds for the Counter Scheme. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:22, n:4, pp:650-659 [Journal]
  36. 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]
  37. 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]
  38. 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]
  39. Hagit Attiya, Hadas Shachnai
    Tight bounds for FEC-based reliable multicast. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:190, n:2, pp:117-135 [Journal]
  40. 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]
  41. Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle
    Multicoloring trees. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:180, n:2, pp:113-129 [Journal]
  42. Alexander Gaysinsky, Alon Itai, Hadas Shachnai
    Strongly competitive algorithms for caching with pipelined prefetching. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:91, n:1, pp:19-27 [Journal]
  43. Micha Hofri, Hadas Shachnai
    On the Optimality of the Counter Scheme for Dynamic Linear Lists. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:37, n:3, pp:175-179 [Journal]
  44. Hadas Shachnai, John Turek
    Multiresource Malleable Task Scheduling to Minimize Response Time. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:70, n:1, pp:47- [Journal]
  45. Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai
    Sum Multicoloring of Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:37, n:2, pp:422-450 [Journal]
  46. Micha Hofri, Hadas Shachnai
    Self-Organizing Lists and Independent References: A Statistical Synergy. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1991, v:12, n:4, pp:533-555 [Journal]
  47. Alon Itai, Hadas Shachnai
    Adaptive Source Routing in High-Speed Networks. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:20, n:2, pp:218-243 [Journal]
  48. Hadas Shachnai, Philip S. Yu
    Exploring Wait Tolerance in Effective Batching for Video-on-Demand Scheduling. [Citation Graph (0, 0)][DBLP]
    Multimedia Syst., 1998, v:6, n:6, pp:382-394 [Journal]
  49. Eli Almog, Hadas Shachnai
    Scheduling memory accesses through a shared bus. [Citation Graph (0, 0)][DBLP]
    Perform. Eval., 2001, v:46, n:2-3, pp:193-218 [Journal]
  50. Prabhakar Raghavan, Hadas Shachnai, Mira Yaniv
    Dynamic schemes for speculative execution of code. [Citation Graph (0, 0)][DBLP]
    Perform. Eval., 2003, v:53, n:2, pp:125-142 [Journal]
  51. Hadas Shachnai, Philip S. Yu
    On Analytic Modeling of Multimedia Batching Schemes. [Citation Graph (0, 0)][DBLP]
    Perform. Eval., 1998, v:33, n:3, pp:201-213 [Journal]
  52. 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]
  53. Reuven Bar-Yehuda, Magnús M. Halldórsson, Joseph Naor, Hadas Shachnai, Irina Shapira
    Scheduling Split Intervals. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:1, pp:1-15 [Journal]
  54. Hadas Shachnai, Aravind Srinivasan
    Finding Large Independent Sets in Graphs and Hypergraphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2004, v:18, n:3, pp:488-500 [Journal]
  55. Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
    Improved results for data migration and open shop scheduling. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:1, pp:116-129 [Journal]
  56. Alon Itai, Michael Rodeh, Hadas Shachnai
    The passport control problem or how to keep a dynamic service system load balanced? [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:282, n:2, pp:303-318 [Journal]
  57. 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]
  58. Hadas Shachnai, Omer Yehezkely
    Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs. [Citation Graph (0, 0)][DBLP]
    FCT, 2007, pp:482-493 [Conf]
  59. 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]

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


  61. Partial information spreading with application to distributed maximum coverage. [Citation Graph (, )][DBLP]


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


  63. Batch Coloring Flat Graphs and Thin. [Citation Graph (, )][DBLP]


  64. Online Selection of Intervals and t-Intervals. [Citation Graph (, )][DBLP]


  65. On Lagrangian Relaxation and Subset Selection Problems. [Citation Graph (, )][DBLP]


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


  67. Return of the Boss Problem: Competing Online against a Non-adaptive Adversary. [Citation Graph (, )][DBLP]


  68. Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs. [Citation Graph (, )][DBLP]


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


Search in 0.101secs, Finished in 0.105secs
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