Searching for authors named "Hadas Shachnai" – sorted by Relevance.
-
IDA-Based Protocols for Reliable Multicast
- IDA-Based Protocols for Reliable Multicast Hagit Attiya y Hadas Shachnai z Department
- Add To MetaCart
-
Minimizing the Flow Time for Parallelizable Task Systems
- Technion IIT, Haifa, Israel Hadas Shachnai Technion IIT, Haifa, Israel y Abstract Consider the problem
- Cited by 3 (2 self) – Add To MetaCart
-
Ecient reorganization of binary search trees
- Efficient Reorganization of Binary Search Trees Micha Hofri † Hadas Shachnai ‡ Dept. of Computer
- Cited by 1 (0 self) – Add To MetaCart
-
On G-Networks and Resource Allocation in Multimedia Systems
- On G-Networks and Resource Allocation in Multimedia Systems Erol Gelenbe Hadas Shachnai y
- Cited by 2 (0 self) – Add To MetaCart
-
Tight bounds for online class-constrained packing
- Tight Bounds for Online Class-Constrained Packing \Lambda Hadas Shachnai yz Tami Tamir x
- Cited by 1 (0 self) – Add To MetaCart
-
Efficient reorganization of binary search trees
- Efficient Reorganization of Binary Search Trees Micha Hofri + Hadas Shachnai # Dept
- Cited by 1 (0 self) – Add To MetaCart
-
On Two Class-Constrained Versions of the Multiple Knapsack Problem
- On Two Class-Constrained Versions of the Multiple Knapsack Problem Hadas Shachnai y Tami Tamir
- Cited by 17 (5 self) – Add To MetaCart
-
Polynomial Time Approximation Schemes for Class-Constrained Packing Problems
- Polynomial Time Approximation Schemes for Class-Constrained Packing Problems Hadas Shachnai
- Cited by 15 (3 self) – Add To MetaCart
-
There is No EPTAS for Two-dimensional Knapsack
- There is No EPTAS for Two-dimensional Knapsack Ariel Kulik ∗ Hadas Shachnai † Abstract In the d
- Add To MetaCart
-
Sum Multi-Coloring of Graphs (Extended Abstract)
- Kortsarz z Ravit Salman x Hadas Shachnai -- Abstract Scheduling dependent jobs on multiple machines
- Add To MetaCart

