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