(some abstracts and papers are available here )
· Journal Articles
o M. Feldman and T. Tamir, Conflicting Congestion Effects in Resource Allocation Games. Journal of Operation Research. To appear.
o O. Kupferman and T. Tamir, Coping with Selfish On-going Behaviors. Information and Computation. To appear.
o T. Tamir, Scheduling with Bully Selfish Jobs. Theory of Computing Systems (special issue of Fun 2010). vol.50, Issue 1, pages 124-146, 2012.
o H. Shachnai, and T. Tamir, Approximation Schemes for Generalized 2-dimensional Vector Packing with Application to Data Placement, Journal of Discrete Algorithms, To appear.
o 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.
o A. Bar-Noy, R.E. Ladner, T. Tamir, and T. VanDeGrift, Windows Scheduling of Arbitrary Length Jobs on Parallel Machines, Journal of Scheduling. To appear.
o H. Attiya, L. Epstein, H. Shachnai, and T. Tamir, Transactional Contention Management as a Non-Clairvoyant Scheduling Problem. Algorithmica, vol. 57, Issue 1, 2010.
o M. Feldman and T. Tamir, Approximate Strong Equilibrium in Job Scheduling Games. Journal of Artificial Intelligence Research, vol. 36. pages 387-414, 2009.
o 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
o J. Sgall, H. Shachnai, and T. Tamir, Periodic Scheduling with Obligatory Vacations, Theoretical Computer Science. vol. 410 (47-49), pages 5112-5121, 2009.
o A. Bar-Noy, R.E. Ladner, and T. Tamir, Scheduling Techniques for Media on Demand. Algorithmica , vol. 52(4), pages 413-439. 2008.
o L. Epstein, R. van Stee, and T. Tamir, Paging with Request Sets. ACM Transactions on Computer Systems. vol. 44, pages 67–81, 2009.
o 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.
o 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.
o 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
o 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.
o 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.
o 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.
o 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 .
o 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
o H. Shachnai and T. Tamir, Multiprocessor Scheduling with Machine Allotment and Parallelism Constraints, Algorithmica., vol. 32(4), pp. 651-678, 2002.
o 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.
o H. Shachnai and T. Tamir, On Two Class-Constrained Versions of the Multiple Knapsack Problem, Algorithmica, vol. 29, pp. 442-467, 2001.
o 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.
o 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.
Journal Articles (Submitted)
o
A. Kulik, H. Shachnai, and T.Tamir,
Approximations for Monotone and Non-monotone Submodular Maximization
with Knapsack Constraints. Submitted to
Mathematics of Operations Research.
o H. Shachnai, G. Tamir and T. Tamir, Minimal Cost Reconfiguration of Data Placement in Storage Area Network. Submitted to Theoretical Computer Science.
o 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. Submitted to Discrete Applied Mathematics.
Conference Papers
o 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), 2010.
o T. Tamir, Scheduling with Bully Selfish Jobs. The 5th International Conference on FUN with Algorithms (FUN), June 2010.
o 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.
o 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.
o 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.
o 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.
o M. Feldman and T. Tamir, Conflicting Congestion Effects in Resource Allocation Games. The 4th International Workshop on Internet And Network Economics (WINE), December 2008.
o M. Feldman and T. Tamir, Approximate Strong Equilibrium in Job Scheduling Games. The 1st International Symposium on Algorithmic Game Theory (SAGT), April 2008.
o T. Tamir and B. Vaksendiser, Algorithms for Storage Allocation Based on Client Preferences. The International Symposium on Combinatorial Optimization (CO), March 2008.
o 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.
o L. Epstein, R. van Stee, and T. Tamir, Paging with Request Sets. The 10th Scandinavian Workshop on Algorithm Theory (SWAT), July 2006.
o 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.
o 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.
o 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.
o J. Sgall, H. Shachnai, and T. Tamir, Fairness-Free Periodic Scheduling with Vacations, The 13th Annual European Symposium on Algorithms (ESA), October 2005.
o 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.
o 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.
o 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.
o 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.
o 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.
o 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.
o 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.
o 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.
o H. Shachnai and T. Tamir, Tight Bounds for Online Class-Constrained Packing, The 5th Latin American Theoretical INformatics symposium (LATIN), April 2002.
o 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.
o T.Tamir. Storage Management for Continuous Media Data, The 13th International Symposium on Computer and Information Sciences (ISCIS), October 1998.
o H. Shachnai and T. Tamir, Noah bagels - Some Combinatorial Aspects, International Conference on FUN with Algorithms (FUN), June 1998.
o 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.
o H. Etsebban and T. Tamir, LiPS, A Static and Dynamic iA Performance Simulator, Intel Software Development Conference (ISDC), October 1995.
o 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
o K. Gottlieb, N. Prat, and T. Tamir, VTune, A Visual Tuning Environment for Windows, Intel application notes, December 1996.
o T. Tamir, Using MMX Technology Instructions for Quick Chroma-Keying, Intel application notes, July 1996.
Patents
o 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
o H. Shachnai and T. Tamir, Polynomial Time Approximation Schemes - A Survey. In Approximation Algorithms and Metaheuristics. Editor: Teofilo F. Gonzalez. 2006.