Advanced Algorithms Seminar

Welcome to the advanced algorithms seminar webpage. Previous seminar lectures can be found here and here.

Below is a table of past and future speakers.
All lectures begin at 11:10 on Mondays in Schreiber 309. Lectures usually last 60 minutes.

Spring semester

Week number	Date	Speaker	Affiliation	Topic	Abstract
1	March 4, 2013	Yair Dombb	Bar Ilan University	Social Efficiency in Cake Cutting	abstracts2013
2	March 11, 2013	Ratnik Gandhi	TAU	Nash equilibria using polynomial algebra	abstracts2013
3	April 8, 2013	Yuval Rochman	TAU	Resource Placement and Assignment in Distributed Network Topologies	abstracts2013
4	April 15, 2013	Moran Feldman	Technion and Microsoft	Submodular Secretary Problems	abstracts2013
5	April 22, 2013	Adi Vardi	TAU	Colored Packets with Deadlines and Metric Space Transition Cost	abstracts2013
6	April 29, 2013	Reshef Meir	HUJI and Microsoft	Efficient Parking Allocation as Online Bipartite Matching with Posted Prices (nominated for best student paper award at AAMAS 13)	abstracts2013
7	May 6, 2013	Ilan Cohen	TAU	Tight Bounds for Online Vector Bin Packing	abstracts2013
8	May 13, 2013	Igor Shinkar	Weizmann Institute	Two-Sided Error Proximity Oblivious Testing	abstracts2013
9	May 20, 2013	Noa Avigdor-Elgrabli	Technion	An Optimal Randomized Online Algorithm for Reordering Buffer Management	abstracts2013
10	May 27, 2013	Moti Medina	TAU (Eng)	A Nonmonotone Analysis with the Primal-Dual Approach: online routing of virtual circuits with unknown durations	abstracts2013
11	June 3, 2013	Rani Izsak	HUJI	-	-
12	June 10, 2013	Leonid Barenboim	BGU	On the Locality of Some NP-Complete Problems	abstracts2013
13	June 17, 2013	Vijay V. Vazirani	Georgia Institute of Technology	Matching - A New Proof for an Ancient Algorithm	abstracts2013
14	June 24, 2013	Idan Maor	TAU	-	-

Past speakers (fall semester)

Week number	Date	Speaker	Affiliation	Topic	Abstract
1	Oct 22, 2012	cancelled	-	-	-
2	Oct 29, 2012	Amitabh Trehan	Technion	Networks that fix themselves aka Self-healing Networks	abstracts2012
3	Nov 5, 2012	Oded Schwartz	UC Berkley	Fast Parallel Matrix Multiplication	abstracts2012
4	Nov 12, 2012	Tsvi Kopelowitz	Weizmann Institute	Predecessor Queries on Dynamic Subsets of an Ordered List, with Application	abstracts2012
5	Nov 19, 2012	Thomas Dueholm Hansen	TAU	Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor	abstracts2012
6	Nov 26, 2012	Niv Buchbinder	TAU	A Polylogarithmic-Competitive Algorithm for the k-Server Problem	abstracts2012
7	Dec 3, 2012	Igal Milchtaich	Bar Ilan University	Representation of Finite Games as Network Congestion Games	abstracts2012
8	Dec 10, 2011	Dan Feldman	MIT, The Distributed Robotics Lab	Learning patterns in Big data from small data using core-sets	abstracts2012
9	Dec 17, 2012	Sarel Cohen	TAU	Minimal Indices for Successor Search	abstracts2012
10	Dec 24, 2012	Eyal Gofer	TAU	Lower Bounds on Individual Sequence Regret	abstracts2012
11	Dec 31, 2012	Mariano Schain	TAU	Robust Domain Adaptation	abstracts2012
12	Jan 7, 2013	Sigal Oren	Cornell U., Microsoft	How Bad is Forming Your Own Opinion?	abstracts2012
13	Jan 14, 2013	Reut Levi	TAU	Testing Properties of Collections of Distributions: Equivalence and Similar Means	abstracts2012
14	Jan 21, 2013	Omry Tuval	TAU	Joint cache partition and job assignment on multicore processors	abstracts2012