Tami Tamir

 

School of Computer Science.   
Reichman University (IDC), Herzliya 

• Personal Details
• Academic Degrees
• Academic Appointments
• Professional Experience
• Teaching Experience
• Awards and Honors
• Publications

---

Personal Details

• Work Address: School of Computer Science, Reichman University (IDC), Herzliya, Israel.

• Work Phone:  (09) 9602-779

• Home Address: 13 Wingate st. Zichron-Yaacov

• E-Mail: tami @ runi.ac.il

• URL: https://cs.idc.ac.il/~tami/

• Date of Birth: July 1. 1968.

• Other:  Married + 3.

---

Academic Degrees  

• 2001: Ph.D. in Computer Science, Technion IIT, Israel.
  Research topic: Class-constrained Resource Allocation Problems.  

• 1995: M.Sc. in Computer Science, Technion IIT, Israel.
  Research topic:  Local Labeling and Resource Allocation Using Preprocessing.  

• 1992: B.A. in Computer Science, Technion IIT, Israel.

---

Academic Appointments

• 2004-present  
  Efi Arazi School of Computer Science, Reichman University (IDC), Herzliya, Israel.   
  Services:  Vice-dean: Oct. 2008 - Sept. 2012,   
                    Dean: Oct. 2012 - Sept. 2017.

• Summer 2017, Summer 2019     
  Lecturer, Peking University (PKU), Beijing, China. 

• 2002 - 2004   
  Post-doc and lecturer, Department of Computer Science and Engineering, University of Washington, Seattle.

• 2001 - 2002    
  Research fellow and lecturer, Computer Science Department, Technion IIT, Israel. 

• 1997 - 2001, 2005-2012.
  Adjunct teacher, Computer Science Department, Technion IIT, Israel.

• 1991 - 1994
  Teaching assistant, Computer Science Department, Technion IIT, Israel.

---

Professional Experience

• 1994-1997
  The Performance Enhancement Group, Intel, Israel Software Lab.
  I participated in the design and development of the Pentium-MMx Processor, and in the development of VTune, a performance analyzer for windows.
   

• Summer 1997
  Hewlett-Packard, Palo-Alto, California.
  Development of a Neural-Network for Automatic Extraction of Metadata,

---

Teaching Experience (IDC, Technion, Univ. of Washington, Peking University)

• Lecturer: Algorithms (various advanced and undergrad courses), Algorithmic Game Theory, Data Structures, Automata and Formal Languages, Computational Models and Complexity, Introduction to Computer Science, C Programming, Databases.

---

Awards, Grants, and Honors

• Best Paper Award (with M. Schröder and V.R.Vijayalakshmi). The 13th International Conference on Game Theory for Networks (GameNets), 2025.

• Best Paper Award (with Michael Rapoport). The 12th International Workshop on Computational Optimization (WCO), 2019.

• IDC's excellence in teaching award, 2017.

• Israel Science Foundation (ISF) 4-year grant. 2017-2021.

• Best Student Paper Award (with Ron Adany). The 7th International Symposium on Advances in Artificial Intelligence and Applications (AAIA), 2012.

• IDC's excellence in teaching award, 2011.

• Israel Science Foundation (ISF) 4-year grant. Joint with Prof. Hadas Shachnai. 2010-2014.

• IDC's excellence in research award, 2009.

• Israel’s ministry of industry, trade, and labor MAGNET consortium Negev. A 5-years grant. Joint with Prof. Hadas Shachnai. 2006-2011.

• Technion's post-doc scholarship for an outstanding woman scientist, 2002.

• Computer Science faculty award for outstanding teachers, Technion, 2002.

• Technion award for outstanding teachers, 1999-2002 (4 times).

• Vatat (Israeli high-education planning and budgeting committee) scholarship for outstanding high-tech Ph.D students, 2000.

• Special Gutwirth award for outstanding Ph.D student. 1999.

• Technion award for outstanding teaching-assistants, 1994.

• Intel scholarship for outstanding M.Sc. students, 1993.

• Member of the President's list of distinguished students,  The Technion, 1991.

---

Publications

• Journal Articles

1. M. Schröder, T. Tamir, and V.R.Vijayalakshmi, Minimizing total completion time with machine-dependent priority lists.   European Journal of Operational Research. vol. 315(3), pages 844–854, 2024.

2. T. Tamir, Cost-sharing Games in Real-time Scheduling Systems.   International Journal of Game Theory. vol. 52, pages 273–301, 2023.

