The French-Israeli Workshop on Foundations of Computer Science will
bring together French and Israeli scientists working in various
areas of
the Foundations of Computer Science. It is held as part of the
activities of the LEA (CNRS Laboratoire Européen
Associé) "French Israeli Laboratory on Foundations of
Computer Science" (under creation) between LIAFA (CNRS and Univ.
Paris Diderot) and Tel-Aviv University.
For further information please contact Adi Rosen at
adi.rosen@liafa.jussieu.fr.
9:00 -
9:15 Opening Remarks 9:15
-10:00 Guy Even - Analysis
of LP-decoding and message passing decoding using local optimality
10:00 -10:30 Coffee
break
10:30 -11:15
Benny Chor - Genetic Code
Symmetry and Efficient Design of GC-Constrained Coding Sequences 11:15 -12:00 Fabio
Pardi
- Reconstructing
evolutionary trees from distances
12:00 - 14:00 Lunch
(to be found in restaurants around...)
14:00 - 14:45 Adi
Rosén - Online
Computation with Advice 14:45 - 15:30 Christian
Konrad
- Language
and Graph Problems in the Streaming Model 15:30 - 16:00 Coffee break
16:00 - 16:45 Michel de
Rougemont - Approximate
verification and Enumeration problems
10:30 -11:15 Amos
Korman
- Ant Colonies and
Distributed Computing 11:15 -12:00 Pierre
Fraigniaud
- Distributed
Decision
12:00 - 14:00 Lunch (to be found in restaurants around...)
14:00 - 14:45 Amos Fiat
- Envy,
Greed, and some other Deadly Sins 14:45 - 15:30 Raghav
Kulkarni
- Fourier
spectrum of Boolean functions, Sparsity-granularity Theorem, and its
applications 15:30 - 16:00 Coffee break
16:00 - 16:45 Tova Milo
- Mob
Data Sourcing 16:45 - 17:30 Serge
Abiteboul
- Viewing the Web as a Distributed
Knowledge
Base
18:30 - 21:00 Reception (cocktail dinatoire) -
On the ground floor of the IHP
Friday
4/5/2012
9:15 -10:00
Yossi
Azar
- Fast
approximation algorithms for submodular optimization problems
10:00 -10:30 Coffee
break
10:30 -11:15
Iordanis Kerenidis
- Quantum
and Classical Communication Complexity 11:15 -12:00 Miklos Santha
- Quantum walks
and learning graphs
12:00 - 14:00 Lunch (to be found in restaurants around...)
14:00 - 14:45 Amnon Ta-Shma
- Algebraic
constructions of randomness extractors 14:45 - 15:30 David Xiao
- NP-hardness
and cryptography 15:30 - 16:00 Coffee break
16:00 - 16:45 Uri Zwick
- Randomized
pivoting rules for the simplex algorithm
Registration
Registration is MANDATORY
but free.
Registration must be received by April 20, 2012. But please register
by April 12 to allow us to prepare coffee breaks and a
reception.
Please email the following form to fiworkshop@liafa.jussieu.fr.
First name:
Last name:
Affiliation (as to appear on name tag):
Affiliation (as to appear in list of participants):
email: