Travelled to:1 × Italy
1 × Poland
5 × USA
Collaborated with:B.Schieber J.Naor S.Guha G.Kortsarz N.Linial D.Peleg P.Cheilaris S.Olonetsky S.Smorodinsky N.Alon B.Awerbuch R.Bar-Yehuda A.Freund R.Canetti S.Kutten Y.Mansour
Talks about:approxim (2) schedul (2) color (2) alloc (2) throughput (1) preemption (1) hypergraph (1) multicast (1) heterogen (1) distribut (1)
Person: Amotz Bar-Noy
DBLP: Bar-Noy:Amotz
Contributed to:
2007
200019991998199719951989Wrote 8 papers:
- ICALP-2007-Bar-NoyCOS #online
- Online Conflict-Free Colorings for Hypergraphs (ABN, PC, SO, SS), pp. 219–230.
- STOC-2000-Bar-NoyBFNS #approach #approximate #resource management #scheduling
- A unified approach to approximating resource allocation and scheduling (ABN, RBY, AF, JN, BS), pp. 735–744.
- STOC-1999-Bar-NoyGNS #approximate #multi #realtime #scheduling #throughput
- Approximating the Throughput of Multiple Machines Under Real-Time Scheduling (ABN, SG, JN, BS), pp. 622–631.
- STOC-1998-Bar-NoyGNS #multi #network
- Multicasting in Heterogeneous Networks (ABN, SG, JN, BS), pp. 448–453.
- ICALP-1997-Bar-NoyK #graph
- The Minimum Color Sum of Bipartite Graphs (ABN, GK), pp. 738–748.
- STOC-1995-Bar-NoyCKMS
- Bandwidth allocation with preemption (ABN, RC, SK, YM, BS), pp. 616–625.
- STOC-1989-AlonBLP #communication #complexity #on the
- On the Complexity of Radio Communication (NA, ABN, NL, DP), pp. 274–285.
- STOC-1989-AwerbuchBLP #adaptation #data type #distributed
- Compact Distributed Data Structures for Adaptive Routing (BA, ABN, NL, DP), pp. 479–489.