Hadas Shachnai

According to our database, Hadas Shachnai authored at least 139 papers between 1991 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2024

The preemptive resource allocation problem.

Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai

J. Sched., February, 2024

Approximations and Hardness of Packing Partially Ordered Items.

Ilan Doron Arad, Guy Kortsarz, Joseph Naor, Baruch Schieber, Hadas Shachnai

CoRR, 2024

Spatial Voting with Incomplete Voter Information.

Aviram Imber, Jonas Israel, Markus Brill, Hadas Shachnai, Benny Kimelfeld

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

An FPTAS for budgeted laminar matroid independent set.

Ilan Doron Arad, Ariel Kulik, Hadas Shachnai

Oper. Res. Lett., November, 2023

An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized Rounding.

Ilan Doron Arad, Ariel Kulik, Hadas Shachnai

CoRR, 2023

Tight Bounds for Budgeted Maximum Weight Independent Set in Bipartite and Perfect Graphs.

Ilan Doron Arad, Hadas Shachnai

CoRR, 2023

Tight Lower Bounds for Weighted Matroid Problems.

Ilan Doron Arad, Ariel Kulik, Hadas Shachnai

CoRR, 2023

Finding Possible and Necessary Winners in Spatial Voting with Partial Information.

Aviram Imber, Jonas Israel, Markus Brill, Hadas Shachnai, Benny Kimelfeld

CoRR, 2023

An EPTAS for Budgeted Matching and Budgeted Matroid Intersection.

Ilan Doron Arad, Ariel Kulik, Hadas Shachnai

CoRR, 2023

Approximating Bin Packing with Conflict Graphs via Maximization Techniques.

Ilan Doron Arad, Hadas Shachnai

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

An EPTAS for Budgeted Matroid Independent Set.

Ilan Doron Arad, Ariel Kulik, Hadas Shachnai

Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

Budgeted Matroid Maximization: a Parameterized Viewpoint.

Ilan Doron Arad, Ariel Kulik, Hadas Shachnai

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Improved Approximation for Two-Dimensional Vector Multiple Knapsack.

Tomer Cohen, Ariel Kulik, Hadas Shachnai

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

An EPTAS for Budgeted Matching and Budgeted Matroid Intersection via Representative Sets.

Ilan Doron Arad, Ariel Kulik, Hadas Shachnai

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Improved Approximations for Vector Bin Packing via Iterative Randomized Rounding.

Ariel Kulik, Matthias Mnich, Hadas Shachnai

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

An AFPTAS for Bin Packing with Partition Matroid via a New Method for LP Rounding.

Ilan Doron Arad, Ariel Kulik, Hadas Shachnai

Proceedings of the Approximation, 2023

2022

An almost optimal approximation algorithm for monotone submodular multiple knapsack.

Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz, Hadas Shachnai

J. Comput. Syst. Sci., 2022

Bin Packing with Partition Matroid can be Approximated within $o(OPT)$ Bins.

Ilan Doron Arad, Ariel Kulik, Hadas Shachnai

CoRR, 2022

An Asymptotic (4/3+ε)-Approximation for the 2-Dimensional Vector Bin Packing Problem.

Ariel Kulik, Matthias Mnich, Hadas Shachnai

CoRR, 2022

2021

A refined analysis of submodular Greedy.

Ariel Kulik, Roy Schwartz, Hadas Shachnai

Oper. Res. Lett., 2021

On Lagrangian relaxation for constrained maximization and reoptimization problems.

Ariel Kulik, Hadas Shachnai, Gal Tamir

Discret. Appl. Math., 2021

A Faster Tight Approximation for Submodular Maximization Subject to a Knapsack Constraint.

Ariel Kulik, Roy Schwartz, Hadas Shachnai

CoRR, 2021

An APTAS for Bin Packing with Clique-Graph Conflicts.

Ilan Doron Arad, Ariel Kulik, Hadas Shachnai

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

Modular and Submodular Optimization with Multiple Knapsack Constraints via Fractional Grouping.

Yaron Fairstein, Ariel Kulik, Hadas Shachnai

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020

The Euclidean <i>k</i>-Supplier Problem.

Viswanath Nagarajan, Baruch Schieber, Hadas Shachnai

Math. Oper. Res., 2020

An APTAS for Bin Packing with Clique-graph Conflicts.

Ilan Doron Arad, Hadas Shachnai

