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: Thursday, October 27, 2011, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Anastasios Zouzias (University of Toronto)

A Matrix Hyperbolic Cosine Algorithm and Applications

In this talk, we will discuss a generalization of Spencer’s hyperbolic cosine algorithm to the matrix-valued setting. Then, we will apply the proposed algorithm on two graph theoretic problems and obtain fast deterministic algorithms for these problems. That is, we will describe a near-optimal deterministic algorithm that, given the multiplication table of a finite group of size n, constructs an Alon-Roichman expanding Cayley graph of logarithmic degree in O(n2 log3 n) time. Second, we will give a fast deterministic algorithm for spectral graph sparsification of dense graphs building on the work of Spielman and Srivastava.

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