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, April 09, 2015, 12:15 pm

Duration: 45 minutes

Location: OAT S15/S16/S17

Speaker: Alexandra Maximova

Combinatorial algorithms for Boolean Matrix Multiplication

Boolean Matrix Multiplication is one of the most fundamental problems in computer science. Two lines of theoretical research have been explored to solve this problem: algebraic algorithms, exploiting a ring structure and clever cancellations, and combinatorial algorithms, exploiting combinatorial redundances arising from representing matrices as graphs, often invoking lookup tables. In this talk I will summarize the findings of the "combinatorial" line of research, with particular focus on the recent algorithm by Timothy Chan [1].

[1] Timothy M. Chan. 2015. Speeding up the four Russians algorithm by about one more logarithmic factor. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '15). SIAM 212-217.

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