CoRR, 2020

tight approximations for modular and submodular optimization with d-resource multiple knapsack constraints.

Yaron Fairstein, Ariel Kulik, Hadas Shachnai

CoRR, 2020

Analysis of Two-variable Recurrence Relations with Application to Parameterized Approximations.

Ariel Kulik, Hadas Shachnai

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

A (1-e^-1-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem.

Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz, Hadas Shachnai

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

Maximizing Throughput in Flow Shop Real-Time Scheduling.

Lior Ben Yamin, Jing Li, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai

Proceedings of the Approximation, 2020

2019

Constrained submodular maximization via greedy local search.

Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai

Oper. Res. Lett., 2019

Improved Parameterized Algorithms for Network Query Problems.

Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi

Algorithmica, 2019

Flexible Resource Allocation to Interval Jobs.

Dmitriy Katz, Baruch Schieber, Hadas Shachnai

Algorithmica, 2019

Generalized Assignment via Submodular Optimization with Reserved Capacity.

Ariel Kulik, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018

Flexible bandwidth assignment with application to optical networks.

Hadas Shachnai, Ariella Voloshin, Shmuel Zaks

J. Sched., 2018

Parameterized approximation via fidelity preserving transformations.

Michael R. Fellows, Ariel Kulik, Frances A. Rosamond, Hadas Shachnai

J. Comput. Syst. Sci., 2018

Complexity and inapproximability results for the Power Edge Set problem.

Sonia Toubaline, Claudia D'Ambrosio, Leo Liberti, Pierre-Louis Poirion, Baruch Schieber, Hadas Shachnai

J. Comb. Optim., 2018

A Theory and Algorithms for Combinatorial Reoptimization.

Baruch Schieber, Hadas Shachnai, Gal Tamir, Tami Tamir

Algorithmica, 2018

Brief Announcement: Approximation Algorithms for Preemptive Resource Allocation.

Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai

Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Generalized Assignment of Time-Sensitive Item Groups.

Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai

Proceedings of the Approximation, 2018

Polynomial Time Approximation Schemes.

Hadas Shachnai, Tami Tamir

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017

Parameterized Algorithms for Graph Partitioning Problems.

Hadas Shachnai, Meirav Zehavi

Theory Comput. Syst., 2017

Optimizing bandwidth allocation in elastic optical networks with application to scheduling.

Hadas Shachnai, Ariella Voloshin, Shmuel Zaks

J. Discrete Algorithms, 2017

A multivariate framework for weighted FPT algorithms.

Hadas Shachnai, Meirav Zehavi

J. Comput. Syst. Sci., 2017

Fast Distributed Approximation for Max-Cut.

Keren Censor-Hillel, Rina Levy, Hadas Shachnai

Proceedings of the Algorithms for Sensor Systems, 2017

2016

Tractable Parameterizations for the Minimum Linear Arrangement Problem.

Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Hadas Shachnai

ACM Trans. Comput. Theory, 2016

Constructing minimum changeover cost arborescenses in bounded treewidth graphs.

Didem Gözüpek, Hadas Shachnai, Mordechai Shalom, Shmuel Zaks

Theor. Comput. Sci., 2016

All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns.

Ron Adany, Moran Feldman, Elad Haramaty, Rohit Khandekar, Baruch Schieber, Roy Schwartz, Hadas Shachnai, Tami Tamir

ACM Trans. Algorithms, 2016

Representative families: A unified tradeoff-based approach.

Hadas Shachnai, Meirav Zehavi

J. Comput. Syst. Sci., 2016

Deterministic parameterized algorithms for the Graph Motif problem.

Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi

Discret. Appl. Math., 2016

Flexible Resource Allocation for Clouds and All-Optical Networks.

Dmitriy Katz, Baruch Schieber, Hadas Shachnai

CoRR, 2016

Brief Announcement: Flexible Resource Allocation for Clouds and All-Optical Networks.

Dmitriy Katz, Baruch Schieber, Hadas Shachnai

Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Real-Time k-bounded Preemptive Scheduling.

Sivan Albagli-Kim, Baruch Schieber, Hadas Shachnai, Tami Tamir

Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, 2016

2015

Real-time scheduling to minimize machine busy times.

Rohit Khandekar, Baruch Schieber, Hadas Shachnai, Tami Tamir

J. Sched., 2015

Partial Information Network Queries.

Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi

J. Discrete Algorithms, 2015

On Lagrangian Relaxation and Reoptimization Problems.

Ariel Kulik, Hadas Shachnai, Gal Tamir

CoRR, 2015

A Multivariate Approach for Weighted FPT Algorithms.

Hadas Shachnai, Meirav Zehavi

Proceedings of the Algorithms - ESA 2015, 2015

The Container Selection Problem.

Viswanath Nagarajan, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai, Joel L. Wolf

Proceedings of the Approximation, 2015

2014

Packing resizable items with application to video delivery over wireless networks.

Sivan Albagli-Kim, Leah Epstein, Hadas Shachnai, Tami Tamir

Theor. Comput. Sci., 2014

FPT Algorithms for Weighted Graphs Can be (Almost) as Efficient as for Unweighted.

Hadas Shachnai, Meirav Zehavi

CoRR, 2014

Faster Computation of Representative Families for Uniform Matroids with Applications.

Hadas Shachnai, Meirav Zehavi

CoRR, 2014

Tighter Bounds for Makespan Minimization on Unrelated Machines.

Dor Arad, Yael Mordechai, Hadas Shachnai

CoRR, 2014

Flexible Bandwidth Assignment with Application to Optical Networks - (Extended Abstract).

Hadas Shachnai, Ariella Voloshin, Shmuel Zaks

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Optimizing Bandwidth Allocation in Flex-Grid Optical Networks with Application to Scheduling.

Hadas Shachnai, Ariella Voloshin, Shmuel Zaks

Proceedings of the 2014 IEEE 28th International Parallel and Distributed Processing Symposium, 2014

Scheduling jobs with dwindling resource requirements in clouds.

Sivan Albagli-Kim, Hadas Shachnai, Tami Tamir

Proceedings of the 2014 IEEE Conference on Computer Communications, 2014

2013

Corrigendum: Improved results for data migration and open shop scheduling.

Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai

ACM Trans. Algorithms, 2013

Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints.

Ariel Kulik, Hadas Shachnai, Tami Tamir

Math. Oper. Res., 2013

Online selection of intervals and t-intervals.

Unnar Th. Bachmann, Magnús M. Halldórsson, Hadas Shachnai

Inf. Comput., 2013

The Euclidean k-Supplier Problem.

Viswanath Nagarajan, Baruch Schieber, Hadas Shachnai

Proceedings of the Integer Programming and Combinatorial Optimization, 2013

2012

Minimal cost reconfiguration of data placement in a storage area network.

Hadas Shachnai, Gal Tamir, Tami Tamir

Theor. Comput. Sci., 2012

Fast Information Spreading in Graphs with Large Weak Conductance.

Keren Censor-Hillel, Hadas Shachnai

SIAM J. Comput., 2012

Approximation schemes for generalized two-dimensional vector packing with application to data placement.

Hadas Shachnai, Tami Tamir

J. Discrete Algorithms, 2012

A Theory and Algorithms for Combinatorial Reoptimization.

Hadas Shachnai, Gal Tamir, Tami Tamir

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

2011

Approximation schemes for deal splitting and covering integer programs with multiplicity constraints.

Ariel Kulik, Hadas Shachnai, Oded Shmueli, Robert Sayegh

Theor. Comput. Sci., 2011

Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091).

Klaus Jansen, Claire Mathieu, Hadas Shachnai, Neal E. Young

Dagstuhl Reports, 2011

Approximations for Monotone and Non-monotone Submodular Maximization with Knapsack Constraints

Ariel Kulik, Hadas Shachnai, Tami Tamir

CoRR, 2011

2010

Minimizing total busy time in parallel scheduling with application to optical networks.

Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom, Tami Tamir, Shmuel Zaks

Theor. Comput. Sci., 2010

There is no EPTAS for two-dimensional knapsack.

Ariel Kulik, Hadas Shachnai

Inf. Process. Lett., 2010

Transactional Contention Management as a Non-Clairvoyant Scheduling Problem.

Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir

Algorithmica, 2010

Online Selection of Intervals and <i>t</i>-Intervals.

Unnar Th. Bachmann, Magnús M. Halldórsson, Hadas Shachnai

Proceedings of the Algorithm Theory, 2010

Partial information spreading with application to distributed maximum coverage.

Keren Censor-Hillel, Hadas Shachnai

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Return of the Boss Problem: Competing Online against a Non-adaptive Adversary.

Magnús M. Halldórsson, Hadas Shachnai

Proceedings of the Fun with Algorithms, 5th International Conference, 2010

Minimizing Busy Time in Multiple Machine Real-time Scheduling.

