******************************** *** WEIZMANN-WARWICK MEETING *** ******************************** WHEN: December 5-9, 2010 WHERE: Weizmann Institute of Science (Ziskind building room 261, unless stated otherwise) *** MEETING'S WEBPAGE *** http://www.wisdom.weizmann.ac.il/~robi/seminars/WeizmannWarwickMeeting-2010_12.html *** SUNDAY (algorithmic game theory) *** 10:00 Bus from Tel Aviv 10:30 Coffee 11:00 Yossi Azar, TAU. How to Allocate Goods in an Online Market? 11:30 Troels Sørensen, Warwick. Computational complexity of equilibrium refinements. 12:00 Lunch break 13:30 Michal Feldman, HUJI. Strategyproof approximation mechanisms for location on networks. 14:00 Omer Tamuz, WIS. Truthful Cake Cutting. 14:30 Uriel Feige, WIS. Responsive lotteries. 15:00 Break 15:30 Open Discussion (coffee and cake) 17:00 Reception, wine and cheese (Room: Lobby) 18:30 Bus to Tel Aviv *** MONDAY (sublinear algorithms) *** 09:30 Bus from Tel Aviv 10:30 Coffee 11:00 Gilad Tsur, TAU. Testing Properties of Sparse Images. 11:30 Lee-Ad Gottlieb, HUJI. Fast, precise and dynamic distance queries. 12:00 Moni Naor, WIS. Sketching in adversarial environments. 12:30 Lunch break 14:30 Artur Czumaj, Warwick. Testing properties in arbitrary planar graphs via random walks. 15:30 Break 16:00 Open Discussion (coffee and cake) 18:00 Bus to Tel Aviv *** TUESDAY *** 09:30 Bus from Tel Aviv 10:30 Coffee 11:00 Mike Paterson, Warwick. Overhang 12:15 Group Photo (Lobby) 12:20 Lunch break 14:00 Excursion to Jerusalem (by Bus) 19:30 Joint dinner in Jerusalem 21:30 Bus to Rehovot/Tel Aviv *** WEDNESDAY (network algorithms) *** 09:30 Bus from Tel Aviv 10:30 Coffee 11:00 Michael Dinitz, WIS. Directed Spanners via Flow-Based Linear Programs. 11:30 Roy Schwartz, TEC. Balanced Graph Partitioning. 12:00 Oren Weimann, WIS. The replacement paths problem. 12:30 Lunch break 14:00 Matthias Englert, Warwick. Almost Tight Bounds for Reordering Buffer Management. 14:30 Shiri Chechik, WIS. Forbidden-Set Distance Labels for Graphs of Bounded Doubling Dimension. 15:00 Merav Parter, WIS. Distributed Power Control in the SINR Model. 15:30 Break 16:00 Open Discussion (coffee and cake) 18:00 Bus to Tel Aviv *** THURSDAY (random discrete structures) *** 09:30 Bus from Tel Aviv 10:30 Coffee 11:00 Amin Coja-Oghlan, Warwick. Phase transitions and computational complexity. 12:00 Lunch break 14:00 Michael Krivelevich, TAU. Packing Hamilton cycles in random and pseudo-random hypergraphs 14:30 Elchanan Mossel, WIS. Correlation and Agreement on randomness. 15:00 Break 16:00 Open Discussion (coffee and cake) 18:00 Bus to Tel Aviv