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: Tuesday, February 19, 2019, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Luis Barba

Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees

In the limited-workspace model, we assume that the input of size n lies in a random access read-only memory. The output has to be reported sequentially, and it cannot be accessed or modified. In addition, there is a read-write workspace of O(s) words, where s in {1, ..., n} is a given parameter. In a time-space trade-off, we are interested in how the running time of an algorithm improves as s varies from 1 to n. In this talk, we present a time-space trade-off for computing the Euclidean minimum spanning tree of a set V of n sites in the plane. Our running time is O(n^3 log s / s^2) time using O(s) words of workspace which smoothly transitions between the current best O(n^3)-time algorithm with O(1) words of space, and the well-known unconstrained O(n log n)-time algorithm with O(n) words of space. Joint work with Bahareh Banyassady and Wolfgang Mulzer from Freie Universität Berlin.

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

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