3. S. Rosner and T. Tamir, Scheduling Games with Rank-Based Utilities.   Games and Economic Behavior. vol. 140, pages 229–252, 2023.

4. O.Dadush and T. Tamir, Using Temporal Dummy Players in Cost-Sharing Games.   Studies in Computational Intelligence. vol. 1044, 2022.

5. E. Georgoulaki, K. Kollias and T. Tamir Equilibrium Inefficiency and Computation in Cost-Sharing Games in Real-Time Scheduling Systems.   Algorithms. vol. 14(4), 2021.

6. M. Schröder, T. Tamir, and V.R.Vijayalakshmi, Scheduling games with machine-dependent priority lists.   Theoretical Computer Science. vol. 855, pages 90–103, 2021.

7. T. Tamir, The Power of One Evil Secret Agent.   Theoretical Computer Science (invited to special issue of FUN'18). vol. 839,  pages 1-12, 2020.

8. E. Iwanir and T. Tamir, Analysis and Experimental Study of Heuristics for Job Scheduling Reoptimization Problems.  Studies in Computational Intelligence. Springer.  vol. 717,  pages 207-233, 2018.

9. H. Shachnai, B. Schieber, G. Tamir and T. Tamir,   A Theory and Algorithms for Combinatorial Reoptimization. Algorithmica. vol. 80(2), pages 576-607, 2018.

10. G. Avni, O. Kupferman and T. Tamir, Network-Formation Games with Regular Objectives. Journal of Information and Computation. vol. 251, pages 165-178, 2016.

11. G. Avni and T. Tamir, Cost-Sharing Scheduling Games on Restricted Unrelated Machines. Theoretical Computer Science.vol. 646, pages 26–39, 2016.

12. S. Belikovetsky and T. Tamir, Load Rebalancing Games in Dynamic Systems with Migration Costs. Theoretical Computer Science. vol. 622(C), pages 16-33, 2016.

13. R. Adany, M. Feldman, E. Haramaty, R. Khandekar, B. Schieber, R. Schwartz, H. Shachnai and T. Tamir, All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns. Transactions on Algorithms. vol. 12(3), pages 38:1-38:25, 2016

14. R. Khandekar, B. Schieber, H. Shachnai and T. Tamir, Real-time Scheduling to Minimize Machine Busy Times. Journal of Scheduling.  vol. 18(6), page 561-573, 2015.

15. M. Feldman and T. Tamir, Convergence of Best-Response Dynamics in Games with Conflicting Congestion Effects. Information Processing Letters.  vol. 115(2),  pages 112-118, 2015.

16. G. Baram and T. Tamir, Reoptimization of the Minimum Total Flow-Time Scheduling Problem.  Sustainable Computing, Informatics and Systems (special issue on Energy-Aware Resource Management and Scheduling). vol. 4(4), pages 241–251, 2014.

17. R. Adany, and T. Tamir, Algorithms for Battery Utilization in Electric Vehicles. Applied Artificial Intelligence (invited to special issue of AAIA'12). vol. 28 (3), pages 272-291, 2014.

18. S. Albagli-Kim, L. Epstein, H. Shachnai and T. Tamir, Packing Resizable Items with Application to Video Delivery over Wireless Networks. Theoretical Computer Science (invited to special issue of ALGOSENSORS 2012). vol. 553, pages 91-105,  2014.

19. A. Kulik, H. Shachnai, and T. Tamir, Approximations for Monotone and Non-monotone Submodular Maximization with Knapsack Constraints. Mathematics of Operations Research. vol. 38 (4), pp. 729-739, 2013.

20. L. Epstein, M. Feldman, T. Tamir, L. Witkowski and M. Witkowski,  Approximate Strong Equilibria in Job Scheduling Games: an Analysis for Two Uniformly Related Machines.  Discrete Applied Mathematics. vol. 161 (13-14), pages 1843-1858, 2013.

21. M. Feldman and T. Tamir, Conflicting Congestion Effects in Resource Allocation Games. Journal of Operation Research. vol. 60(3), pages 529-540, 2012. 

22. H. Shachnai, G. Tamir and T. Tamir,  Minimal Cost Reconfiguration of Data Placement in Storage Area Network. Theoretical Computer Science. vol. 460, pages 42-53, 2012.

23. O. Kupferman and T. Tamir, Coping with Selfish On-going Behaviors.  Information and Computation. vol. 210, pages 1-12, 2012.

24. T. Tamir, Scheduling with Bully Selfish Jobs.  Theory of Computing Systems (invited to special issue of Fun 2010). vol 50(1), pages 124-146, 2012.

25. H. Shachnai, and T. Tamir, Approximation Schemes for Generalized 2-dimensional Vector Packing with Application to Data Placement, Journal of Discrete Algorithms, vol. 10(1),  pages. 35 - 48, 2012.

26. M. Flammini, G. Monaco,  L. Moscardelli , H. Shachnai, M. Shalom, T. Tamir and S. Zaks. Minimizing Total Busy Time in Parallel Scheduling with Application to Optical Networks, Theoretical Computer Science. vol. 411 (40-42), pages 3553-3562, 2010.

27. A. Bar-Noy,  R.E. Ladner,  T. Tamir, and T. VanDeGrift,  Windows Scheduling of Arbitrary Length Jobs on Parallel Machines, Journal of Scheduling. vol. 15(2), pages 141-155, 2012.

28. H. Attiya, L. Epstein, H. Shachnai, and T. Tamir, Transactional Contention Management as a Non-Clairvoyant Scheduling Problem.  Algorithmica,  vol. 57(1), 2010.

29. M. Feldman and T. Tamir, Approximate Strong Equilibrium in Job Scheduling Games.  Journal of Artificial Intelligence Research, vol. 36. pages 387-414, 2009.

30. T. Tamir and B. Vaksendiser, Algorithms for Storage Allocation Based on Client Preferences, Journal of Combinatorial Optimization (special issue of CO 2008). vol 19, pages 304-324. 2010

31. J. Sgall,  H. Shachnai, and  T. Tamir,  Periodic Scheduling with Obligatory Vacations,  Theoretical Computer Science. vol. 410 (47-49), pages 5112-5121, 2009.

32. A. Bar-Noy, R.E. Ladner, and T. Tamir, Scheduling Techniques for Media on Demand. Algorithmica, vol. 52(4), pages 413-439. 2008.

33. L. Epstein, R. van Stee, and T. Tamir, Paging with Request Sets.  ACM Transactions on Computer Systems. vol. 44, pages  67–81, 2009.

34. A. Bar-Noy,  J. Christensen, R.E. Ladner, and T. Tamir, A General Buffer Scheme for the Windows Scheduling Problem, ACM J. Experimental Algorithmics. vol. 13, 2009.

35. A. Bar-Noy, R.E. Ladner, and T. Tamir, Optimal Delay for Media-on-Demand with Pre-loading and Pre-buffering.  Theoretical Computer Science (invited to special issue of SIROCCO 2006). vol. 399, pages 3–11, 2008.

36. H. Shachnai, T. Tamir, and O. Yehezkely, Approximation Schemes for Packing with Item Fragmentation. Theory of Computing Systems (invited to special issue of WAOA 2005). vol 43(1), pages 81-98, 2008

37. J. Naor, H. Shachnai, and T. Tamir, Real-time Scheduling with a Budget.  Algorithmica (invited to special issue of ICALP 2003) vol. 47, pages 343-364, 2007.

38. A. Bar-Noy, R.E. Ladner, and T. Tamir, Windows Scheduling as a Restricted Version of Bin-packing, ACM Transactions on Algorithms. vol. 3(3), 2007.

39. N. J. Harvey, R.E. Ladner, L. Lovasz, and T. Tamir, Semi-matchings for Bipartite Graphs and Load Balancing, Journal of Algorithms, vol. 59(1): 53-78, 2006.

40. H. Shachnai, T. Tamir and G.J. Woeginger, Minimizing Makespan and Preemption Costs on a System of Uniform Machines,  Algorithmica (invited to special issue of ESA 2002) vol. 42, pages 309-334, 2005 .

41. H. Shachnai and T. Tamir, Tight Bounds for Online Class-Constrained Packing,  Theoretical Computer Science (invited to special issue of LATIN 2001), vol. 321(1): 103-123, 2004

42. H. Shachnai and T. Tamir, Multiprocessor Scheduling with Machine Allotment and Parallelism Constraints, Algorithmica, vol. 32(4), pp. 651-678, 2002.

43. H. Shachnai and T. Tamir, Polynomial Time Approximation Schemes for Class-Constrained Packing Problems, Journal of Scheduling (invited to special issue of CONF 2000), vol. 4(6), pp. 313-338, 2001.

44. H. Shachnai and T. Tamir, On Two Class-Constrained Versions of the Multiple Knapsack Problem, Algorithmica, vol. 29, pp. 442-467, 2001.

45. H. Attiya, H. Shachnai, and T. Tamir, Local Labeling and Resource Allocation Using Preprocessing, SIAM Journal on Computing, vol. 28:4, pp. 1397-1414, 1999.

46. A. Bar-Noy, M. Bellare, M.M. Halldorsson, H. Shachnai, and T. Tamir. On Chromatic Sums and Distributed Resource Allocation. Information and Computation, vol. 140, pp. 183-202, 1998.

• Conference Papers

1. G. Lavie and T. Tamir, Coordination Mechanisms with Rank-Based Utilities. The 13th International Conference on Game Theory for Networks (GameNets), March 2025.

2. M. Schröder, T. Tamir, and V.R.Vijayalakshmi, Interval Scheduling Games. The 13th International Conference on Game Theory for Networks (GameNets), March 2025.

3. S. Rosner and T. Tamir, Entrepreneurship Facility-Activation Games. The 16th Intl. Symposium on Algorithmic Game Theory (SAGT), September 2023.

4. N.Stein and T. Tamir, Stackelberg Strategies for Weighted Load Balancing Games. The 17th Conference on Computer Science and Intelligence Systems (FedCSIS), September 2022.

5. S. Rosner and T. Tamir, Cost-Sharing Games with Rank-Based Utilities. The 15th Intl. Symposium on Algorithmic Game Theory (SAGT), September 2022.

6. M. Sinai and T. Tamir, Minimizing Tardiness in a Scheduling Environment with Jobs Hierarchy. The 16th Conference on Computer Science and Intelligence Systems (FedCSIS), September 2021.

7. O. Dadush and T. Tamir, Achieving Good Nash Equilibrium by Temporal Addition of Dummy Players. The 16th Conference on Computer Science and Intelligence Systems (FedCSIS), September 2021.

8. S. Rosner and T. Tamir, Race Scheduling Games. The 13th Intl. Symposium on Algorithmic Game Theory (SAGT), September 2020.

9. E. Georgoulaki, K. Kollias and T. Tamir , Equilibrium Inefficiency in Resource Buying Games with Load-Dependent Costs. The 13th Intl. Symposium on Algorithmic Game Theory (SAGT), September 2020.

10. M. Schröder, T. Tamir, and V.R.Vijayalakshmi, Scheduling Games with Machine-Dependent Priority Lists .The 15th Conference on Web and Internet Economics (WINE), December 2019.

11. M. Rapoport and T. Tamir, Best Response Dynamics for VLSI Physical Design Placement . The 14th Conference on Computer Science and Intelligence Systems (FedCSIS), September 2019.

12. T. Tamir, Cost-Sharing Games in Real-Time Scheduling Systems . The 14th Conference on Web and Internet Economics (WINE), December 2018.

13. O. Kupferman  and T. Tamir, Alternating Reachability Games with Behavioral and Revenue Objectives. The 22nd International Conference on Logic for Programming Artificial Intelligence and Reasoning (LPAR), November 2018.

14. T. Tamir, The Power of One Secret Agent. The 9th International Conference on Fun with Algorithms (FUN), June 2018.

15. M. Feldman, Y. Snappir, and T. Tamir, The Efficiency of Best-Response Dynamics.  The 10th International Symposium on Algorithmic Game Theory (SAGT), September 2017.

16. O. Kupferman  and T. Tamir, Hierarchical Network Formation Games.  The 23rd International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), April 2017.

17. E. Iwanir and T. Tamir, Heuristics for Job Scheduling Reoptimization. The 9th International Workshop on Computational Optimization (WCO), September 2016.

18. R. Ofer and T. Tamir, Resource Allocation Games with Multiple Resource Classes. The 14th Workshop on Approximation and Online Algorithms (WAOA), August 2016.

19. S. Albagli-Kim, H. Shachnai, B. Schieber and T. Tamir, Real-Time k-bounded Preemptive Scheduling. ACM-SIAM meeting on Algorithm Engineering and Experiments (ALENEX), January 2016.

20. G. Avni, O. Kupferman and T. Tamir, Congestion Games with Multisets of Resources and Applications in Synthesis. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), December 2015.

