Slides of talks

• Online Packet Routing in Grids with Bounded Buffers. Talk in DIMACS Workshop on Competitive Algorithms for Packet Scheduling, Buffering and Routing in the Internet, July 6 - 8, 2011.

• Multi-Hop Routing and Scheduling in Wireless Networks in the SINR Model MS-Journal file. Talk in WRAWN 2011.

• Local Optimality in Tanner Codes . Talk in HP Labs (June 10, 2011).

• Hitting Sets Online. MS-Journal file. Talk in UCB (June 9, 2011) IBM-Watson (July 11, 2011).

• An Improved Micro-Architecture for Function Approximation Using Piecewise Quadratic Interpolation. MS-Journal file. Talk in ICCD-2008, Lake Tahoe, Oct., 2008.

• Linear Programming: a view from the Set-Cover perspective. Originial MS-Journal file. Talk in GK summer school, Gaschurn, Sept., 2008.

• A strongly polynomial algorithm for one-dimensional Markov decision processes . MS-Journal file. Talk presented in Université Paris Sud, April, 2008, IBM-Watson & Google-Manhattan (Oct. 2008), ETHZ & EPFL April, 2009.

• $O(k^{1/2+\varepsilon})$-approximation algorithm for the directed Steiner network problem . Originial MS-Journal file. Talk in Luminy, April, 2008.

• Approximation Algorithms for Capacitated Rectangle Stabbing (this postscript version does not show all markers well and does not view well in landscape). The original MS-Journal file. Talk in CIAC 2006, Rome, May 2006.

• Fast division: concluding the unfinished symphony of computer arithmetic, Talk in TAU's School of Electrical Engineering SEE-NERGIA seminar, November 28th, 2004.

• Pearls of Shimon Even, Talk in memory of my beloved father, The Academic College of Tel-Aviv Yaffo, June 3rd, 2004.

• On approximating a geometric prize-collecting traveling salasman problem with time windows, Max-Planck-Institut für Informatik - July 28, 2003.

• Covering Graphs Using Trees and Stars Third Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics and Computing - May 28, 2003. talk in Max-Planck-Institut für Informatik - July 23, 2003.

• Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks (Max-Planck-Institut für Informatik - August 12, 2002). Talk in Tel-Aviv Univ.

• Conflict-Free Colorings of Unit Disks and Squares (SMU - June 3, 2002. Second Haifa Workshop on Interdisciplinary Applications, of Graph Theory, Combinatorics and Algorithms June 17-20, 2002).

• Faster Functional Modules - lessons taught from FP-Adders, guest lecture, technical seminar, Silicon-Value, March 29, 2002.