FILOFOCS

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 IRIF (previously LIAFA) and the School of Computer Science of Tel-Aviv University being the main partners. The annual FILFOCS workshops alternate between France and Israel.

The Highlights of Algorithms conference (HALG) will take place this year in Paris (June 6-8, 2016) just following the FILOFOCS workshop. If you are interested in attending, please visit the official website for more information.

Previous workshops:

5th FILOFOCS Workshop

Registration

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.

List of Participants

Venue

Amphi Buffon, Bâtiment Buffon, Université Paris Diderot, Paris 13ème

Access:
- Amphi Buffon, Bâtiment Buffon, 4 rue Marie-Andrée Lagroua Weill-Halle, Paris 13ème

- IRIF, Bâtiment Sophie Germain, 8 place Aurélie Nemours, Paris 13ème

General information and restaurant list.

Access Map to Amphi Buffon

Program

Program PDF Version

Program PDF Version with Abstracts

Wednesday, June 1, 2016
9:00 - 9:15Registration
9:15 - 9:30Opening Remarks
9:30 - 10:15Moshe Lewenstein - Orthogonal Range Searching and Text Indexing
10:15 - 10:45Coffee Break
10:45 - 11:30Gregory Kucherov - Recent Results on Computing Repeats in Strings
11:30 - 12:15Carola Doerr - Spotlight on the Analysis of Evolutionary Algorithms
12:15 - 14:00Lunch
14:00 - 14:45Alan Roytman - Packing Small Vectors
14:45 - 15:30Adi Vardi - Make-to-Order Integrated Scheduling and Distribution
15:30 - 16:00Coffee Break
16:00 - 16:45Florent Urrutia - Multi-Party Protocols, Information Complexity and Privacy
16:45 - 17:30Benny Chor - Finding Relatives Almost Privately in the Moderator Model
Thursday, June 2, 2016
9:30 - 10:15Pascal Koiran - Lower Bounds and Reconstruction Algorithms for Sums of Affine Powers
10:15 - 10:45Coffee Break
10:45 - 11:30Amnon Ta-Shma - Explicit two-source extractors for near-logarithmic min-entropy
11:30 - 12:15Frédéric Magniez - Stable Matching with Evolving Preferences
12:15 - 14:00Lunch
14:00 - 14:45Zvi Lotker - Social Networks and Plays
14:45 - 15:30Yinon Nahum - Social Network Cores
15:30 - 16:00Coffee Break
16:00 - 16:45Iordanis Kerenidis - Quantum Recommendation Systems
19:00 - 21:30Reception (cocktail dînatoire)
Friday, June 3, 2016
9:30 - 10:15Robert Krauthgamer - On Sketching Quadratic Forms
10:15 - 10:45Coffee Break
10:45 - 11:30Amos Fiat - Dynamic Pricing
11:30 - 12:15Vincent Cohen-Addad - One Size Fits All : Effectiveness of Local Search on Structured Data
12:15 - 14:00Lunch
14:00 - 14:45Allan Borodin - Rethinking Online and Greedy Algorithms
14:45 - 15:30Shiri Chechik - Deterministic Decremental Single Source Shortest Paths: Beyond the O(mn) Bound
15:30 - 15:45Coffee Break
15:45 - 16:30Guy Even - Sublinear Random Access Generators for Preferential Attachment Graphs
16:30 - 17:15Pierre Fraigniaud - Distributed Testing of Excluded Subgraphs
17:15 - 18:30Farewell cakes

Organizers