Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Author="Tamir, Tami"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Packing resizable items with application to video delivery over wireless networks
Sivan Albagli-Kim
,
Leah Epstein
,
Hadas Shachnai
,
Tami Tamir
Theoretical Computer Science
553
, 2014, pp. 91-105
Properties and utilization of capacitated automata
Orna Kupferman
,
Tami Tamir
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 33-44
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
Lecture Notes in Computer Science
7801
, 2013, pp. 13-24
Coping with selfish on-going behaviors
Orna Kupferman
,
Tami Tamir
Information and Computation
210
, 2012, pp. 1-12
Minimal cost reconfiguration of data placement in a storage area network
Hadas Shachnai
,
Gal Tamir
,
Tami Tamir
Theoretical Computer Science
460
, 2012, pp. 42-53
Scheduling with bully selfish jobs
Tami Tamir
Theory of Computing Systems
50
(1), 2012, pp. 124-146
Transactional contention management as a non-clairvoyant scheduling problem
Hagit Attiya
,
Leah Eppstein
,
Hadas Shachnai
,
Tami Tamir
Algorithmica
57
(1), 2010, pp. 44-61
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
Theoretical Computer Science
411
(40-42), 2010, pp. 3553-3562
Minimizing busy time in multiple machine real-time scheduling
Rohit Khandekar
,
Baruch Schieber
,
Hadas Shachnai
,
Tami Tamir
Leibniz International Proceedings in Informatics (LIPIcs)
8
, 2010, pp. 169-180
Paging with request sets
Leah Epstein
,
Rob van Stee
,
Tami Tamir
Theory of Computing Systems
44
(1), 2009, pp. 67-81
Periodic scheduling with obligatory vacations
Jiȓí Sgall
,
Hadas Shachnai
,
Tami Tamir
Theoretical Computer Science
410
(47-49), 2009, pp. 5112-5121
Scheduling techniques for media-on-demand
Amotz Bar-Noy
,
Richard E. Ladner
,
Tami Tamir
Algorithmica
52
(4), 2008, pp. 413-439
Optimal delay for media-on-demand with pre-loading and pre-buffering
Amotz Bar-Noy
,
Richard E. Ladner
,
Tami Tamir
Theoretical Computer Science
399
(1-2), 2008, pp. 3-11
Approximation schemes for packing with item fragmentation
Hadas Shachnai
,
Tami Tamir
,
Omer Yehezkely
Theory of Computing Systems
43
(1), 2008, pp. 81-98
Real-time scheduling with a budget
Joseph (Seffi) Naor
,
Hadas Shachnai
,
Tami Tamir
Algorithmica
47
(3), 2007, pp. 343-364
Paging with request sets
Leah Epstein
,
Rob van Stee
,
Tami Tamir
Lecture Notes in Computer Science
4059
, 2006, pp. 124-135
Semi-matchings for bipartite graphs and load balancing
Nicholas J.A. Harvey
,
Richard E. Ladner
,
László Lovász
,
Tami Tamir
Journal of Algorithms
59
(1), 2006, pp. 53-78
Windows scheduling of arbitrary length jobs on parallel machines
Amotz Bar-Noy
,
Richard E. Ladner
,
Tami Tamir
,
Tammy VanDeGrift
Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2005 (Las Vegas, Nevada, USA, July 18-20, 2005)
, 2005, pp. 56-65
Fairness-free periodic scheduling with vacations
Jiȓí Sgall
,
Hadas Shachnai
,
Tami Tamir
Lecture Notes in Computer Science
3669
, 2005, pp. 592-603
Minimizing makespan and preemption costs on a system of uniform machines
Hadas Shachnai
,
Tami Tamir
,
Gerhard J. Woeginger
Algorithmica
42
(3-4), 2005, pp. 309-334
Tight bounds for online class-constrained packing
Hadas Shachnai
,
Tami Tamir
Theoretical Computer Science
321
(1), 2004, pp. 103-123
Semi-matchings for bipartite graphs and load balancing
Nicholas J.A. Harvey
,
Richard E. Ladner
,
László Lovász
,
Tami Tamir
Lecture Notes in Computer Science
2748
, 2003, pp. 294-306
Real-time scheduling with a budget
Joseph (Seffi) Naor
,
Hadas Shachnai
,
Tami Tamir
Lecture Notes in Computer Science
2719
, 2003, pp. 1123-1137
Minimizing makespan and preemption costs on a system of uniform machines
Hadas Shachnai
,
Tami Tamir
,
Gerhard J. Woeginger
Lecture Notes in Computer Science
2461
, 2002, pp. 859-871
Local labeling and resource allocation using preprocessing
Hagit Attiya
,
Hadas Shachnai
,
Tami Tamir
SIAM Journal on Computing
28
(4), 1999, pp. 1397-1413
Seiten 1
2
>