21. G. Avni and T. Tamir, Cost-Sharing Scheduling Games on Restricted Unrelated Machines. The 8th  International Symposium on Algorithmic Game Theory (SAGT), September 2015.

22. R. Ofer and T. Tamir, Brief Announcement: Resource Allocation Games with Multiple Resource Classes. The 8th  International Symposium on Algorithmic Game Theory (SAGT), September 2015.

23. O. Kupferman and T. Tamir, Properties and Utilization of Capacitated Automata. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), December 2014.

24. G. Avni, O. Kupferman and T. Tamir, From Reachability to Temporal Specifications in Game Theory. The 7th International Joint Conference on Automated Reasoning (IJCAR), July 2014.

25. S. Albagli-Kim, H. Shachnai and T. Tamir,  Scheduling Jobs with Dwindling Resource Requirements in Clouds. The 33rd Annual IEEE International Conference on Communications (INFOCOM), May 2014.

26. G. Avni, O. Kupferman and T. Tamir, Network-Formation Games with Regular Objectives. The17th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS), April 2014.

27. S. Belikovetsky and T. Tamir, Load Rebalancing Games in Dynamic Systems with Migration Costs. The 6th  International Symposium on Algorithmic Game Theory (SAGT), October 2013.

28. R. Adany, M. Feldman, E. Haramaty, R. Khandekar, B. Schieber, R. Schwartz, H. Shachnai and T. Tamir, All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns. The 16th Conference on Integer Programming and Combinatorial Optimization (IPCO), March 2013.

