Tami Tamir

According to our database1, Tami Tamir authored at least 90 papers between 1994 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Scheduling Games with Machine-Dependent Priority Lists.
CoRR, 2019

Best Response Dynamics for VLSI Physical Design Placement.
Proceedings of the 2019 Federated Conference on Computer Science and Information Systems, 2019

2018
A Theory and Algorithms for Combinatorial Reoptimization.
Algorithmica, 2018

Cost-Sharing Games in Real-Time Scheduling Systems.
Proceedings of the Web and Internet Economics - 14th International Conference, 2018

Alternating Reachability Games with Behavioral and Revenue Objectives.
Proceedings of the LPAR-22. 22nd International Conference on Logic for Programming, 2018

The Power of One Secret Agent.
Proceedings of the 9th International Conference on Fun with Algorithms, 2018

2017
Hierarchical Network Formation Games.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

The Efficiency of Best-Response Dynamics.
Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

2016
Load rebalancing games in dynamic systems with migration costs.
Theor. Comput. Sci., 2016

Cost-sharing scheduling games on restricted unrelated machines.
Theor. Comput. Sci., 2016

All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns.
ACM Trans. Algorithms, 2016

Network-formation games with regular objectives.
Inf. Comput., 2016

Resource Allocation Games with Multiple Resource Classes.
Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016

Heuristics for Job Scheduling Reoptimization.
Proceedings of the 2016 Federated Conference on Computer Science and Information Systems, 2016

Real-Time k-bounded Preemptive Scheduling.
Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, 2016

2015
Real-time scheduling to minimize machine busy times.
J. Scheduling, 2015

Convergence of best-response dynamics in games with conflicting congestion effects.
Inf. Process. Lett., 2015

Brief Announcement: Resource Allocation Games with Multiple Resource Classes.
Proceedings of the Algorithmic Game Theory - 8th International Symposium, 2015

Cost-Sharing Scheduling Games on Restricted Unrelated Machines.
Proceedings of the Algorithmic Game Theory - 8th International Symposium, 2015

Congestion Games with Multisets of Resources and Applications in Synthesis.
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

2014
Packing resizable items with application to video delivery over wireless networks.
Theor. Comput. Sci., 2014

Reoptimization of the minimum total flow-time scheduling problem.
SUSCOM, 2014

Approximate Strong Equilibrium in Job Scheduling Games.
CoRR, 2014

Algorithms for Battery Utilization in Electric Vehicles.
Applied Artificial Intelligence, 2014

Scheduling jobs with dwindling resource requirements in clouds.
Proceedings of the 2014 IEEE Conference on Computer Communications, 2014

Properties and Utilization of Capacitated Automata (Invited Talk).
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

Network-Formation Games with Regular Objectives.
Proceedings of the Foundations of Software Science and Computation Structures, 2014

From Reachability to Temporal Specifications in Cost-Sharing Games.
Proceedings of the Automated Reasoning - 7th International Joint Conference, 2014

2013
Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints.
Math. Oper. Res., 2013

Approximate strong equilibria in job scheduling games with two uniformly related machines.
Discrete Applied Mathematics, 2013

Load Rebalancing Games in Dynamic Systems with Migration Costs.
Proceedings of the Algorithmic Game Theory - 6th International Symposium, 2013

All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns.
Proceedings of the Integer Programming and Combinatorial Optimization, 2013

2012
Minimal cost reconfiguration of data placement in a storage area network.
Theor. Comput. Sci., 2012

Windows scheduling of arbitrary-length jobs on multiple machines.
J. Scheduling, 2012

Scheduling with Bully Selfish Jobs.
Theory Comput. Syst., 2012

Approximation schemes for generalized two-dimensional vector packing with application to data placement.
J. Discrete Algorithms, 2012

Conflicting Congestion Effects in Resource Allocation Games.
Operations Research, 2012

Coping with selfish on-going behaviors.
Inf. Comput., 2012

Convergence of Best-Response Dynamics in Games with Conflicting Congestion Effects.
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Reoptimization of the Minimum Total Flow-Time Scheduling Problem.
Proceedings of the Design and Analysis of Algorithms, 2012

