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 M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, March 07, 2013, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Ueli Peter

Fast Simulation of the IDLA Process

The internal diffusion limited aggregation (IDLA) process places n particles one after another on the two dimensional integer grid Z2. Every particle starts a random walk at (0,0) and remains at the first unoccupied grid position that it hits. The expected running time of a straightforward step-by-step simulation is \Theta(n2). Recently, Friedrich and Levine described an algorithm that samples from all possible outcomes of the IDLA process with the correct distribution and has an expected running time of O(n3/2). We improve on their result by presenting an algorithm that has an expected running time of O(n\log2 n). This is joint work with Karl Bringmann, Fabian Kuhn, Konstantinos Panagiotou and Henning Thomas.


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

Previous talks by year:   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