29. M. Feldman and T. Tamir, Convergence of Best-Response Dynamics in Games with Conflicting Congestion Effects. The 8th Workshop on Internet & Network Economics (WINE), December 2012.

30. G. Baram and T. Tamir, Reoptimization of the Minimum Total Flow-Time Scheduling Problem. The 1st Mediterranean Conference on Algorithms (MedAlg), December 2012.

31. S. Albagli-Kim, L. Epstein, H. Shachnai and T. Tamir, Packing Resizable Items with Application to Video Delivery over Wireless Networks. The 8th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS), September 2012.

32. R. Adany and T. Tamir, Online Algorithm for Battery Utilization in Electric Vehicles. The 7th International Symposium Advances in Artificial Intelligence and Applications (AAIA), September 2012.

33. H. Shachnai, G. Tamir and T. Tamir,  A Theory and Algorithms for Combinatorial Reoptimization. The 10th Latin American Theoretical INformatics symposium (LATIN), April 2012.

34. R. Khandekar, B. Schieber, H. Shachnai and T. Tamir, Minimizing Busy Time in Multiple Machine Real-time Scheduling. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), December 2010.

35. T. Tamir, Scheduling with Bully Selfish Jobs. The 5^th International Conference on FUN with Algorithms (FUN), June 2010.

