The  Weizmann  Institute  of  Science
                  Faculty of Mathematics and Computer Science
                    Foundations of Computer Science Seminar
                     Lecture Hall, Room 1, Ziskind Building
                          on Sunday, December 23, 2012
                                    at 11:00
                    Note the unusual day, time and location
                                  Amos Korman
                   CNRS and University Paris Diderot, France
                                 will speak on
                      Distributed Computing meets biology:
                       Towards a new Scientific Paradigm
In recent years, several works have demonstrated how the study of biology can
benefit from an algorithmic perspective. In this talk I discuss a new approach
for such a methodology based on combining theoretical tradeoff techniques with
field experiments to obtain bounds on biological parameters. A proof of concept
for this paradigm is provided by considering central search foraging strategies
of desert ants, and obtaining theoretical tradeoffs between the search time and
the memory complexity of individuals. Informally, we show that if the
time-competitiveness of the search algorithm is below $\log k$ then the memory
size of individuals (when starting the search) must be roughly $\log\log k$,
where $k$ is the total number of individuals. Combining such bounds with
successful experiments on living ants would provide a lower bound on the number
of states ants have when commencing the search. Such a lower bound may serve as
a quantitative evidence regarding the quorum sensing mechanism performed inside
the nest.
This talk is based on a recent work with Ofer Feinerman (Weizmann Institute)
Technion Math Net-2 (TECHMATH2)
Editor: Michael Cwikel   <> 
Announcement from: Yaeli Malka   <>