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. In addition to talks by members of the LEA, there are usually talks by French, Israeli, and other invited speakers.
Previous workshops:
Room 011, Engineering Kitot Building (classrooms), Faculty
of Engineering, Tel-Aviv University.
The Engineering Kitot Building is located in the far south end
of the campus, adjacent to Gate number 17 (which is open only
for pedestrians).
Please check the map.
Program PDF Version with Abstracts
| 9:00 - 9:30 |
------ |
| 9:30 - 10:00 |
Registration and Coffee |
| 10:00 - 10:45 | Opening Remarks, Greetings: - Benny Chor (TAU) - Jacques Baudier (French Embassy) - Fadil Salih (MOST) |
| 10:45 - 11:00 | Coffee break |
| 11:00 - 11:30 | Michal Feldman -
Combinatorial Auctions via Posted Prices |
| 11:30 - 12:00 |
Miklos Santha - On
the complexity of trial and error for constraint
satisfaction problems |
| 12:00 - 12:30 | Irit Dinur - Old and new PCP constructions |
| 12:30 - 14:00 | Lunch Break To be found on Campus, see information. |
| 14:00 - 14:30 | Serge Abiteboul - Turning your digital self into a knowledge base |
| 14:30 - 15:00 | Tova Milo - Managing
General and Individual Knowledge in Crowdsourcing
Applications |
| 15:00 - 15:30 | Michel de Rougemont - Streaming Property Testing of Visibly Pushdown Languages |
| 15:30 - 16:00 | Coffee break |
| 16:00 - 16:30 | Marc Renault - Paid
Exchanges are Worth the Price |
| 16:30 - 17:00 | Uri Zwick - An
improved version of the Random-Facet pivoting rule
for the simplex algorithm |
|
Shiri Chechik - Approximate Distance Oracles with Improved Bounds |
|
| 9:30 - 10:00 |
Dana Ron - On Testing Dynamic Environments |
|
| 10:00 - 10:30 | Ronitt Rubinfeld - Sampling Correctors |
|
| 10:30 - 11:00 | Coffee break |
|
| 11:00 - 11:30 | Benny Chor - Three
Strikes at Protein Conservation |
|
| 11:30 - 12:00 | Gregory Kucherov -
Efficient index-based filtering for approximate
sequence search |
|
| 12:00 - 12:30 | Fabio Pardi -
Distance-based methods in phylogenomics |
|
| 12:30 - 14:00 | Lunch Break To be found on Campus, see information. |
|
| 14:00 - 14:30 | Nati Linial - Random
simplicial complexes and why we care |
|
| 14:30 - 15:00 | Allan Borodin -Weakly
submodular functions (or whatever you want to call
it) |
|
| 15:00 - 15:30 | Yossi Azar - Speed Scaling in the Non-clairvoyant Model |
|
| 15:30 - 16:00 | Coffee break | |
| 16:00 - 16:30 | Micha Sharir -
Incidence Geometry: The New Algebraic Revolution |
|
| 16:30 - 17:00 | Doron Shaharabani
-The Offset Filtration of Convex Objects |
|
20:00 |
Workshop Dinner |
| 9:00 - 9:30 | Amnon Ta-Shma - Fully
Explicit Hitting Set Generators for Low-Degree
Polynomials |
| 9:30 - 10:00 | Moti Medina - Online
Path Computation and Function Placement in SDNs |
| 10:00 - 10:30 | Boaz Patt-Shamir -
Distributed Algorithms for Approximate Weighted
Shortest Paths |
| 10:30 - 11:00 | Coffee break |
| 11:00 - 11:30 | Pierre Fraigniaud -
Randomized Local Network Computing |
| 11:30 - 12:00 | Mor Baruch - Randomized Proof-Labeling Schemes |
| 12:00 - 12:30 | Ran Canetti - Cryptographic Software Obfuscation and Applications |
| 12:30 - 14:00 | Lunch Break To be found on Campus, see information. |
| 14:00 - 14:30 | Noga Alon - Signrank
and VC-dimension |
| 14:30 - 15:00 | Sophie Laplante -
Relative Discrepancy Does Not Separate Information
and Communication Complexity |
| 15:00 - 15:30 | Rotem Oshman
- Using Information Theory to Understand Multi-Party
Communication |
| 15:30 - 16:30 | Cakes and farewell |