36. O. Kupferman and T. Tamir, Coping with Selfish On-going Behaviors. The 16th  International Conferences on Logic for Programming, Artificial Intelligence and Reasoning (LPAR), April, 2010.

37. H. Shachnai, G. Tamir and T. Tamir,  Minimal Cost Reconfiguration of Data Placement in Storage Area Network. The 7th Workshop on Approximation and Online Algorithms (WAOA), September 2009.

38. M. Flammini, G. Monaco,  L. Moscardelli , H. Shachnai, M. Shalom, T. Tamir and S. Zaks. Minimizing Total Busy Time in Parallel Scheduling with Application to Optical Networks, 23rd IEEE International Parallel and Distributed Processing Symposium (IPDPS) . May 2009.

39. A. Kulik, H. Shachnai, and T. Tamir, Maximizing Submodular Set Functions Subject to Multiple Linear Constraints. The 20th ACM-SIAM Symposium on Discrete Algorithms (SODA), January 2009.

40. M. Feldman and T. Tamir, Conflicting Congestion Effects in Resource Allocation Games. The 4th International Workshop on Internet And Network Economics (WINE), December 2008.

41. M. Feldman and T. Tamir, Approximate Strong Equilibrium in Job Scheduling Games. The 1st  International Symposium on Algorithmic Game Theory (SAGT), April 2008.

42. T. Tamir and B. Vaksendiser, Algorithms for Storage Allocation Based on Client Preferences. The International Symposium on Combinatorial Optimization (CO), March 2008.

43. H. Attiya, L. Epstein, H. Shachnai, and T. Tamir, Transactional Contention Management as a Non-Clairvoyant Scheduling Problem. The 25th Annual ACM Symposium on Principles of Distributed Computing (PODC), July 2006.

44. L. Epstein, R. van Stee, and T. Tamir, Paging with Request Sets.  The 10th Scandinavian Workshop on Algorithm Theory (SWAT), July 2006.