Rohit Khandekar, Baruch Schieber, Hadas Shachnai, Tami Tamir

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

2009

Periodic scheduling with obligatory vacations.

Jirí Sgall, Hadas Shachnai, Tami Tamir

Theor. Comput. Sci., 2009

Throughput maximization of real-time scheduling with batching.

Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph Naor, Baruch Schieber, Hadas Shachnai

ACM Trans. Algorithms, 2009

A note on generalized rank aggregation.

Hadas Shachnai, Lisa Zhang, Tomomi Matsui

Inf. Process. Lett., 2009

Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs.

Leah Epstein, Magnús M. Halldórsson, Asaf Levin, Hadas Shachnai

Algorithmica, 2009

Maximizing submodular set functions subject to multiple linear constraints.

Ariel Kulik, Hadas Shachnai, Tami Tamir

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008

Improved bounds for scheduling conflicting jobs with minsum criteria.

Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai

ACM Trans. Algorithms, 2008

Exact algorithms for the master ring problem.

Hadas Shachnai, Lisa Zhang, Tomomi Matsui

Networks, 2008

Approximation Schemes for Packing with Item Fragmentation.

Hadas Shachnai, Tami Tamir, Omer Yehezkely

Theory Comput. Syst., 2008

On Lagrangian Relaxation and Subset Selection Problems.

Ariel Kulik, Hadas Shachnai

Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

Batch Coloring Flat Graphs and Thin.

Magnús M. Halldórsson, Hadas Shachnai

Proceedings of the Algorithm Theory, 2008

2007

Polynomial-Time Approximation Schemes.

Hadas Shachnai, Tami Tamir

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Real-Time Scheduling with a Budget.

Joseph Naor, Hadas Shachnai, Tami Tamir

Algorithmica, 2007

Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs.

Hadas Shachnai, Omer Yehezkely

Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

2006

Improved results for data migration and open shop scheduling.

Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai

ACM Trans. Algorithms, 2006

Scheduling Split Intervals.

Reuven Bar-Yehuda, Magnús M. Halldórsson, Joseph Naor, Hadas Shachnai, Irina Shapira

SIAM J. Comput., 2006

2005

Minimizing Makespan and Preemption Costs on a System of Uniform Machines.

Hadas Shachnai, Tami Tamir, Gerhard J. Woeginger

Algorithmica, 2005

Fairness-Free Periodic Scheduling with Vacations.

Jirí Sgall, Hadas Shachnai, Tami Tamir

Proceedings of the Algorithms, 2005

2004

Tight bounds for online class-constrained packing.

Hadas Shachnai, Tami Tamir

Theor. Comput. Sci., 2004

Finding Large Independent Sets in Graphs and Hypergraphs.

Hadas Shachnai, Aravind Srinivasan

SIAM J. Discret. Math., 2004

Strongly competitive algorithms for caching with pipelined prefetching.

Alexander Gaysinsky, Alon Itai, Hadas Shachnai

Inf. Process. Lett., 2004

Tight bounds for FEC-based reliable multicast.

Hagit Attiya, Hadas Shachnai

Inf. Comput., 2004

Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints.

Hadas Shachnai, Oded Shmueli, Robert Sayegh

Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria.

Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai

Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

2003

Dynamic schemes for speculative execution of code.

Prabhakar Raghavan, Hadas Shachnai, Mira Yaniv

Perform. Evaluation, 2003

Multicoloring trees.

Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle

Inf. Comput., 2003

Sum Coloring Interval and k-Claw Free Graphs with Application to Scheduling Dependent Jobs.

Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai

Algorithmica, 2003

Approximation Schemes for Generalized 2-Dimensional Vector Packing with Application to Data Placement.

Hadas Shachnai, Tami Tamir

Proceedings of the Approximation, 2003

2002

The passport control problem or how to keep a dynamic service system load balanced?

Alon Itai, Michael Rodeh, Hadas Shachnai

Theor. Comput. Sci., 2002

Multiprocessor Scheduling with Machine Allotment and Parallelism Constraints.

Hadas Shachnai, Tami Tamir

Algorithmica, 2002

