FILOFOCS stands for "French-Israeli Laboratory on Foundations of Computer Science". It is an associated research laboratory (LEA) of the CNRS and Tel-Aviv University, with LIAFA and the School of Computer Science of Tel-Aviv University being the main partners. The annual FILFOCS workshops alternate between France and Israel. This year, in addition to talks by members of the LEA, there will be a number of talks by invited speakers.
Previous workshops:
Registration is mandatory and is now closed. If you would still like to attend the workshop and missed the registration deadline, please contact Adi Rosén or Marc Renault about the possibility of a late registration.
Tuesday May 20:
Amphi Hermite, Institut Henri Poincaré, Paris 5ème
Wednesday May 21:
Amphi Hermite, Institut Henri Poincaré, Paris 5ème
Thursday May 22:
Amphi Turing, Bâtiment Sophie Germain, Université Paris Diderot, Paris 13ème
Access:
- Amphi Hermite, Institut Henri Poincaré, Paris 5ème
- Amphi Turing and LIAFA, Bâtiment Sophie Germain, Université Paris Diderot, Paris 13ème
Program PDF Version with Abstracts
9:00 - 9:15 | Registration |
9:15 - 9:30 | Opening Remarks |
9:30 - 10:15 | Invited Talk: Noam Nisan - Economic Efficiency Requires Interaction |
10:15 - 10:45 | Coffee break |
10:45 - 11:15 | Fabio Pardi - Phylogenetic networks: what can we reconstruct? |
11:15 - 11:45 | Gregory Kucherov - Cascading Bloom filters applied to genome reconstruction |
11:45 - 12:15 | Alessandra Carbone - Conservation and co-evolution: from sequence analysis to proteinprotein interactions |
12:15 - 12:45 | Benny Chor - New facets of conservation in biological sequences |
12:45 - 14:15 | Lunch (To be found in restaurants around. Please see our list of restaurants.) |
14:15 - 15:00 | Invited Talk: Haim Kaplan - Two fruitful interactions of theory and practice: max flow and biased search trees |
15:00 - 15:30 | Iordanis Kerenidis - Random Access Codes and Non-Locality |
15:30 - 16:00 | Coffee break |
16:00 - 16:30 | Mikos Santha - Generalized Wong sequences and their applications to Edmonds' problems |
16:30 - 17:00 | Shai Vardi - Local Computation Mechanism Design - Stable Matching |
9:00 - 9:30 | Guy Even - Deterministic Rateless Codes for BSC |
9:30 - 10:15 | Invited Talk: Claire Mathieu - On the Glass Ceiling Effect in Social Networks |
10:15 - 10:45 | Coffee break |
10:45 - 11:15 | Frédéric Magniez - Unidirectional Input/Output Streaming Complexity of Reversal and Sorting |
11:15 - 11:45 | Adi Rosén - Semi-Streaming Set Cover |
11:45 - 12:15 | Moti Medina - Best of Two Local Models: Local Centralized and Local Distributed Algorithms |
12:15 - 14:15 | Lunch (To be found in restaurants around. Please see our list of restaurants.) |
14:15 - 15:00 | Invited Talk: Irit Dinur - On the complexity of correlated inputs |
15:00 - 15:30 | Michal Feldman - Beyond Walrasian equilibrium |
15:30 - 16:00 | Coffee break |
16:00 - 16:30 | Tova Milo - Query directed crowd mining |
16:30 - 17:00 | Serge Abiteboul - Introducing Access Control in Webdamlog |
17:00 - 17:30 | Invited Talk: Allan Borodin - A myopic model for the non-monotone submodular maximization problem |
18:30 - 21:00 | Reception (cocktail dînatoire) - on the ground floor of the IHP |
9:00 - 9:30 | Yossi Azar - Single parameter mechanism for unrelated machine scheduling |
9:30 - 10:15 | Invited Talk: David Peleg - Elite and Periphery in Social Networks: An Axiomatic Approach |
10:15 - 10:45 | Coffee break |
10:45 - 11:15 | Amos Korman - Breathe before Speaking: Efficient Information Dissemination Despite Noisy, Limited and Anonymous Communication |
11:15 - 11:45 | Pierre Fraigniaud - On local distributed decision |
11:45 - 12:15 | Amos Fiat - A Double Exponential improvement over the cost of Free Parking |
12:15 - 14:15 | Lunch (To be found in restaurants around. Please see our list of restaurants.) |
14:15 - 15:00 | Invited Talk: Pascal Koiran - A τ-conjecture for Newton polygons |
15:00 - 15:30 | Uri Zwick - Adjacency labeling schemes and induced-universal graphs |
15:30 - 16:00 | Cakes and coffee |