45. A. Bar-Noy, R.E. Ladner, and T. Tamir, Optimal Delay for Media-on-Demand with Pre-loading and Pre-buffering.  The13th Colloquium on Structural Information and Communication Complexity (SIROCCO), July 2006.

46. A.R. Karlin, D. Kempe, and T. Tamir,  Beyond VCG: Frugality of Truthful Mechanisms,  The 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS), October 2005.

47. H. Shachnai, T. Tamir, and O. Yehezkely, Approximation Schemes for Packing with Item Fragmentation. The 3rd Workshop on Approximation and Online Algorithms (WAOA), October 2005.

48. J. Sgall,  H. Shachnai, and  T. Tamir,  Fairness-Free Periodic Scheduling with Vacations, The 13th Annual European Symposium on Algorithms (ESA), October 2005.

49. A. Bar-Noy,  R.E. Ladner,  T. Tamir, and T. VanDeGrift,  Windows Scheduling of Arbitrary Length Jobs on Parallel Machines, The 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), July 2005.

50. A. Bar-Noy,  J. Christensen, R.E. Ladner, and T. Tamir, A General Buffer Scheme for the Windows Scheduling Problem, The 4th International Workshop on Efficient and Experimental Algorithms (WEA), May 2005.

51. A. Bar-Noy, R.E. Ladner, and T. Tamir, Windows Scheduling as a Restricted Version of Bin-packing, The 15th ACM-SIAM Symposium on Discrete Algorithms (SODA), January 2004.

52. H. Shachnai, and T. Tamir, Approximation Schemes for Generalized 2-dimensional Vector Packing with Application to Data Placement, The 6th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX), August 2003.

53. N. J. Harvey, R.E. Ladner, L. Lovasz, and T. Tamir, Semi-matchings for Bipartite Graphs and Load Balancing, Workshop on Algorithms and Data Structures (WADS), August 2003.

54. J. Naor, H. Shachnai, and T. Tamir, Real-time Scheduling with a Budget, The 13th International Colloquium on Automata, Languages and Programming (ICALP), July 2003.

55. A. Bar-Noy, R.E. Ladner, and T. Tamir, Scheduling Techniques for Media on Demand., The 14th ACM-SIAM Symposium on Discrete Algorithms (SODA), January 2003.

56. H. Shachnai, T. Tamir, and G.J. Woeginger, Minimizing Makespan and Preemption Costs on a System of Uniform Machines., The 10th European Symposium on Algorithms (ESA), September 2002.

57. H. Shachnai and T. Tamir, Tight Bounds for Online Class-Constrained Packing, The 5th Latin American Theoretical INformatics symposium (LATIN), April 2002.

58. H. Shachnai and T. Tamir, Polynomial Time Approximation Schemes for Class-Constrained Packing Problems, The 3rd International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX), September 2000.

59. T. Tamir. Storage Management for Continuous Media Data, The 13th International Symposium on Computer and Information Sciences (ISCIS), October 1998.

60. H. Shachnai and T. Tamir, Noah bagels - Some Combinatorial Aspects, International Conference on FUN with Algorithms (FUN), June 1998.

61. A. Bar-Noy, H. Shachnai, and T. Tamir, On Chromatic Sums and Distributed Resource Allocation, The 4th Israel Symposium on Theory and Computing Systems (ISTCS), June 1996.

62. H. Etsebban and T. Tamir, LiPS, A Static and Dynamic iA Performance Simulator, Intel Software Development Conference (ISDC), October 1995.

63. H. Attiya, H. Shachnai, and T. Tamir, Local Labeling and Resource Allocation Using Preprocessing, The 8th International Workshop on Distributed Algorithms (WDAG), LNCS 857, pp. 194-208, September 1994.

• Research Reports

• K. Gottlieb, N. Prat, and T. Tamir, VTune, A Visual Tuning Environment for Windows, Intel application notes, December 1996.

• T. Tamir, Using MMX Technology Instructions for Quick Chroma-Keying,  Intel application notes, July 1996.

• Patents

• O. Shmueli, C. Staelin, D. Greig, and T. Tamir, Automatic Extraction of Meta-Data Using a Neural Network.  Patent number: US06044375, March 2000.

• Book chapters

• H. Shachnai and T. Tamir,  Polynomial Time Approximation Schemes - A Survey. In Approximation Algorithms and Metaheuristics. Editor: Teofilo F. Gonzalez. 2006 (2nd edition, 2018).