2001

Scheduling memory accesses through a shared bus.

Eli Almog, Hadas Shachnai

Perform. Evaluation, 2001

On Two Class-Constrained Versions of the Multiple Knapsack Problem.

Hadas Shachnai, Tami Tamir

Algorithmica, 2001

Efficient Reorganization of Binary Search Trees.

Micha Hofri, Hadas Shachnai

Algorithmica, 2001

Finding large independent sets of hypergraphs in parallel.

Hadas Shachnai, Aravind Srinivasan

Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

Minimizing Average Completion of Dedicated Tasks and Interval Graphs.

Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai

Proceedings of the Approximation, 2001

2000

Sum Multicoloring of Graphs.

Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai

J. Algorithms, 2000

On G-networks and resource allocation in multimedia systems.

Erol Gelenbe, Hadas Shachnai

Eur. J. Oper. Res., 2000

Polynominal time approximation schemes for class-constrained packing problem.

Hadas Shachnai, Tami Tamir

Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2000

1999

Local Labeling and Resource Allocation Using Preprocessing.

Hagit Attiya, Hadas Shachnai, Tami Tamir

SIAM J. Comput., 1999

Multiresource Malleable Task Scheduling to Minimize Response Time.

Hadas Shachnai, John Turek

Inf. Process. Lett., 1999

Self-Tuning Synchronization Mechanisms in Network Operating Systems.

Yuval Hershko, Daniel Segal, Hadas Shachnai

Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, 1999

Sum Multi-coloring of Graphs.

Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai

Proceedings of the Algorithms, 1999

Multi-coloring Trees.

Magnús M. Halldórsson, Guy Kortsarz, Andrzej Proskurowski, Ravit Salman, Hadas Shachnai, Jan Arne Telle

Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998

On Analytic Modeling of Multimedia Batching Schemes.

Hadas Shachnai, Philip S. Yu

Perform. Evaluation, 1998

Exploring Wait Tolerance in Effective Batching for Video-on-Demand Scheduling.

Hadas Shachnai, Philip S. Yu

Multim. Syst., 1998

On Chromatic Sums and Distributed Resource Allocation.

Amotz Bar-Noy, Mihir Bellare, Magnús M. Halldórsson, Hadas Shachnai, Tami Tamir

Inf. Comput., 1998

The List Update Problem: Improved Bounds for the Counter Scheme.

Hadas Shachnai, Micha Hofri

Algorithmica, 1998

Optimal Bounds on Tail Probabilities - A Simplified Approach.

Aviad Cohen, Yuri Rabinovich, Assaf Schuster, Hadas Shachnai

Proceedings of the Parallel and Distributed Processing, 10 IPPS/SPDP'98 Workshops Held in Conjunction with the 12th International Parallel Processing Symposium and 9th Symposium on Parallel and Distributed Processing, Orlando, Florida, USA, March 30, 1998

1997

Disk Load Balancing for Video-On-Demand Systems.

Joel L. Wolf, Philip S. Yu, Hadas Shachnai

Multim. Syst., 1997

IDABased Protocols for Reliable Multicast.

Hagit Attiya, Hadas Shachnai

Proceedings of the On Principles Of Distributed Systems, 1997

Channel Based Scheduling of Parallelizable Task.

Jason Glasgow, Hadas Shachnai

Proceedings of the MASCOTS 1997, 1997

1996

Adaptive Source Routing in High-Speed Networks.

Alon Itai, Hadas Shachnai

J. Algorithms, 1996

On Chromatic Sums and Distributed Resource Allocation.

Amotz Bar-Noy, Hadas Shachnai, Tami Tamir

Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996

1995

Design and Analysis of a Look-Ahead Scheduling Scheme to Support Pause-Resume for Video-on-Demand Applications.

Philip S. Yu, Joel L. Wolf, Hadas Shachnai

Multim. Syst., 1995

DASD Dancing: A Disk Load Balancing Optimization Scheme for Video-on-Demand Computer.

Joel L. Wolf, Philip S. Yu, Hadas Shachnai

Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems, 1995

1991

Self-Organizing Lists and Independent References: A Statistical Synergy.

Micha Hofri, Hadas Shachnai

J. Algorithms, 1991

On the Optimality of the Counter Scheme for Dynamic Linear Lists.

Micha Hofri, Hadas Shachnai

Inf. Process. Lett., 1991