A Theory and Algorithms for Combinatorial Reoptimization.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Online Algorithm for Battery Utilization in Electric Vehicles.
Proceedings of the Federated Conference on Computer Science and Information Systems, 2012

Packing Resizable Items with Application to Video Delivery over Wireless Networks.
Proceedings of the Algorithms for Sensor Systems, 2012

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

2010
Minimizing total busy time in parallel scheduling with application to optical networks.
Theor. Comput. Sci., 2010

Algorithms for storage allocation based on client preferences.
J. Comb. Optim., 2010

Transactional Contention Management as a Non-Clairvoyant Scheduling Problem.
Algorithmica, 2010

Coping with Selfish On-Going Behaviors.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

Scheduling with Bully Selfish Jobs.
Proceedings of the Fun with Algorithms, 5th International Conference, 2010

Minimizing Busy Time in Multiple Machine Real-time Scheduling.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

2009
Periodic scheduling with obligatory vacations.
Theor. Comput. Sci., 2009

Paging with Request Sets.
Theory Comput. Syst., 2009

Approximate Strong Equilibrium in Job Scheduling Games.
J. Artif. Intell. Res., 2009

Minimal Cost Reconfiguration of Data Placement in Storage Area Network.
Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009

Maximizing submodular set functions subject to multiple linear constraints.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Minimizing total busy time in parallel scheduling with application to optical networks.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

2008
Optimal delay for media-on-demand with pre-loading and pre-buffering.
Theor. Comput. Sci., 2008

Approximation Schemes for Packing with Item Fragmentation.
Theory Comput. Syst., 2008

A general buffer scheme for the windows scheduling problem.
ACM Journal of Experimental Algorithmics, 2008

Scheduling Techniques for Media-on-Demand.
Algorithmica, 2008

Conflicting Congestion Effects in Resource Allocation Games.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Approximate Strong Equilibrium in Job Scheduling Games.
Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

2007
Polynomial-Time Approximation Schemes.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Windows scheduling as a restricted version of bin packing.
ACM Trans. Algorithms, 2007

Real-Time Scheduling with a Budget.
Algorithmica, 2007

2006
Semi-matchings for bipartite graphs and load balancing.
J. Algorithms, 2006

Paging with Request Sets.
Proceedings of the Algorithm Theory, 2006

Optimal Delay for Media-on-Demand with Pre-loading and Pre-buffering.
Proceedings of the Structural Information and Communication Complexity, 2006

Transactional contention management as a non-clairvoyant scheduling problem.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

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

A General Buffer Scheme for the Windows Scheduling Problem.
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

Approximation Schemes for Packing with Item Fragmentation.
Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

Windows scheduling of arbitrary length jobs on parallel machines.
Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005

Beyond VCG: Frugality of Truthful Mechanisms.
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

Fairness-Free Periodic Scheduling with Vacations.
Proceedings of the Algorithms, 2005

2004
Tight bounds for online class-constrained packing.
Theor. Comput. Sci., 2004

Windows scheduling as a restricted version of Bin Packing.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2003
Semi-matchings for Bipartite Graphs and Load Balancing.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Scheduling techniques for media-on-demand.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Approximation Schemes for Generalized 2-Dimensional Vector Packing with Application to Data Placement.
Proceedings of the Approximation, 2003

Real-Time Scheduling with a Budget.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002
Multiprocessor Scheduling with Machine Allotment and Parallelism Constraints.
Algorithmica, 2002

Tight Bounds for Online Class-Constrained Packing.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

Minimizing Makespan and Preemption Costs on a System of Uniform Machines.
Proceedings of the Algorithms, 2002

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

2000
Polynominal time approximation schemes for class-constrained packing problem.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2000

1999
Local Labeling and Resource Allocation Using Preprocessing.
SIAM J. Comput., 1999

1998
On Chromatic Sums and Distributed Resource Allocation.
Inf. Comput., 1998

1996
On Chromatic Sums and Distributed Resource Allocation.
Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996

1994
Local Labeling and Resource Allocation Using Preprocessing.
Proceedings of the Distributed Algorithms, 8th International Workshop, 1994


  Loading...