Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, April 17, 2018, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Oren Luidor (Technion)

How many ants does it take to find some food?

We consider k ants walking on the d-dimensional cubic lattice in search for food. The motion of the ants is governed by a finite-state, possibly random, automaton and they can only communicate with each other when they are at the same site. For any d at least 1, what is the minimal k for which one can find an automaton that guarantees that at least one ant will find the food (no matter where it is placed) at time with finite mean? We answer this questions fully in d=1,2 and partially in d at least 3. Joint work with: L. Cohen, Y. Emek and J. Uitto.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login